node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4 values |
|---|---|---|---|---|
7,385 | 9 | Side_effect_(computer_science):side effect computer science computer science operation function expression said side effect modifies state variable value outside local environment say observable effect besides returning value main effect invoker operation state data updated outside operation may maintained inside stateful object wider stateful system within operation performed example side effects include modifying non-local variable modifying static local variable modifying mutable argument passed reference performing i/o calling side-effect functions presence side effects program behaviour may depend history order evaluation matters understanding debugging function side effects requires knowledge context possible histories degree side effects used depends programming paradigm imperative programming commonly used produce side effects update system state contrast declarative programming commonly used report state system without side effects functional programming side effects rarely used lack side effects makes easier formal verifications program functional languages standard ml scheme scala restrict side effects customary programmers avoid functional language haskell expresses side effects i/o stateful computations using monadic actions assembly language programmers must aware hidden side effects—instructions modify parts processor state mentioned instruction mnemonic classic example hidden side effect arithmetic instruction implicitly modifies condition codes hidden side effect explicitly modifies register overt effect one potential drawback instruction set hidden side effects many instructions side effects single piece state like condition codes logic required update state sequentially may become performance bottleneck problem particularly acute processors designed pipelining since 1990 out-of-order execution processor may require additional control circuitry detect hidden side effects stall pipeline next instruction depends results effects absence side effects necessary sufficient condition referential transparency referential transparency means expression function call replaced value requires expression pure say expression must deterministic always give value input side-effect free side effects caused time taken operation execute usually ignored discussing side effects referential transparency cases hardware timing testing operations inserted specifically temporal side effects e.g codice_1 codice_2 instructions change state taking amount time complete function codice_3 side effects said idempotent sequential composition codice_4 called twice list arguments second call side effects assuming procedures called end first call start second call instance consider following python code codice_5 idempotent second call codice_5 argument change visible program state codice_7 already set 5 first call set 5 second call thus keeping value note distinct idempotence function composition codice_8 example absolute value idempotent function composition one common demonstration side effect behavior assignment operator c++ example assignment returns right operand side effect assigning value variable allows syntactically clean multiple assignment operator right associates equates result assigning 3 codice_9 gets assigned codice_10 presents potential hangup novice programmers may confuse | [
1997,
6507,
4847,
4302,
4305,
6614,
4135,
5734,
2740,
3100,
3188,
2567,
5662,
5932,
2662,
5311,
1852,
1854,
3383,
5353,
7750,
7924,
5164,
336,
7032,
5965,
6585,
171,
4743,
2619,
1992
] | Test |
7,386 | 1 | Personal_Identity_System:personal identity system personal identity system pis established 1947 register pakistani citizens personal identity system replaced national database registration authority 1972 independence pakistan prime minister liaquat ali khan launched personal identity system pis program registered managed issued national identification cards citizens pakistan muslim refugees settling pakistan | [
593
] | Test |
7,387 | 6 | TUGZip:tugzip tugzip freeware file archiver microsoft windows handles great variety archive formats including commonly used ones like zip rar gzip bzip2 sqx 7z also view disk image files like bin c2d img iso nrg tugzip repairs corrupted zip archives encrypt files 6 different algorithms since release tugzip 3.5.0.0 development suspended due lack time kindahl side tugzip supports following file formats | [
4213,
7058,
985,
4759,
1352,
6992,
5571,
658,
4700,
1955,
7746,
3032,
7201,
3219,
510,
8126,
1127,
2334,
6940,
4732,
5256,
3152,
169,
1139,
3413,
5349,
4461,
2897,
619
] | Test |
7,388 | 3 | Frogger:frogger frogger 1981 arcade game developed gremlin industries konami published sega object game direct frogs homes one one crossing busy road navigating river full hazards frogger positively received followed several clones sequels 2005 frogger various home video game incarnations sold 20 million copies worldwide including 5 million united states game found way popular culture including television music objective game guide frog empty frog homes top screen game starts three five seven frogs depending settings used operator losing ends game player control 4 direction joystick used navigate frog push direction causes frog hop direction frogger either single-player two players alternating frog starts bottom screen contains horizontal road occupied cars trucks bulldozers speeding along player must guide frog opposing lanes traffic avoid becoming roadkill results loss life road median strip separating two major parts screen upper portion screen consists river logs alligators turtles moving horizontally across screen jumping swiftly moving logs backs turtles alligators player guide frog safety player must avoid snakes otters open mouths alligators brightly colored lady frog sometimes log may carried bonus points top screen contains five frog homes destinations frog sometimes contain insects good lurking alligators bad game opening tune first verse japanese children song called inu omawarisan dog policeman japanese tunes played gameplay include themes anime hana ko lunlun araiguma rascal united states release kept opening song intact added yankee doodle softline 1982 stated frogger earned ominous distinction 'the arcade game ways die many different ways lose life illustrated skull crossbones symbol frog including hit running road vehicle jumping river water running snakes otters alligator jaws river jumping home invaded alligator staying top diving turtle completely submerged riding log alligator turtle side screen jumping home already occupied frog jumping side home bush running time five frogs homes game progresses next level increased difficulty five levels game gets briefly easier yet getting progressively harder level player 30 seconds guide frog one homes timer resets whenever life lost frog reaches home safely every forward step scores 10 points every frog arriving safely home scores 50 points 10 points also awarded per unused second time guiding lady frog home eating fly scores 200 points 5 frogs reach home end level player earns 1,000 points single bonus frog 20,000 points 99,990 points maximum high score achieved original arcade cabinet players may exceed score game keeps last 5 digits frogger ported many contemporary home systems several platforms capable accepting rom cartridges magnetic media systems commodore 64 received multiple versions game sierra on-line gained magnetic media rights sublicensed developers published systems normally supported sierra cornsoft published official trs-80/dragon 32 timex sinclair 1000 timex sinclair 2068 ports even atari 2600 received multiple releases cartridge cassette supercharger sierra released disk and/or tape ports c64 apple ii original 128k macintosh ibm pc atari 2600 supercharger well cartridge versions trs-80 color computer parker brothers received license sega cartridge versions produced cartridge ports frogger atari 2600 intellivision atari 5200 colecovision atari 8-bit family ti-99/4a vic-20 commodore 64 parker brothers spent 10 million advertising frogger sold three million cartridges company successful first-year product beating sales revenues previous best-seller merlin coleco also released stand-alone mini-arcade tabletop versions frogger along pac-man galaxian donkey kong sold three million units combined frogger also ported 1983 gakken compact vision tv boy one 6 launch titles ed driscoll reviewed atari vcs version frogger space gamer 58 driscoll commented liked arcade version save lot quarters price line cartridges also proves atari n't one making home versions major arcade games vcs danny goodman creative computing video arcade games wrote 1983 atari 2600 version frogger one detailed translations seen noting addition wraparound screen 2013 entertainment weekly named frogger one top ten games atari 2600 hasbro interactive released vastly expanded remake original microsoft windows playstation 1997 unlike original game consisted multiple levels different preceding one commercial success pc version alone selling nearly one million units less four months 1998 hasbro released series ports original game sega genesis super nes game com game boy game boy color port featured game different graphics sega genesis port featuring graphics original arcade game sega genesis snes versions last games released consoles north america despite using box art ports otherwise unrelated 1997 remake 2005 infospace teamed konami digital entertainment create mobile game frogger prizes players across u.s. competed multiplayer tournaments win daily weekly prizes 2006 mobile game version frogger grossed 10 million united states java port game available compatible mobile phones port frogger released xbox live arcade xbox 360 july 12 2006 developed digital eclipse published konami two new gameplay modes versus speed mode co-op play music including familiar frogger theme removed version replaced music version included compilation konami classics vol 1 home versions frogger numerous sequels including frogger great quest frogger helmet chaos frogger shown bipedal wearing shirt crossed-out truck frogger also inspired unofficial sequel sega 1991 called ribbit featured improved graphics simultaneous two-player action additionally prototype game based gameplay elements frogger developed sega game gear never released prototype contained additional features redesigned levels unofficial clones include ribbit apple ii 1981 acornsoft hopper 1983 bbc micro acorn electron f software frogger 1983 bbc micro zx spectrum pss ’ personal software services hopper oric 1 uk 1983 later release oric atmos froggy zx spectrum released djl software 1984 solo software frogger sharp mz-700 1984 uk version newbrain name leap frog several clones retained basic gameplay frogger changing style and/or plot pacific coast highway 1982 atari 8-bit family splits gameplay two alternating screens one highway one water preppie 1982 atari 8-bit family changes frog preppy retrieving golf balls country club frostbite 1983 atari 2600 uses frogger river gameplay arctic theme crossy road 2014 ios android windows phone randomly generated series road river sections game one endless level one life single point given forward hop atari 2600 game freeway often considered clone frogger game developed independently released 1981 2008 city melbourne created spin-off called grogger part public service campaign encourage people take safe transportation home night drinking frogger tied american popular culture found film television music 1983 frogger made animated television debut segment cbs saturday supercade cartoon lineup frogger voiced bob sarlatte worked investigative reporter segment aired one season 1998 game featured seinfeld episode frogger jerry george visit soon-to-be-closed pizzeria frequented teenagers discover frogger machine still place george decade-old high score still recorded buys machine tries get across street without letting lose power would erase high score initials glc season 4 episode george lopez friends n't let friends marry drunks george says son max play one frog tries cross street obvious reference frogger frogger also appears films wreck-it ralph pixels ralph breaks internet music frogger referenced also found 1982 buckner garcia recorded song called froggy lament using sound effects game released album pac-man fever punk band bad religion recorded song called frogger traffic los angeles song includes sample game theme music beginning frontman greg graffin claims playing frogger life result traffic song included band 1985 ep back known 2004 remaster debut album could hell worse uk girl group sugababes sampled coin-insert tone frogger game 2002 hit single freak like addition film television music frogger found popular culture mediums well 2006 group austin texas used modified roomba dressed frogger play real-life version game realm science frogger name given transposon jumping gene family fruit fly drosophila melanogaster november 26 1999 rickey world famous sauce offered 10,000 first person could score 1,000,000 points frogger 1,000 new world record prior january 1 2000 march 25 2005 robert mruczek offered 1,000 beating fictitious world record 860,630 set george costanza famous episode seinfeld 250 new world record end year december 1 2006 john cunningham offered 250 exceeding fictitious world record 860,630 points february 28 2007 one ever able achieve bounties scores surpassed bounties expired first score verified beaten fictional george costanza seinfeld score 860,630 points set pat laffaye december 22 2009 896,980 points surpassed michael smith springfield virginia usa score 970,440 points july 15 2012 current frogger world record holder pat laffaye westport connecticut usa august 15 2017 scored 1,029,990 points becoming first person ever break one million points original arcade machine | [
6788,
4759,
7430,
3190,
7179,
7903,
4503,
6195,
7469,
3045,
2148,
6943,
1237
] | Test |
7,389 | 0 | Statistical_semantics:statistical semantics linguistics statistical semantics applies methods statistics problem determining meaning words phrases ideally unsupervised learning degree precision least sufficient purpose information retrieval term statistical semantics first used warren weaver well-known paper machine translation argued word sense disambiguation machine translation based co-occurrence frequency context words near given target word underlying assumption word characterized company keeps advocated j.r. firth assumption known linguistics distributional hypothesis emile delavenay defined statistical semantics statistical study meanings words frequency order recurrence furnas et al 1983 frequently cited foundational contribution statistical semantics early success field latent semantic analysis research statistical semantics resulted wide variety algorithms use distributional hypothesis discover many aspects semantics applying statistical techniques large corpora statistical semantics focuses meanings common words relations common words unlike text mining tends focus whole documents document collections named entities names people places organizations statistical semantics subfield computational semantics turn subfield computational linguistics natural language processing many applications statistical semantics listed also addressed lexicon-based algorithms instead corpus-based algorithms statistical semantics one advantage corpus-based algorithms typically labour-intensive lexicon-based algorithms another advantage usually easier adapt new languages lexicon-based algorithms however best performance application often achieved combining two approaches | [
1269,
1314,
5429,
6827,
2882,
2884,
1209,
5304,
6925,
7290,
5885,
5008
] | Test |
7,390 | 8 | Query_string:query string internet query string part uniform resource locator url assigns values specified parameters query string commonly includes fields added base url web browser client application example part html form web server handle hypertext transfer protocol request either reading file file system based url path handling request using logic specific type resource cases special logic invoked query string available logic use processing along path component url typical url containing query string follows server receives request page may run program passing query string case codice_1 unchanged program question mark used separator part query string web frameworks may provide methods parsing multiple parameters query string separated delimiter example url multiple query parameters separated ampersand codice_2 order queries n't matter codice_3 codice_4 produce results exact structure query string standardized methods used parse query string may differ websites link web page may url contains query string html defines three ways user agent generate query string one original uses contain content html form also known web form particular form containing fields codice_5 codice_6 codice_7 submitted content fields encoded query string follows definitive standard web frameworks allow multiple values associated single field e.g codice_11 field form query string contains pair codice_12 web forms may include fields visible user fields included query string form submitted convention w3c recommendation w3c recommends web servers support semicolon separators addition ampersand separators allow application/x-www-form-urlencoded query strings urls within html documents without entity escape ampersands form content encoded url query string form submission method get encoding used default submission method post result submitted http request body rather included modified url forms added html browsers rendered element single-line text-input control text entered control sent server query string addition get request base url another url specified attribute intended allow web servers use provided text query criteria could return list matching pages text input indexed search control submitted encoded query string follows though element deprecated browsers longer support render still vestiges indexed search existence example source special handling plus sign 'codice_13 within browser url percent encoding today deprecation indexed search redundant codice_15 also web servers supporting cgi e.g. apache process query string command line arguments contain equals sign 'codice_8 per section 4.4 cgi 1.1 cgi scripts still depend use historic behavior urls embedded html characters part url example space characters special meaning url example character codice_17 used specify subsection fragment document html forms character codice_8 used separate name value uri generic syntax uses url encoding deal problem html forms make additional substitutions rather applying percent encoding characters space encoded 'codice_13 codice_15 html 5 specifies following transformation submitting html forms get method web server following brief summary algorithm octet corresponding tilde codice_35 permitted query strings rfc3986 required percent-encoded html forms codice_36 encoding space 'codice_13 selection as-is characters distinguishes encoding rfc 3986 form embedded html page follows form action= cgi-bin/test.cgi method= get /form user inserts strings “ field ” “ clear already ” two text fields presses submit button program codice_38 program specified codice_39 attribute codice_40 element example receive following query string codice_41 form processed server cgi script script may typically receive query string environment variable named codice_42 program receiving query string ignore part requested url corresponds file program whole query string ignored however regardless whether query string used whole url including stored server log files facts allow query strings used track users manner similar provided http cookies work every time user downloads page unique identifier must chosen added query string urls links page contains soon user follows one links corresponding url requested server way download page linked previous one example web page containing following requested unique string codice_43 chosen page modified follows addition query string change way page shown user user follows example first link browser requests page codice_44 server ignores follows codice_45 sends page codice_46 expected adding query string links well way subsequent page request user carry query string codice_43 making possible establish pages viewed user query strings often used association web beacons main differences query strings used tracking http cookies according http specification various ad hoc limitations request-line length found practice recommended http senders recipients support minimum request-line lengths 8000 octets url long web server fails 414 request-uri long http status code common workaround problems use post instead get store parameters request body length limits request bodies typically much higher url length example limit post size default 2 mb iis 4.0 128 kb iis 5.0 limit configurable apache2 using codice_48 directive specifies number bytes 0 meaning unlimited 2147483647 2 gb allowed request body | [
2086,
623,
5480,
833,
2576,
1479,
3383,
750,
7662,
7300,
80,
4198,
5355
] | Test |
7,391 | 9 | Closure_(computer_programming):closure computer programming programming languages closure also lexical closure function closure technique implementing lexically scoped name binding language first-class functions operationally closure record storing function together environment environment mapping associating free variable function variables used locally defined enclosing scope value reference name bound closure created unlike plain function closure allows function access captured variables closure copies values references even function invoked outside scope concept closures developed 1960s mechanical evaluation expressions λ-calculus first fully implemented 1970 language feature pal programming language support lexically scoped first-class functions peter j. landin defined term closure 1964 environment part control part used secd machine evaluating expressions joel moses credits landin introducing term closure refer lambda expression whose open bindings free variables closed bound lexical environment resulting closed expression closure usage subsequently adopted sussman steele defined scheme 1975 lexically scoped variant lisp became widespread term closure often used synonym anonymous function though strictly anonymous function function literal without name closure instance function value whose non-local variables bound either values storage locations depending language see lexical environment section example following python code values codice_1 codice_2 closures cases produced returning nested function free variable enclosing function free variable binds value parameter codice_3 enclosing function closures codice_1 codice_2 functionally identical difference implementation first case used nested function name codice_6 second case used anonymous nested function using python keyword codice_7 creating anonymous function original name used defining irrelevant closure value like value need assigned variable instead used directly shown last two lines example usage may deemed anonymous closure nested function definitions closures free variable yet bound enclosing function evaluated value parameter free variable nested function bound creating closure returned enclosing function lastly closure distinct function free variables outside scope non-local variables otherwise defining environment execution environment coincide nothing distinguish static dynamic binding distinguished names resolve values example program functions free variable codice_3 bound non-local variable codice_3 global scope executed environment codice_3 defined immaterial whether actually closures often achieved function return since function must defined within scope non-local variables case typically scope smaller also achieved variable shadowing reduces scope non-local variable though less common practice less useful shadowing discouraged example codice_11 seen closure codice_3 body codice_11 bound codice_3 global namespace codice_3 local codice_6 use closures associated languages functions first-class objects functions returned results higher-order functions passed arguments function calls functions free variables first-class returning one creates closure includes functional programming languages lisp ml well many modern multi-paradigm languages python rust closures also frequently used callbacks particularly event handlers javascript used interactions dynamic web page closures also used continuation-passing style hide state constructs objects control structures thus implemented closures languages closure may occur function defined within another function inner function refers local variables outer function run-time outer function executes closure formed consisting inner function code references upvalues variables outer function required closure closures typically appear languages first-class functions—in words languages enable functions passed arguments returned function calls bound variable names etc. like simpler types strings integers example consider following scheme function example lambda expression codice_17 appears within function codice_18 lambda expression evaluated scheme creates closure consisting code lambda expression reference codice_19 variable free variable inside lambda expression closure passed codice_20 function calls repeatedly determine books added result list discarded closure reference codice_19 use variable time codice_20 calls function codice_20 might defined completely separate file example rewritten javascript another popular language support closures codice_24 keyword used instead codice_7 codice_26 method instead global codice_20 function otherwise structure effect code function may create closure return following example closure case outlives execution function creates variables codice_11 codice_29 live function codice_30 returns even though execution left scope longer visible languages without closures lifetime automatic local variable coincides execution stack frame variable declared languages closures variables must continue exist long existing closures references commonly implemented using form garbage collection closure used associate function set private variables persist several invocations function scope variable encompasses closed-over function accessed program code stateful languages closures thus used implement paradigms state representation information hiding since closure upvalues closed-over variables indefinite extent value established one invocation remains available next closures used way longer referential transparency thus longer pure functions nevertheless commonly used impure functional languages scheme closures many uses note speakers call data structure binds lexical environment closure term usually refers specifically functions closures typically implemented special data structure contains pointer function code plus representation function lexical environment i.e. set available variables time closure created referencing environment binds non-local names corresponding variables lexical environment time closure created additionally extending lifetime least long lifetime closure closure entered later time possibly different lexical environment function executed non-local variables referring ones captured closure current environment language implementation easily support full closures run-time memory model allocates automatic variables linear stack languages function automatic local variables deallocated function returns however closure requires free variables references survive enclosing function execution therefore variables must allocated persist longer needed typically via heap allocation rather stack lifetime must managed survive closures referencing longer use explains typically languages natively support closures also use garbage collection alternatives manual memory management non-local variables explicitly allocating heap freeing done using stack allocation language accept certain use cases lead undefined behaviour due dangling pointers freed automatic variables lambda expressions c++11 nested functions gnu c. funarg problem functional argument problem describes difficulty implementing functions first class objects stack-based programming language c c++ similarly version 1 assumed programmer knows delegates automatic local variables references invalid return definition scope automatic local variables stack – still permits many useful functional patterns complex cases needs explicit heap allocation variables version 2 solved detecting variables must stored heap performs automatic allocation uses garbage collection versions need track usage variables passed strict functional languages immutable data e.g erlang easy implement automatic memory management garbage collection possible cycles variables references example erlang arguments variables allocated heap references additionally stored stack function returns references still valid heap cleaning done incremental garbage collector ml local variables lexically scoped hence define stack-like model since bound values objects implementation free copy values closure data structure way invisible programmer scheme algol-like lexical scope system dynamic variables garbage collection lacks stack programming model suffer limitations stack-based languages closures expressed naturally scheme lambda form encloses code free variables environment persist within program long possibly accessed used freely scheme expression closures closely related actors actor model concurrent computation values function lexical environment called acquaintances important issue closures concurrent programming languages whether variables closure updated updates synchronized actors provide one solution closures closely related function objects transformation former latter known defunctionalization lambda lifting see also closure conversion different languages always common definition lexical environment definitions closure may vary also commonly held minimalist definition lexical environment defines set bindings variables scope also closures language capture however meaning variable binding also differs imperative languages variables bind relative locations memory store values although relative location binding change runtime value bound location languages since closure captures binding operation variable whether done closure performed relative memory location often called capturing variable reference example illustrating concept ecmascript one language function codice_31 closures referred variables codice_11 codice_6 use relative memory location signified local variable codice_3 instances behaviour may undesirable necessary bind different lexical closure ecmascript would done using codice_35 example expected behaviour would link emit id clicked variable e bound scope lazy evaluated click actually happens click event emits id last element 'elements bound end loop variable codice_36 would need bound scope block using codice_37 codice_38 keyword hand many functional languages ml bind variables directly values case since way change value variable bound need share state closures—they use values often called capturing variable value java local anonymous classes also fall category—they require captured local variables codice_39 also means need share state languages enable choose capturing value variable location example c++11 captured variables either declared codice_40 means captured reference codice_41 means captured value yet another subset lazy functional languages haskell bind variables results future computations rather values consider example haskell binding codice_42 captured closure defined within function codice_31 computation codice_44—which case results division zero however since computation captured value error manifests closure invoked actually attempts use captured binding yet differences manifest behavior lexically scoped constructs codice_45 codice_46 codice_47 statements constructs general considered terms invoking escape continuation established enclosing control statement case codice_46 codice_47 interpretation requires looping constructs considered terms recursive function calls languages ecmascript codice_45 refers continuation established closure lexically innermost respect statement—thus codice_45 within closure transfers control code called however smalltalk superficially similar operator codice_52 invokes escape continuation established method invocation ignoring escape continuations intervening nested closures escape continuation particular closure invoked smalltalk implicitly reaching end closure code following examples ecmascript smalltalk highlight difference code snippets behave differently smalltalk codice_52 operator javascript codice_45 operator analogous ecmascript example codice_55 leave inner closure begin new iteration codice_56 loop whereas smalltalk example codice_57 abort loop return method codice_31 common lisp provides construct express either actions lisp codice_59 behaves smalltalk codice_57 lisp codice_61 behaves javascript codice_55 hence smalltalk makes possible captured escape continuation outlive extent successfully invoked consider closure returned method codice_31 invoked attempts return value invocation codice_31 created closure since call already returned smalltalk method invocation model follow spaghetti stack discipline facilitate multiple returns operation results error languages ruby enable programmer choose way codice_45 captured example ruby codice_66 codice_7 example ways create closure semantics closures thus created different respect codice_45 statement scheme definition scope codice_45 control statement explicit arbitrarily named 'return sake example following direct translation ruby sample languages features simulate behavior closures languages java c++ objective-c c vb.net features result language object-oriented paradigm c libraries support callbacks sometimes implemented providing two values registering callback library function pointer separate codice_70 pointer arbitrary data user choice library executes callback function passes along data pointer enables callback maintain state refer information captured time registered library idiom similar closures functionality syntax codice_70 pointer type safe c idiom differs type-safe closures c haskell ml callbacks extensively used gui widget toolkits implement event-driven programming associating general functions graphical widgets menus buttons check boxes sliders spinners etc application-specific functions implementing specific desired behavior application gcc extension nested function used function pointer emulate closures providing containing function exit example invalid typedef int *fn_int_to_int int //type function int- int fn_int_to_int adder int number int main void java enables classes defined inside methods called local classes classes named known anonymous classes anonymous inner classes local class either named anonymous may refer names lexically enclosing classes read-only variables marked codice_39 lexically enclosing method capturing codice_39 variables enables capture variables value even variable want capture non-codice_39 always copy temporary codice_39 variable class capturing variables reference emulated using codice_39 reference mutable container example single-element array local class able change value container reference able change contents container advent java 8 lambda expressions closure causes code executed local classes one types inner class declared within body method java also supports inner classes declared non-static members enclosing class normally referred inner classes defined body enclosing class full access instance variables enclosing class due binding instance variables inner class may instantiated explicit binding instance enclosing class using special syntax upon execution print integers 0 9 beware confuse type class nested class declared way accompanied usage static modifier desired effect instead classes special binding defined enclosing class java 8 java supports functions first class objects lambda expressions form considered type codice_77 domain u image type expression called codice_78 method standard method call apple introduced blocks form closure nonstandard extension c c++ objective-c 2.0 mac os x 10.6 snow leopard ios 4.0 apple made implementation available gcc clang compilers pointers block block literals marked codice_52 normal local variables captured value block created read-only inside block variables captured reference marked codice_80 blocks need persist outside scope created may need copied c sharp programming language |c anonymous methods lambda expressions support closure visual basic .net many language features similar c also supports lambda expressions closures programming language |d closures implemented delegates function pointer paired context pointer e.g class instance stack frame heap case closures version 1 limited closure support example code work correctly variable stack returning test longer valid use probably calling foo via dg return 'random integer solved explicitly allocating variable heap using structs class store needed closed variables construct delegate method implementing code closures passed functions long used referenced values still valid example calling another function closure callback parameter useful writing generic data processing code limitation practice often issue limitation fixed version 2 variable automatically allocated heap used inner function delegate function escape current scope via assignment dg return local variables arguments referenced delegates referenced delegates escape current scope remain stack simpler faster heap allocation true inner class methods references function variables c++ enables defining function object overloading codice_81 objects behave somewhat like functions functional programming language may created runtime may contain state implicitly capture local variables closures c++11|the 2011 revision c++ language also supports closures type function object constructed automatically special language construct called lambda-expression c++ closure may capture context either storing copies accessed variables members closure object reference latter case closure object escapes scope referenced object invoking codice_81 causes undefined behavior since c++ closures extend lifetime context eiffel programming language |eiffel includes inline agents defining closures inline agent object representing routine defined giving code routine in-line example argument codice_83 agent representing procedure two arguments procedure finds country corresponding coordinates displays whole agent subscribed event type codice_84 certain button whenever instance event type occurs button — user clicked button — procedure executed mouse coordinates passed arguments codice_3 codice_86 main limitation eiffel agents distinguishes closures languages reference local variables enclosing scope design decision helps avoiding ambiguity talking local variable value closure latest value variable value captured agent created codice_87 reference current object analogous codice_88 java features arguments agent accessed within agent body values outer local variables passed providing additional closed operands agent embarcadero c++builder provides reserve word __closure provide pointer method similar syntax function pointer standard c could write pointer function type using following syntax typedef void *tmyfunctionpointer void similar way declare pointer method using following syntax typedef void __closure *tmymethodpointer category programming language concepts category implementation functional programming languages category subroutines category articles example python code category articles example scheme code category articles example javascript code category articles example c++ code category articles example eiffel code category articles example c sharp code category articles example code category articles example objective-c code category articles example java code category articles example ruby code category articles example smalltalk code category articles example haskell code | [
1616,
274,
2451,
5014,
4573,
6415,
5986,
1445,
7333,
2827,
4039,
6172,
1825,
8174,
6980,
6428,
1363,
7256,
2740,
7352,
3368,
310,
1191,
920,
2662,
6911,
231,
1116,
6750,
235,
5506,
5164,
1407,
7032,
7123,
4543,
5965,
6319,
5091,
1435
] | Validation |
7,392 | 4 | OpenPuff:openpuff openpuff steganography watermarking sometimes abbreviated openpuff puff freeware steganography tool microsoft windows created cosimo oliboni still maintained independent software program notable first steganography tool version 1.01 released december 2004 last revision supports wide range carrier formats openpuff used primarily anonymous asynchronous data sharing advantage steganography cryptography alone messages attract attention plainly visible encrypted messages — matter unbreakable — arouse suspicion may incriminating countries encryption illegal therefore whereas cryptography protects contents message steganography said protect messages communicating parties watermarking action signing file id copyright mark openpuff invisible steganographic way applied supported carrier invisible mark password protected accessible everyone using program openpuff semi-open source program cryptographic algorithms 16 taken aes nessie cryptrec joined unique multi-cryptography algorithm extensive testing performed statistical resistance properties csprng multi-cryptography modules using ent nist diehard test suites provided results taken 64kb 128kb ... 256mb samples security performance steganalysis resistance conflicting trade-offs security vs performance whitening security vs. steganalysis cryptography whitening data carrier injection encrypted whitened small amount hidden data turns big chunk pseudorandom suspicious data carrier injection encodes using non linear covering function takes also original carrier bits input modified carriers need much less change con1 lowering random-like statistical response deceive many steganalysis tests con2 always non-negligible probability detected even hidden stream behaves like “ natural container ” unpredictable side-effects caught flagrante delicto etc. resisting unpredictable attacks also possible even user forced legal physical coercion provide valid password deniable steganography decoy-based technique allows user deny convincingly fact sensitive data hidden user needs provide expendable decoy data would plausibly want keep confidential reveal attacker claiming | [
3257,
4759,
5571
] | Validation |
7,393 | 2 | Nokia_Nseries:nokia nseries nokia nseries multimedia smartphone tablet product family engineered marketed nokia corporation nseries devices commonly supported multiple high-speed wireless technologies 3g wireless lan digital multimedia services music playback photo/video capture viewing gaming internet services also supported line replaced 2011 nokia lumia line company flagship smartphone portfolio nokia n1 tablet introduced november 2014 revived n prefix marketed 'nseries 27 april 2005 nokia announced new brand multimedia devices press conference mobile phone manufacturers amsterdam first three nseries devices introduced conference consists n70 n90 n91 2 november 2005 nokia announced n71 n80 n92 25 april 2006 nokia announced n72 n73 n93 26 september 2006 nokia announced n75 n95 8 january 2007 nokia announced nokia n76 nokia n77 nokia n93i 29 august 2007 nokia announced n95 8gb n81 n81 8gb 14 november 2007 nokia announced n82 first nokia xenon flash 2008 gsma held barcelona n96 n78 unveiled two new nseries devices revealed end august 2008 nokia n79 nokia n85 december 2 2008 nokia nseries announced nokia n97 february 17 2009 nokia announced nokia n86 8 mp nokia first 8-megapixel phone nokia n8 12-megapixel camera announced april 2010 21 june 2011 nokia showcased nokia n9 based meego os fourth non-symbian nseries device n800 n810 n900 nseries retired replaced lumia year company introduced nokia n1 tablet november 18 2014 marked return n prefix 'nseries branding still absent nokia nseries aimed users looking pack many features possible one device better-than-average cameras often found nseries devices many using higher-quality carl zeiss optics one example video music playback photo viewing capabilities devices resemble standalone portable media devices 2008 recently launched devices gps mp3 player wlan functionality also present numbers describe traits phone exceptions though considering n8x n82 n86 8mp top-of-the-range smartphones advanced cameras clearly 'high-end fellow n9x models first nseries device n90 ran symbian os 8.1 mobile operating system n70 n72 nokia n8 released september 2010 world first phone run symbian^3 first phone nokia featuring 12-megapixel autofocus lens also last nseries phone run symbian os n800 n810 n900 nokia chose use linux-based maemo operating system last nseries mobile phones n9 developer-only n950 released september 2011 maemo merged intel moblin create meego may 2010 nokia opted use meego harmattan 1.2 n9/n950 november 18 2014 nokia announced n1 android 5.0 tablet june nokia connections singapore nokia launched new n9 meego 1.2 harmattan os company calls qt device whole app ui framework written qt also world first pure touch phone buttons home screen great new swipe ui reviews average good phone reviewers liking phone good quality operating system expressing concern fact loses competitors terms specs device expected sold selected regions q3 2011 | [
1066,
5979,
2271,
6517,
372,
1724,
7521,
3615,
1453,
4935,
3694,
3524,
3952,
472,
5909,
8072,
2922,
4407,
118,
23,
2564,
3703,
7261,
7545,
5044,
578,
5493,
740,
1202,
5315,
3029,
5499,
7012,
139,
6465,
5062,
3039,
3653,
1582,
4894,
5068... | Validation |
7,394 | 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 | [
5983,
1345,
1445,
4302,
7333,
6172,
993,
109,
6428,
4589,
3955,
8082,
2740,
304,
4053,
6277,
2661,
1476,
7005,
7460,
666,
6029,
4164,
1114,
5948,
5855,
5506,
7844,
2803,
3898,
5510,
1774,
2871,
7394,
8122,
7032,
2881,
5965,
5786,
2619,
... | Train |
7,395 | 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 | [
3172,
6015,
6016
] | Test |
7,396 | 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 | [
1807,
4297,
7161,
4670,
5021,
13,
6088,
3271,
6804,
3276,
5041,
4326,
7546,
7550,
4336,
405,
1855,
2582,
4347,
65,
3664,
771,
1134,
4733,
6853,
5088,
6500,
7950,
785,
2266,
788,
3682,
1522,
7605,
7611,
4759,
7242,
5110,
4397,
6892,
2286... | Test |
7,397 | 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 | [
4337,
1718,
3581,
1144
] | Test |
7,398 | 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 | [
3795,
5116
] | Test |
7,399 | 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 | [] | Validation |
7,400 | 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 | [
612,
578
] | Test |
7,401 | 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 | [] | Test |
7,402 | 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 | [
6526,
2789,
6208,
3745,
7753,
2893,
3093,
7189,
1805,
271
] | Validation |
7,403 | 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 | [
5097,
2451,
5100,
6074,
3849,
1451,
2379,
1458,
7442,
2743,
2744,
7364,
578,
1284,
4435,
7666,
694,
2522,
7499,
1237,
3156,
352,
1331,
971
] | Test |
7,404 | 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 | [
6788,
7890,
4320,
4690,
734,
5752,
405,
6125,
2954,
6847,
4003,
6142,
2609,
1897,
4376,
5450,
4749,
7601,
6165,
3001,
120,
1940,
2300,
3025,
5141,
502,
2679,
2327,
6565,
2331,
3050,
163,
1599,
1234,
3412,
889,
6971,
552,
3445,
3107,
165... | Validation |
7,405 | 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 | [
4382,
2451,
4600,
3850,
3383,
6024
] | Test |
7,406 | 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 | [] | Test |
7,407 | 9 | Inductive_data_type:inductive data type inductive data type may refer | [] | Train |
7,408 | 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 | [
6788,
3940,
7890,
5732,
722,
1094,
4320,
2926,
4690,
5037,
734,
5752,
405,
6125,
2954,
1123,
7572,
6482,
6847,
4003,
6142,
2609,
1895,
4373,
1897,
7226,
4376,
2978,
5091,
4749,
5450,
7601,
3346,
6165,
4389,
5463,
102,
5469,
4768,
3001,
... | Validation |
7,409 | 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 | [
1507,
518
] | Test |
7,410 | 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 | [
1314,
3959,
2882,
2629,
6,
5782,
5304,
2553,
5729
] | Validation |
7,411 | 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 | [
8154,
3168,
5542,
5631,
5369,
1349,
4126,
5206,
5820,
3363,
5214,
2646,
6270,
1834,
2291,
4743,
7537,
8182,
6536,
26,
5571,
7544,
7988,
4701,
7952,
1392,
7786,
417,
3135,
2506,
6221,
1686,
3408,
4635,
7628,
1602,
6061,
1989,
2973,
84,
1... | Test |
7,412 | 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 | [
5012,
5371,
3948,
7529,
5737,
5042,
1481,
5055,
2226,
1867,
2248,
1506,
6148,
441,
4047,
5483,
5487,
6198,
1568,
1570,
7666,
515,
5521,
3747,
1237,
6236,
534,
7314,
1252,
4847,
4479,
895,
4864,
7728,
216,
4154,
5939,
4524,
5243,
6299,
8... | Test |
7,413 | 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 | [
5856,
7597,
6823
] | Train |
7,414 | 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 | [
180,
2859,
7072,
7554,
2090,
3915,
5504,
8111,
5571,
7570,
2615,
4771
] | Test |
7,415 | 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 | [
4295,
7795,
189,
651,
32,
5940,
4979,
5599,
2961,
1134,
1505,
972,
1805
] | Test |
7,416 | 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 | [
4573,
279,
5082,
4193,
7417,
1030,
6750,
6778,
3968,
1170,
6911,
7005,
1854
] | Test |
7,417 | 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 | [
4573,
4847,
3968,
920,
7005,
1854,
4705,
7557,
5164,
4543,
6148,
7416
] | Test |
7,418 | 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 | [
2236,
3531
] | Test |
7,419 | 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 | [
3814,
518
] | Validation |
7,420 | 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 | [
8025,
4543,
1445
] | Test |
7,421 | 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 | [
651,
1942
] | Test |
7,422 | 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 | [
1718,
5304
] | Test |
7,423 | 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 | [
6693,
1052,
4803,
7423,
4277,
5347,
7225
] | Test |
7,424 | 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 | [
4600,
84
] | Test |
7,425 | 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 | [
5452,
91,
4759,
3089,
1931,
385,
910,
1838,
6005,
2296,
4689,
6006,
4783,
3111,
7087,
496,
6644,
5144,
7193,
3123,
142,
935,
1395,
3561,
5066,
7478,
6043,
6305,
8134,
6777,
4645,
88
] | Test |
7,426 | 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 | [
1361,
931,
5678,
5571,
1243,
4244,
1435
] | Test |
7,427 | 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 | [
7175,
2650,
6252,
3828,
4527
] | Test |
7,428 | 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 | [
3254,
6332,
1346,
8163,
4864,
1006,
5932,
5841,
6912,
1023,
3389,
1494,
4444,
2961,
72,
2803,
4837,
5539
] | Train |
7,429 | 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 | [
3938,
3084,
462,
1351,
1822,
4401,
5292,
3780,
5829,
1192,
578,
7740,
7463,
7559,
5759,
589,
412,
4435,
3133,
2689,
3404,
7855,
966,
968,
2260,
8149
] | Validation |
7,430 | 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 | [
1237,
7179,
7388,
5397,
3045,
2148
] | Test |
7,431 | 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 | [
2902,
6788,
3933,
5372,
6427,
1095,
2569,
740,
4340,
42,
3309,
3310,
7924,
2591,
5771,
5775,
6153,
7956,
5455,
4762,
7967,
6176,
5473,
1544,
474,
5476,
6183,
822,
831,
5141,
136,
2317,
2673,
6209,
7285,
2683,
855,
6937,
4089,
168,
6232,... | Test |
7,432 | 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 | [
5540,
6788,
3764,
4575,
5200,
1629,
3444,
7251,
474,
2204,
6987,
7075,
1941,
314,
5666,
2758,
499,
1663,
2864,
6209,
7848,
6761,
2063,
343,
4824,
5523,
7587,
5259,
1893,
5530,
5704,
6317,
352,
972,
7954,
6244,
5713
] | Test |
7,433 | 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 | [
5142,
772,
3525,
3207
] | Test |
7,434 | 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 |
7,435 | 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 | [
6507,
4759,
1361,
304,
5571,
578,
666,
5506,
3225,
8137,
5965,
3915,
5353,
4105,
2619
] | Test |
7,436 | 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 | [
4089,
6016,
4759
] | Test |
7,437 | 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 | [
6856
] | Validation |
7,438 | 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 | [
7149,
1445,
6420,
714,
6800,
6428,
720,
1460,
1840,
2568,
2928,
3290,
7907,
5747,
405,
6116,
2953,
6840,
7573,
422,
5786,
1895,
5787,
4017,
5091,
6504,
447,
1152,
4022,
1154,
4026,
7607,
1526,
3687,
4759,
2639,
2283,
5479,
3368,
7263,
4... | Train |
7,439 | 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 | [
340,
2338,
6312,
578
] | Test |
7,440 | 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 | [
796,
298
] | Test |
7,441 | 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 | [
2173,
2632,
4759,
2376,
1632,
6715,
3281,
651,
7186,
2577,
5401,
6740,
6370,
5675,
7657,
51,
7294,
2693,
2789,
7307,
3154,
7600,
2535,
4110,
6328
] | Validation |
7,442 | 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 | [
2903,
5718,
1458,
5737,
2926,
1473,
5750,
1481,
4341,
5781,
5784,
5794,
3007,
3008,
5822,
4408,
3015,
1556,
3020,
3025,
1568,
1570,
136,
7280,
1595,
3063,
7314,
1607,
4472,
4479,
1640,
3107,
216,
1652,
5939,
5947,
4524,
1670,
240,
4537,
... | Test |
7,443 | 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 | [
7148,
456,
6879,
2281,
6521,
6976,
3775,
993,
3855,
2644,
7170,
6531,
1462,
2650,
7637,
7082,
2119,
6908,
7091,
3383,
2219,
3640,
3797,
2043,
3312,
2057,
3819,
3820,
3821,
7214,
7217,
7765,
259,
5880,
2901
] | Test |
7,444 | 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 | [
6506,
7238,
894,
4303,
5728,
7805,
2741,
7896,
917,
5571,
3463,
3542,
3204,
1286,
6821,
5054,
840,
1392,
3031,
5408,
3558,
5677,
3479,
5419,
5863,
6387,
5075,
6137,
7488,
7857,
5874,
3915,
1511,
4742,
5007,
1333,
702
] | Validation |
7,445 | 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 | [
352,
7499
] | Test |
7,446 | 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 | [
2743,
3063,
1237,
5401
] | Test |
7,447 | 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 | [
1998
] | Validation |
7,448 | 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 | [
5367,
1255,
12,
2463,
6891,
8183,
4139,
5651,
2925,
5926,
5129,
5571,
7906,
5137,
5234,
2941,
3303,
6027,
7839,
4435,
1304,
61,
6394,
4003,
5079,
7864,
1789,
5877,
4012,
4745,
1064
] | Train |
7,449 | 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 | [
5012,
6793,
3942,
1447,
5371,
3948,
7527,
7529,
5737,
2567,
4694,
5042,
1481,
5055,
2226,
1867,
766,
2248,
6148,
6152,
441,
2977,
2266,
5802,
6170,
4765,
4047,
1180,
5483,
1556,
5487,
3020,
6198,
3717,
1568,
1570,
6922,
7666,
515,
8024,
... | Test |
7,450 | 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 | [] | Test |
7,451 | 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 | [
3937,
1076,
3263,
378,
2198,
1460,
6096,
5392,
1475,
7553,
5410,
7564,
6840,
422,
6844,
2245,
435,
5442,
5090,
3340,
7602,
6164,
2631,
1534,
6885,
7619,
2999,
5814,
6528,
2290,
4774,
1181,
3711,
140,
6558,
6575,
3407,
3057,
1597,
2345,
... | Test |
7,452 | 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 | [
768,
7452,
740,
5775
] | Validation |
7,453 | 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 | [
2539,
6788,
5012,
3262,
3942,
1447,
5371,
3948,
7527,
7529,
5737,
4318,
7535,
2926,
5740,
2567,
4694,
5042,
6817,
3294,
3299,
1481,
5055,
5405,
2226,
1864,
1867,
6474,
2601,
766,
67,
2961,
2248,
5436,
6148,
2257,
6152,
441,
2977,
5447,
... | Test |
7,454 | 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 | [
1522,
7325,
7605,
280,
2818,
4759,
190,
4670,
5021,
8066,
8167,
4397,
13,
5644,
3271,
5116,
6984,
299,
3626,
7142,
5571,
2300,
5041,
7827,
4786,
578,
7550,
4244,
5232,
1992,
405,
6367,
8003,
6922,
8115,
5161,
5865,
7396,
65,
861,
5962,
... | Test |
7,455 | 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 | [
5149,
3172,
4261,
3794,
1805
] | Test |
7,456 | 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 | [
4759,
1669,
578
] | Test |
7,457 | 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 | [
6507,
1522,
3509,
5275,
5911,
1361,
5125,
5571,
1853,
1854,
5055,
2226,
8117,
4985,
4087,
2881,
3915,
5883,
6498,
534,
2900,
1435
] | Train |
7,458 | 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 | [
623,
1805
] | Test |
7,459 | 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 | [
2624,
5363,
1524,
3077,
5015,
631,
7347,
5569,
5571,
6280,
3543,
7459,
401,
7093,
2487,
3879,
7460,
5408,
7109,
4185,
2519,
2520,
4997,
3915,
5965,
8137,
6156,
6778,
6319,
2619,
1435,
2807,
4287
] | Test |
7,460 | 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 | [
1437,
4302,
379,
6428,
399,
401,
1114,
5082,
2619,
109,
4053,
2658,
2661,
7277,
505,
5855,
5510,
1989,
1616,
3077,
6605,
4477,
7333,
6980,
7347,
8085,
6277,
7005,
4156,
4164,
7394,
8129,
6680,
6319,
5623,
270,
1345,
631,
8174,
1361,
600... | Test |
7,461 | 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 | [
2447,
5177,
2566,
2523,
7567,
2216,
3046,
7120
] | Test |
7,462 | 7 | Talarian:talarian talarian provider real-time infrastructure software part tibco veteran provider message-oriented middleware talarian member business integration group big internet protocol multicast initiative ipmi securities industry middleware council simc object management group omg internet engineering task force ietf smartsockets main product talarian real-time message-oriented middleware mom scalable fault tolerant programming model built specifically offer high-speed interprocess communication ipc multiprocessor architecture scalability reliability supports variety communication paradigms including publish-subscribe adaptive multicast redundant connections peer-to-peer rpc included part smartsockets package graphical tools monitoring debugging applications supported wide range platforms applications using smartsockets developed following languages smartsockets product tibco see acquisition january 2002 tibco acquired talarian approximately 115 million primary competitor delivery high-performance messaging solutions tibco paid 5.30 per share half stock half cash talarian outstanding shares talarian customers large end-users oems systems integrators need solutions real-time data flow supports high information volumes list famous customers | [
5666,
6025,
3764,
827,
5447
] | Test |
7,463 | 2 | Benjamin_Mako_Hill:benjamin mako hill benjamin mako hill born december 2 1980 free software activist hacker author contributor free software developer part debian ubuntu projects well co-author three technical manuals subject debian gnu/linux 3.1 bible official ubuntu server book official ubuntu book hill assistant professor communication university washington serves member free software foundation board directors hill master degree mit media lab received phd interdepartmental program involving mit sloan school management mit media lab fall 2013 assistant professor department communication university washington also fellow mit center civic media coordinates development software civic organizing worked advisor contractor one laptop per child project speaker gnu project serves board software freedom international organization organizes software freedom day 2006 married mika matsuzaki used mathematically constrained wedding vows marriage ceremony since 1999 hill active member debian served delegate debian project leader founder coordinator debian non-profit debian custom distribution designed fill needs small non-profit organizations addition served board software public interest march 2003 july 2006 serving organisation vice-president august 2004 hill also core developer founding member ubuntu continues active contributor project addition technical responsibilities coordinated construction community around ubuntu project project community manager later ceding role jono bacon ubuntu first year half period worked full-time canonical ltd within project served community council governance board oversees non-technical aspects project october 2011 work included contributing code conduct diversity statement project addition software development hill writes extensively published academic books magazines newsletters online journals slate magazine republished one blog posts author free software project management howto canonical document managing foss projects published academic work foss anthropological sociological management software engineering perspectives written spoken intellectual property copyright collaboration generally also studied sociology community involvement web communities widely published cited projects like scratch wikipedia talked topics publicly well giving keynote address 2008 oscon hill worked several years consultant foss projects specializing coordinating releases software free open software structuring development efforts encourage community involvement spends significant amount time traveling giving talks foss intellectual property primarily europe north america previous current positions hill pursued research full-time graduate researcher mit media laboratory lab worked electronic publishing computing culture groups collaborative writing decision-making software one project selectricity award-winning voting tool received prizes grants mtv cisco fellow harvard berkman center internet society mit center civic media served advisory board wikimedia foundation advisory council open knowledge foundation board free software foundation founding member ubuntu community council 2009 2019 research symbiont award -- general symbiont | [
707,
3938,
1822,
6086,
2916,
7528,
2559,
7555,
5757,
2585,
3981,
5759,
7559,
412,
753,
761,
2599,
7581,
6489,
5787,
2260,
4020,
1523,
5453,
2985,
5803,
6876,
462,
7969,
1535,
1176,
4401,
5829,
2297,
1192,
1563,
6549,
4070,
6211,
4435,
5... | Test |
7,464 | 3 | Amstrad_PC2286:amstrad pc2286 amstrad 286 pc2286 launched 1989 2000 series launched professional follow pc1512/1640 2000 series consisted 2086 8086 2286 80286 2386 80386dx series used plastic case similar 1512/1640 time main computer unit power supply unit built machines bios setting battery backed however unusually used 4x aa battery mounted top based unit 2286 came 3.5 floppy drives standard side port connecting external 5 1/4 inch disk drive package contained one range monitors screen 12 14 vga mono vga color 16-bit intel 80286 cpu 12.5 mhz 1 mb ram 40 mb vga adaptor supporting mda cga hercules ega mcga evga serial parallel 5.25 inch 3.5 inch fdd mouse | [
3303,
6380
] | Validation |
7,465 | 3 | MOVHPD:movhpd x86 assembly programming language movhpd name specific action performable modern x86 processors 2nd-generation streaming simd extensions sse2 action involves either copying number memory temporary space copying number temporary space memory specifically movhpd causes value 8-byte memory region either copied assigned upper half xmm register source operand either xmm register xmm memory address m64 source operand xmm register destination operand must memory address source operand memory address destination operand must xmm register note lower half xmm register unaffected operation x86 instruction listings | [
4611,
4215,
352,
4077,
6171,
1335
] | Validation |
7,466 | 3 | Macintosh_Classic:macintosh classic macintosh classic personal computer designed manufactured sold apple computer inc. october 1990 september 1992 first macintosh sell less us 1,000 production classic prompted success macintosh plus macintosh se system specifications classic similar predecessors monochrome crt display 512×342 pixel resolution 4 megabyte mb memory limit older macintosh computers apple decision update classic newer technology 68010 cpu higher ram capacity color display resulted criticism reviewers macworld describing nothing gloat beyond low price unexceptional ensured compatibility mac by-then healthy software base well enabled fit lower price apple intended nevertheless classic featured several improvements aging macintosh plus replaced apple low-end mac computer 25 percent faster plus included apple superdrive floppy disk drive standard classic adaptation jerry manock terry oyama 1984 macintosh 128k industrial design earlier macintosh se apple released two versions ranged price 1,000 1,500 price availability education software led classic popularity education sold alongside powerful macintosh classic ii 1991 discontinuation next year apple co-founder steve jobs left apple 1985 product development handed jean-louis gassée formerly manager apple france gassée consistently pushed apple product line two directions towards openness terms expandability interoperability towards higher price gassée long argued apple market computers towards low end market profits thin instead concentrate high end higher profit margins illustrated concept using graph showing price/performance ratio computers low-power low-cost machines lower left high-power high-cost machines upper right high-right goal became mantra among upper management said fifty-five die referring gassée goal 55 percent profit margin high-right policy led series machines ever-increasing prices original macintosh plans called system around 1,000 time morphed jef raskin original vision easy-to-use machine composing text documents jobs concept incorporating ideas gleaned trip xerox parc mac list price ballooned 2,495 price mac systems continued climb macintosh plus slightly expensive 2,599 se 2,900 3,900 depending model basic macintosh ii 40 mb hard drive least 5,500 launch price increasing late 1988 modern machines cost even macintosh iicx 5,369 iici 6,269 iifx 9,900 without monitors keyboards color crts relatively expensive late 1980s apple 14-inch 640×480 monitor list price 999 apple adb keyboards high quality similarly expensive inexpensive machine lineup late 1980s several-year-old mac plus selling around 1,800 low-left market abandoned years earlier booming turbo xts ignored high end unix workstations likes sun sgi apple fortunes 1980s quickly reversed christmas season 1989 drove point home first decrease sales years accompanying 20 percent drop apple stock price quarter january 1990 gassée resigned authority product development divided among several successors many apple engineers long pressing lower-cost options order build market share increase demand across entire price spectrum gassée rush started quickly introduce series low-cost machines three market points identified low-cost machine aimed costing 1,000 low-cost machine color graphics upscale color machine small business use time would develop classic macintosh lc macintosh iisi unlike '020 '030 based models macintosh classic original macintosh startup sound macweek magazine reported july 10 1990 apple paid 1 million modular computer systems inc. subsidiary daimler-benz ag right use classic name part five-year contract apple renew contract ended macweek speculated macintosh classic would use 8 megahertz mhz motorola 68000 microprocessor display predecessors classic would priced 1,500 2,150 december 12 1990 john sculley apple ceo introduced classic press conference announcing pricing would start 1,000 saying reach new customers n't lower prices existing products redesigned computers ground features customers told us value apple new pricing strategy caused concern among investors thought would reduce profit margins brodie keast apple product marketing manager said prepared whatever takes reach people macintosh ... plan get aggressive price need release classic apple share price closed 27.75 per share 50 cents october 12 1990 far previous 12-month high 50.37 classic released europe japan concurrently united states release japan classic retailed 198,000 yen 1,523 us matching price toshiba dynabook laptop computer spending 40 million marketing classic first-time buyers apple difficulty meeting high demand apple doubled manufacturing space 1990 expanding singapore cork ireland factories classic assembled air freight rather sea shipping used speed delivery shortage caused concern among dealers blamed apple poor business planning macintosh classics lcs given scholastic software 12 weeks officially announced scholastic planned release 16 new macintosh products 1991 peter kelman scholastic publisher predicted macintosh would become school machine nineties classic sold schools 800 availability educational software led classic popularity education sector low-end model sold 1 mb memory 1.44 mb floppy drive hard disk included keyboard 999 high-end model cost 1,499 contained additional 1 mb memory expansion card 40 mb hard disk classic features several improvements macintosh plus replaced apple low-end mac computer 25 percent faster plus fast se includes apple superdrive 3.5 floppy disk drive standard superdrive read write macintosh ms-dos os/2 prodos disks also classic last compact mac use motorola 68000 central processing unit cpu classic uses system 6.0.7 operating system support versions system 7.5.5 hidden hierarchical file system hfs disk volume contained read-only memory rom includes system 6.0.3 mac classic booted system 6.0.3 holding keys boot dealers included software bundle called smartbundle classic also sold separately 349 includes t/maker writenow word processor ashton-tate full impact spreadsheet program recordholderplus database silicon beach software superpaint 2.0 paint draw program macintosh classic final adaptation jerry manock terry oyama macintosh 128k industrial design bringing back elements original retaining little snow white design language used macintosh se design remnant se stripe across front panel bezel floppy drive distinctive front bezel lines se used classic vertical lines around base replaced four horizontal vent lines reminiscent original design also curve front bezel increased radial curve front macintosh lc macintosh iisi screen brightness dial bezel also removed favor software control broad curved front bezel became signature apple product design much 1990s logic board central circuit board computer based macintosh se design size however reduced using surface mount technology 9×5 inches 23×13 cm half size se board redesign absence expansion slots kept manufacturing costs low lack expansion abilities along small screen size macintosh popularity desktop publishing led oddities video displays connected scsi port users seeking connect larger full- dual-page display mac classic design used 1991 classic ii succeeded classic replaced macintosh se/30 reviewers macintosh classic focused processor performance lack expansion slots liza schafer home office computing praised classic ease use price criticized display full us letter page × 11 inches would fit full size warned required high-end graphics desktop publishing capabilities buying classic schafer concluded classic value impressive performance performance get working novel database spreadsheet pc week criticized lack faster processor stating 7.8 mhz speed adequate text applications limited graphics work suitable power users classic appropriate home computer limited computing road similarly pc user review concluded slow processor lack expansion slots macintosh classic offset low prices macweek described fine inexpensive replacement macintosh plus best embodies original macintosh vision six half years later computer gaming world skeptical doubting consumers would purchase black-and-white computer hard drive slightly faster mac plus february 1991 edition electronic learning robert mccarthy wrote teachers educational administrators software developers enthusiastic new lower cost apple macintosh computers steve taffe manager instructional strategy mecc developer publisher educational software explained excitement classic terrific – mac low price everyone afford macintosh scholastic educational software developer also confident apple ability compete ms-dos machines stating cost-effective powerful ms-dos computers apples superior comfort-level sue talley apple manager strategic planning education said classic see going applications need fair number powerful stations color big issue talley mentioned suited writing labs basic productivity uses many schools decided buy macintosh classic lack color monitor option higher-priced macintosh lc popular apple iie card also increased lc appeal schools although classic popular first may 1992 lc 560,000 sold outselling classic 1.2 million | [
7890,
5732,
722,
1094,
2926,
5037,
5752,
6113,
405,
2954,
7572,
6482,
5079,
6142,
4373,
7226,
2978,
7601,
4749,
3346,
6165,
4389,
5463,
102,
5469,
4768,
3008,
5477,
6200,
6202,
3387,
3390,
1216,
2331,
4820,
4453,
1599,
1234,
1237,
7311,
... | Train |
7,467 | 3 | Tandy_2000:tandy 2000 tandy 2000 personal computer introduced radio shack september 1983 based 8 mhz intel 80186 microprocessor running ms-dos comparison ibm pc xt introduced march 1983 used older 4.77 mhz 8088 processor ibm pc introduced 1984 would later use newer 6 mhz intel 80286 due 16-bit-wide data bus efficient instruction decoding 80186 tandy 2000 ran significantly faster pc compatibles slightly faster pc later ibm upgraded 80286 new pc models 8 mhz though wait states tandy 2000 company first computer built around intel x86 series microprocessor previous models used z80 68000 cpus touted compatible ibm xt tandy 2000 different enough existing pc software purely text-oriented failed work properly tandy 2000 special version ms-dos supported 768 kb ram significantly 640 kb limit imposed ibm architecture used 80-track double-sided quad-density floppy drives 720 kb capacity ibm standard time introduction tandy 2000 360 kb tandy 2000 tandy trs-80 logos case marking start phaseout trs-80 brand introduction ibm model 5150 personal computer august 1981 created entirely new market microcomputers many hardware software companies founded specifically exploit ibm microsoft new presence standard-setter small computers established manufacturers shifted focus well date tandy/radio shack small-computer market four years since august 1977 introduction trs-80 model new computer division followed october 1979 trs-80 model ii—a high-end business-oriented system 1983 trs-80 model 4 succeeded model iii replaced model consumer educational markets business segment trs-80 model 12 model 16 succeeded model ii adding higher-end features thus far tandy/radio shack computer lines occupied niches market proprietary system software applications tandy attempted monopolize software peripheral sales offering third-party products company stores ibm pc introduced nearest thing industry standard small computers cp/m-80 single manufacturer dominated 1983 ibm pc tandy discouraging third-party products halved company market share stopped profit growth tandy motive moving new ms-dos domain twofold capitalize new market leverage sales opportunities afforded solid position small computers marketing management believed many tandy customers would prefer stay tandy products inevitably seemed made jump onto burgeoning ibm/microsoft bandwagon figured company well-positioned regard large base customers consumer business markets z80-based trs-80 models i/iii/4 68000-based models 12 16 respectively tandy large presence computer retailer several thousand radio shack stores throughout us deemed advantage well pc manufacturers especially ibm relied mainly sales corporate accounts consumer retail tandy/radio shack thus company would become market leader offering hottest new trend—affordable 16-bit computers running ms-dos—directly computing public therefore tandy would produce ibm-style computer running industry-standard ms-dos company decided distinguish similar products producing better computer new machine would aimed mid-price market high-end consumers low-end businesses deemed prudent order seriously cannibalize current product lines serving market segments big-name computer manufacturers made leap pc/ms-dos market half 100 popular pc programs incompatible 2000 including killer app lotus 1-2-3 tandy realize similar non-compatible computers dec ti eagle successful strategy offering high-performance pc genesis tandy 2000 technical specifications rival computers improved pc hardware matched tandy 2000 one two dimensions none offered across-the-board enhancement except noted ran ms-dos incompatible ibm pc hardware level copycat computers competed primarily lower pricing like tandy exploiting installed customer bases tandy described 2000 'next generation true 16-bit cpu speed disk storage expansion ibm pc ms-dos computers admitting 1984 many ms-dos programs support computer company stated popular sophisticated software market available either immediately next six months two models tandy 2000 introduced dual-drive floppy-only model 2,750 2000hd single floppy drive half-height 10 mb hard drive 4,250 dual-floppy model 128 kb ram hard-drive-equipped 2000hd 256 kb comparison time low-end trs-80 model 4 two floppy drives cost 1,999 high-end model 16 two floppy drives cost 4,699 tandy executive ed juge said within six months tandy realized erred 2000 early 1985 infoworld reported tandy introduced tandy 1000 found market prefers true pc compatibility 2000 incomplete compatibility tandy 2000 received lukewarm welcome market computer press inability run popular ms-dos applications anticipated tandy time accepted practice new software created new computer came market also many pc-style computers manufacturers hardware-compatible ibm pc though company supported machine hardware add-ons software tailored specially including bestsellers like lotus 1-2-3 autocad computer failed gain popular acceptance never developed would late 1986 introduction tandy 3000 tandy offered pc-style computer performance comparable tandy 2000 tandy 2000 marketed early 1988 continual price cuts eventually closed 999 remaining unsold computers converted radio shack store operations terminals coincidentally one backup plans original trs-80 model four card slots back could accept expansion boards without need open case using rail system available expansion boards/cards included tandy 2000 nominally bios-compatible ibm xt allowed well-behaved dos software run platforms however dos software time bypassed operating system bios directly accessed hardware especially video external ports achieve higher performance rendering software incompatible tandy 2000 base-model tandy 2000 supported text-mode display monochrome tandy vm-1 monitor used 8-pin video port computer rear panel text-mode address space different location third-party memory-resident software hacks remedied copying pc-compatible text-mode memory tandy 2000 text space rate 5–10 times per second sometimes caused choppiness display produced fast text display rate—often fast read—but 'hold key keyboard could used pause text output bit pattern text character raster image maintained ram could modified user clever programming display ability present fine lines provided 640x400 screen resolution could accessed text mode even without optional graphics board display upgradable support pixel-addressable graphics via tandy 2000 graphics adapter circuit board fit expansion slot connector monochrome vm-1 monitor video connector rear-panel cabinet disabled expansion board installed graphics resolution 640x400 supported high intensity pixels color capability provided color graphics option set chips inserted empty sockets monochrome graphics adapter provided purpose resolution color board 640x400 non-interlaced eight colors palette sixteen available colors displayable tandy cm-1 monitor 799 particularly high-resolution colorful display day cm-1 accepted input color graphics board digital rgbi signals indicating separate red green blue signals intensity bit cga compatibility hit-or-miss three non-tandy monitors worked tandy 2000 graphics card long production original 1986–88 mitsubishi diamond scan nippon electronics corporation nec multisync multisync gs grayscale required horizontal scan frequency tandy 2000 26.4 khz modern flat-screen multisync computer monitors sync frequencies 30 khz cm-1 monitor also digital rgb modern crt monitors analog-only tandy 2000 used quad-density 5.25 floppy disks formatted 720k format 80-track disks double-density bitrate used pc-compatibles although cp/m machines commodore 8050/8250 drives normal pcs time 40-track double-density floppy drives could read quad-density due drive heads wide read narrower tracks 1.2mb 5.25 drives introduced ibm could read quad-density disks 80-track thinner heads various utility programs dos existed allowed nonstandard formats tandy 2000 disks read much like 1.2mb drives tandy 2000 problems reliably writing 360k pc disks due smaller heads completely erasing tracks causing 40-track drives become confused residual magnetic signals outer edge track tandy distributed computer utility called pc-maker would read format 40-track disks 2000s 80-track drives readable drives ordinary pcs floppy controller tandy 2000 accept 3.5 low-density 720 kb floppy drives may 2019 abandonware site winworldpc.com available download disk image latest version ms-dos tandy 2000 includes instructions using ibm 1.2mb 5.25-inch disk drive 80-track create system disk bootable tandy 2000 5.25-inch drive procedure also used create bootable 3.5-inch system disk using ordinary 720kb 3.5-inch pc drive boot tandy 2000 5.25-inch boot drive replaced low-density 720 kb 3.5 inch pc drive keyboard entirely new design made expressly tandy 2000 would later keyboard shipped tandy 1000 successors arrangement function keys changed ibm pc/xt ten left hand side keyboard two columns five tandy among first pc manufacturers change modern arrangement twelve function keys arranged horizontally across top ibm gave nod new standard making arrangement pc-at keyboard serial port hardware completely different pc/xt pc-compatible terminal emulation software either maintain strict bios usage serial hardware else use fossil driver software wrapper virtualized serial hardware see also dec rainbow allowing terminal software work wider variety hardware several terminal programs available tandy 2000 making possible log bbs e-mail remote systems tandy 2000 required specific version ms-dos would run machine standard ms-dos pc dos generic ibm-compatibles would run tandy 2000 standard practice microsoft expectation time customized version ms-dos would prepared different machine i/o drivers designed hardware model highest version dos tandy corporation released tandy 2000 2.11.03 minor third-party patches fact modified version windows 1.0 able run tandy 2000 ms-dos tandy 2000 resided entirely ram unlike ibm pcs contained bios portion os rom complete ms-dos system bios bdos occupied 53 kb ram means ram required run applications tandy 2000 little greater however tandy 2000 fared better comparison later ibm pc-at required run ms-dos version 3.x order operate 1.2 mb floppy drives hard drive version 3 ms-dos rather larger version 2.x running tandy 2000 also proved advantageous tandy 2000 os resided entirely ram therefore could updated hacked rather less effort microsoft basic interpreter supplied computer highly customized tandy 2000 hardware particularly high-resolution color graphics although ibm produced enhanced graphics adapter little year later october 1984 microsoft basic interpreter would support greater color resolution capabilities 1988 tandy/radio shack produced print advertising featuring bill gates microsoft extolling superior performance tandy 2000 advantageous microsoft development windows 1.0 software packages released tandy 2000 included wordperfect 4.2 wp5.1 could work software patches lotus 1-2-3 ashton-tate framework dbase multimate autocad lumena time arts shareware office programs complete line microsoft language products microsoft released version xenix tandy 2000 used western digital vianet network card distributed tandy better basic tandy 2000 pc used write bbs software tandy 2000 later ported ibm pc radio shack deskmate also used tandy 2000 tandy 1000 micropro wordstar versions 3.3 4.0 would run tandy 2000 provided user ran winstall installation utility prompted type video display used selected rom bios would result functional installation none t2000 special features would operative except increased speed version lotus 1-2-3 offered tandy 2000 release 1a customized take advantage unique hardware computer including full 768k ram high resolution color graphics two extra function keys release 1a executable code 60 kb smaller later release 2 provided greater macro programming facilities extra space data additional 128 kb ram available fully expanded tandy 2000 made possible construct larger worksheets later pcs running release 2 advent machines expanded memory nearly two years following introduction tandy 2000 top performer processing large models lotus 1-2-3 tandy 2000 720 kb floppy drives distinct advantage running lotus large enough store even largest worksheets single diskette stark contrast ibm pc xt 360 kb floppy disks order store largest worksheets pc user would split save two disks—and 'd recombine memory later although xt hard drive could store large lotus worksheets single file user could rely single storage device permanent storage important data files 'd forced segment worksheets storage separate disks tandy 2000 large-capacity floppy disks made backup maintenance relatively effortless tandy dropped support tandy 2000 group users formed tandy 2000 orphans software reviews software hardware hacks shareware/freeware repository discovered amateur programmers many commercial ms-dos applications needed minor modifications function tandy 2000 unique hardware also bbs based texas extensive library compatible software available download neither bbs web-based descendant active today | [
7698,
4751,
3255,
3764,
4018,
914,
5571,
830,
396,
1947,
6380,
2516,
5079,
1508,
1237,
4277,
6409
] | Test |
7,468 | 1 | InfinityDB:infinitydb infinitydb all-java embedded database engine client/server dbms extended java.util.concurrent.concurrentnavigablemap interface subinterface java.util.map deployed handheld devices servers workstations distributed settings design based proprietary lockless concurrent b-tree architecture enables client programmers reach high levels performance without risk failures new client/server version 5.0 alpha testing wrapping established embedded version provide shared access via secure remote server embedded system data stored retrieved single embedded database file using infnitydb api allows direct access variable length item spaces database client programmers construct traditional relations well specialized models directly satisfy needs dependent application limit number items database size jvm size infinitydb function smallest environment provides random access storage scaled large settings traditional relations specialized models directed database file infinitydb optimized standard relations well types data allowing client applications perform minimum one million operations per second virtual 8-core system airconcurrentmap in-memory map implements java concurrentmap interface internally uses multi-core design performance memory make fastest java map ordering performed holds medium large numbers entries airconcurrentmap iteration faster java map iterators regardless specific map type infinitydb accessed extended standard java.util.concurrent.concurrentnavigablemap via low-level 'itemspace api concurrentnavigablemap interface subinterface java.util.map special ordering concurrency methods api java.util.concurrent.concurrentskiplistmap maps may nested form complex structures maps standard semantics work internally 'tuple space maps actually stored helpers representing nothing immutable tuple prefix maps may created dynamically high speed needed access thread-safe multi-core concurrent key value types available include java primitive data types dates strings small char byte arrays 'bytestrings 'huge array indexes character long objects binary long objects plus special-purpose types 'entityclass 'attribute maps may multi-valued applications may choose use map-based access alone may mix lower-level 'itemspace access tuples map access wrapper tuple-level distinction 12 primitive data types called 'components atomic components concatenated short composites called 'items unit storage retrieval higher-level structures combine items client-devised include example unlimited size records unlimited number columns attributes complex attribute values unlimited size keys may composition components attribute values ordered sets composite components character large objects clob binary large objects blob unlimited sparse arrays higher-level structures built multiple items include key/value associations like ordered maps ordered sets entity-attribute-value nets quadruples trees dag taxonomies full-text indexes mixtures occur along custom client-defined structures itemspace may represented extended json document json printers parsers provided json documents native mapped sets items desired scale determined item prefix represents path sub-document hence entire database subtree single value represented extended json items always kept sorted json keys object always order 'itemspace represents entire database simple ordered set items state item actually stored component encoded variable-length binary form char array components self-describing standard format sorts correctly programmers deal components primitives stored data strongly typed data stored text parsed weak typing json xml parsed programmer-defined binary stream representations custom client-devised binary formats grow brittle security documentation upgrade testing versioning scaling debugging problems case java object serialization access system via basic methods store retrieve order one variable-length 'item 'tuple time speed order 1m operations/second aggregated multiple threads memory operations either standard map api codice_1 codice_2 iterators lower level codice_3 codice_4 codice_5 codice_6 codice_7 codice_8 codice_9 typical items 30 bytes uncompressed memory lob example use 1 kb items operation affects one item small data structures fast access contrast chunked access example formatting parsing entire json xml texts entire java object serialization graphs space performance scaling itemspace smooth size client-imposed multi-item structure created grows shrinks disappears on-storage performance like block-oriented b-tree blocks 4 kb log n per access block cache 2.5 mb default unlimited size often 100 mb cache grows needed performance efficiency items stored inside single b-tree prefix-compressed variable length uninterpreted sequence bytes compression b-tree may typically grow 100 gb range limits one file log files write flush infinitydb minimizes size database file four types compression prefix suffix zlib utf-8 schema upgrade structures extended modified done adding removing items new ways runtime upgrade scripts hence data model nosql schemaless besides normal java primitive types 'entityclass 'attribute types identified name number optional 'metadata mixed components item used represent tables example table given particular entityclass near front item column given different attribute items table start particular entityclass therehe one normal primitives representing 'entity like key particular attribute corresponding column finally normal primitives representing value attribute simple pattern extended time allow nested tables inside attribute nested attributes inside attributes multi-valued attributes much fixed schema elsewhere new data arrives system describes item-level granularity entityclass attribute numbers names represented extended json data displayed web-based client/server database browser viewed manipulated transferred list sorted formatted items json documents nestable tables whose visible structure determined entityclass attributes mixed items dynamic loose flexibility json formality tables combined global 'acd per-thread 'acid transactions provided infinitydb instance stores data single database file require additional log rollback files event catastrophe except power failure hardware malfunction database guaranteed consistent status completion last global commit recovery abrupt termination immediate requires slow log replay bulk loading globally transactional unlimited data size concurrent uses global transactions provide inter-thread isolation semantics 'acd rather 'acid alternatively acid transactions employ optimistic locking allow inter-thread isolation data structures grow shrink freed space reclaimed immediately made available structures systems run indefinitely without gradual space leaks long interruptions garbage reclamation phases data structure becomes empty space recycled rather leaving behind 'tombstones place holders example possibly large multi-value attribute may shrink one value becoming efficient single-valued attribute last value deleted space reclaimed including space attribute attached row attributes values row reclaimed completely well table loses rows space table reclaimed size type data structure property reference counters hence type graph incrementally collected automatically infinitydb client/server alpha-testing state features infinitydb encrypted version 5 beta-testing state features infinitydb embedded version 4 features airconcurrentmap java concurrentnavigablemap implementation features infinitydb airconcurrentmap roger l. deran designed developed infinity database engine 20 years ago holds us patent 5283894 infinity database engine first deployed intel 8088 assembly language roscor sports video editor rsve licensed nfl teams 1980s lexicon purchased rsve 1989 greatly expanded deployment types professional college sports java version 2.0 added transactionality version 3.0 added concurrency features patent pending apply infinitydb well airconcurrentmap infinity db remains active use thousands sites various kinds airconcurrentmap new uses all-java infinitydb marketed boiler bay inc. since 2002 include | [
5778,
3371,
4739,
1105
] | Test |
7,469 | 3 | Track_&_Field_(video_game):track amp field video game track field known japan europe olympic-themed sports arcade game developed konami released 1983 japanese release sported official license 1984 summer olympics players compete series events involving alternately pressing two buttons quickly possible make onscreen character run faster followed sequel hyper sports original arcade game player uses two run buttons trackball later units replaced buttons damaged overuse one action button control athlete competing following six events event qualifying time level player must achieve advance next event failing qualify one heat running events three tries events reduce player number lives one none present his/her disposal game end players earn extra lives per 100,000 points scored game accommodate four players compete pairs running events individually others fewer four players remaining slots played computer player cpu multiplayer heats though relative performance players effect game advancing based solely qualifying times multiplayer arcade games set controls relative players going left right game two sets controls somewhat different setup left set controls players 2 4 right set players 1 3 one classic arcade games single player mode played right set controls rather left player completes six events brief medal ceremony sent back field another round higher qualifying levels however game configured conclude final event game responded repeatedly pressing run buttons high frequency players arcade version resorted various tricks rapidly swiping coin ping-pong ball buttons using metal ruler repeated struck would vibrate press buttons result arcade operators reported high rates damage buttons later versions modifications prevent actions game sold 38,000 arcade hardware units japan end 1983 also hit north america 1996 next generation listed track field series collectively number 78 top 100 games time remarking ok games play style little skill even knowledge actual sports test pure button pushing endurance nothing beat track field especially play four players allgame gave game three stars five calling physically exhausting game invented new genre addition challenging events pure originality track field offers nice cartoonish graphics rich colors smooth animation terrific rendition theme chariots fire konami continued releasing games series follow-up hyper sports seven events 100-meter freestyle skeet shooting vault archery triple jump weight lifting pole vault track field initially ported atari inc. atari 2600 console atari 8-bit computers atarisoft label also apple ii commodore 64 port atari 5200 identical atari 8-bit computer version developed 1984 cancelled zx spectrum amstrad cpc versions released part game set match ii compilation 1988 poorly regarded fans konami ported track field famicom hyper olympic included four six events afterwards converted hyper sports famicom well time including three hyper sports events one event track field time nes gained popularity united states konami retooled game release america including eight events games one cartridge original six events track field hammer throw missing place however skeet shooting archery triple jump nes version track field re-released europe 1992 track field barcelona kemco light 1992 summer olympics opening song nes version chariots fire theme vangelis also used arcade version high score screen game boy version also re-released part konami gb collection series xbox live arcade version game released xbox 360 august 8 2007 features updated graphics sounds leaderboards online play xbox live service game also appears nintendo ds altered version chariots fire theme december 18 2008 héctor rodriguez california usa scored world record 95,350 points rodriguez beat 23-year-old record 95,040 points set june 30 1985 kelly kobashigawa los angeles twin galaxies 1985 video game masters tournament victoria british columbia canada twin galaxies official video game pinball book world records arcade volume lists history largest video game contest 1984 march dimes international konami/centuri track field challenge editors say 1 million contestants played track field april 30 may 26 hoping among three finalists going japan represent usa fundraiser march dimes event held aladdin castle arcades national convenience stores gary west oklahoma city u.s. finals phil britt riverside california world championship tokyo june 10 1984 | [
6943,
7388,
4503,
351,
6195
] | Test |
7,470 | 4 | SMTP_proxy:smtp proxy smtp proxies specialized mail transfer agents mtas similar types proxy servers pass smtp sessions mtas without using store-and-forward approach typical mta smtp proxy receives connection initiates another smtp session destination mta errors status information destination mta passed back sending mta proxy smtp proxies commonly used process filter inbound outbound email traffic smtp proxies often serve initial network-facing layer email system processing smtp connections clients forwarding data second layer mail servers smtp proxies often implement first and/or layer defence inbound anti-spam filtering system analyze messages using spam content filter antivirus program block rate limit connections using dns blacklists reputation system load balance smtp connections prevent overloading mail servers smtp proxies store messages like mail transfer agent mta reject smtp connections message content real-time away need out-of-band non delivery reports ndrs cause backscatter email serious problem internet email system certain smtp proxies implement tcp connection management otherwise known flow control help reduce damage downstream mail servers resulting spikes tcp traffic malicious smtp clients tcp connection management context smtp typically involves bandwidth throttling and/or introducing delays smtp command responses also known tarpitting slowed certain malicious sources smtp traffic spam bots tend give rather continuing deliver full email message network tarpitting challenging implement within email server since smtp connection processed slowly normal often holding precious system resources memory cpu smtp proxies implemented using lighter-weight programming techniques asynchronous io example nginx node.js netty libevent thousands connections juggled using resources much smaller number connections context full-blown store forward email server smtp proxies sometimes inserted sending mail servers local network receiving counterparts internet smtp proxies often used context order filter outgoing spam however applications domain keys identified mail dkim signing also exist smtp proxies come fundamental flavors | [
5733,
2291,
4364,
4734,
5722,
7637,
3017,
7088,
2117,
5416,
3338,
3462,
6908
] | Test |
7,471 | 5 | ARPA_Host_Name_Server_Protocol:arpa host name server protocol arpa host name server protocol nameserver obsolete network protocol used translating host name internet address iana transmission control protocol tcp user datagram protocol udp port 42 nameserver port commonly used windows internet name service wins microsoft operating systems nameserver protocol used darpa trivial name server server process called tnamed provided implementations unix support nameserver protocol deprecated may available latest implementations unix operating systems domain name system dns replaced arpa host name server protocol darpa trivial name server | [
2043,
4478,
7637,
2119,
5450,
2467
] | Test |
7,472 | 1 | Database_engine_tuning_advisor:database engine tuning advisor database engine tuning advisor deta computer software tool microsoft sql server enables database tuning improve performance query tuning indexes creating modifying deleting partition indexes configured enabled online offline tuning | [
7330,
7715
] | Test |
7,473 | 7 | OpenEMIS:openemis openemis open education management information system emis education management information system education sector main purpose collect analyze report data related management educational activities initially conceived unesco openemis serves response member states ’ need area tools educational strategic planning ‘ open ’ refers software open-source gnu gpl available royalty-free member states unesco openemis initiative launched unesco initiative line unesco effort promote emis address issues access equity quality relevance education subsequent gaps member states providing adequate decision support system since early 2000s keeping education goals adopted dakar 2000 openemis conceived royalty-free software customized meet specific needs implementing countries without conditions restrictions use purpose encouraging country-level capacity development helping countries upgrade local skills managing tool initiative coordinated unesco partnership nonprofit organization npo community systems foundation csf implementation technical support since 2012 openemis suite interrelated software solutions supports data collection survey classroom staffroom management core school integrator analysis visualizer monitoring dashboard analyzer datamanager profiles application designed provide unique standalone features support different information management requirements different levels features could customized integrated existing systems open-source solutions openemis benefits coding contributions larger community openemis initiative utilizes end-user license agreements contributor license agreements ensure maintenance standards quality assurance product remains free commercialization openemis implemented following countries nearly cases ministry education central implementation support engagement wide range stakeholders support available implementing countries aspects country implementation technical support team support activities include services policy planning analysis implementation custom software development training others needed system set may involve cost additional technical support setup configuration migration capacity building | [
6029,
5569,
5571
] | Test |
7,474 | 9 | Intermediate_representation:intermediate representation intermediate representation ir data structure code used internally compiler virtual machine represent source code ir designed conducive processing optimization translation good ir must accurate – capable representing source code without loss information – independent particular source target language ir may take one several forms in-memory data structure special tuple- stack-based code readable program latter case also called intermediate language canonical example found modern compilers linear human-readable text representing program transformed intermediate graph structure allows flow analysis re-arrangement creating sequence actual cpu instructions use intermediate representation allows compiler systems like gnu compiler collection llvm used many different source languages generate code many different target architectures intermediate language language abstract machine designed aid analysis computer programs term comes use compilers source code program translated form suitable code-improving transformations used generate object machine code target machine design intermediate language typically differs practical machine language three fundamental ways popular format intermediate languages three-address code term also used refer languages used intermediates high-level programming languages output object machine code output intermediate language intermediate language submitted compiler language outputs finished object machine code usually done ease process optimization increase portability using intermediate language compilers many processors operating systems c. languages used fall complexity high-level languages low-level languages assembly languages though explicitly designed intermediate language c nature abstraction assembly ubiquity de facto system language unix-like operating systems made popular intermediate language eiffel sather esterel dialects lisp lush gambit haskell glasgow haskell compiler squeak smalltalk-subset slang cython seed7 systemtap vala others make use c intermediate language variants c designed provide c features portable assembly language including c -- c intermediate language language targeting virtual machine p-code machine considered intermediate language gnu compiler collection gcc uses several intermediate languages internally simplify portability cross-compilation among languages llvm compiler framework based llvm ir intermediate language compact binary serialized representation also referred bitcode productized apple iloc intermediate language used classes compiler design simple target language static analysis tools often use intermediate representation instance radare2 toolbox binary files analysis reverse-engineering uses intermediate languages esil et reil analyze binary files | [
5012,
2451,
3509,
1718,
2184,
3772,
7970,
1823,
6981,
6982,
5117,
1361,
6002,
3623,
2740,
5218,
6181,
572,
3289,
4874,
1478,
2403,
1854,
5234,
6368,
4063,
6029,
931,
5678,
4074,
4525,
5061,
3566,
5326,
2420,
5771,
5190,
2144,
6567,
336,
... | Test |
7,475 | 2 | KIDO'Z:kido z kidoz content discovery network designed children platform based upon sophisticated coppa compliant machine learning technology platform analyses big data knows recommend relevant content every kid based usage behaviour kidoz offer several solutions stand-alone state-of-the-art child mode app allows children explore world wide web full array mobile tablet devices safely parents may download app free google play store begin empower children explore interests independently safely https //play.google.com/store/apps/details id=com.kidoz password-protected parental control account parents set account parameters features account security enhancement content customisation tools tools addition new content kidoz businesses provides kid developers publishers sdk/js integrate within property begin monetizing safely easily kid-friendly recommendation widget creates engagement users offering free videos games apps discover enjoy advertisers may promote children content network get exposed millions targeted kids enjoy high conversion rates positive brand engagement system designed platform user-generated content content moderated approved moderation team allowed system blocks links scripts attempts lead sites content approved system internally developed around termed smart content engine filters individualizes content users based certain variables age gender languages kidoz came beta testing phase may 2009 v1.0 available 30 languages english german chinese traditional chinese simplified french greek italian japanese korean portuguese russian spanish czech dutch swedish turkish polish kidoz available free download maker website current categories websites videos games children disclosed future freemium versions include additional features premium model offering certain specialized features small monthly fee kidoz kid web environment operating system developed kido z ltd israeli start-up based tel aviv ceo gai havkin kidoz currently follows freemium model application available free download website future versions include additional features e-mail instant messaging closed network revealed next months kido ’ z launch premium package offer additional tools services content | [] | Validation |
7,476 | 4 | Microsoft_Network_Monitor:microsoft network monitor microsoft network monitor deprecated packet analyzer enables capturing viewing analyzing network data deciphering network protocols used troubleshoot network problems applications network microsoft network monitor 1.0 codenamed bloodhound originally designed developed raymond patch transport protocol network adapter device driver engineer microsoft lan manager development team network monitor replaced microsoft message analyzer lan manager development team one shared hardware-based analyzer time netmon conceived hardware analyzer taken test reproduce networking bug first windows prototype coded christmas holiday first 4 bytes netmon capture file format used validate file values 'rtss ray tom steve steve first four members team code originally written os/2 user interface symbol placed device driver packet buffers kept received data could dumped hex within kernel debugger netmon caused bit stir microsoft since networks e-mail encrypted time software engineers access hardware analyzers due cost netmon many engineers around company access network traffic free request microsoft two simple identification features added non-cryptographic password identification protocol named bloodhound-oriented network entity bone created named raymond patch play codename bloodhound network monitor 3 complete overhaul earlier network monitor 2.x version originally versions network monitor available microsoft products systems management server sms fully featured product public parsers available free download microsoft network monitor superseded microsoft message analyzer key features network monitor 3.4 include following | [
6574,
7534,
726,
588,
4759,
5571,
6929,
4895,
7848
] | Test |
7,477 | 4 | Shnakule:shnakule shnakule biggest malware network existence averages 2000 hosts many 4357 targets users visiting trusted sites routes malware using relays exploits payload servers continually shifted new domains | [] | Train |
7,478 | 4 | Trend_Micro_Internet_Security:trend micro internet security trend micro internet security known pc-cillin internet security australia virus buster japan antivirus online security program developed trend micro consumer market according nss lab comparative analysis software products market 2014 trend micro internet security fastest responding new internet threats addition anti-malware web threat protection premium version software includes compatibility pcs macs android ios mobile devices parental controls identity theft prevention privacy scanner major social networking sites 25 gb cloud storage features trend micro internet security 2015 include software also includes trend micro premium security includes additional features including av-comparatives awarded trend micro three-star advanced rating–the highest ranking given organization–in av-comparatives ’ whole product dynamic “ real-world ” protection test 2014 av-test october 2014 gave trend micro internet security 2015 score 17 possible 18 points trend micro maximum security scored highest success rate blocking malware downloads nss labs ’ 2014 consumer endpoint protection test focused socially engineered malware results based continuous series tests determine participants ’ effectiveness socially engineered malware nss labs independent network testing facility security consultancy organization nss labs also found trend micro quickest time adding protection unknown threats less 15 minutes january 2016 discovered consumer version trend micro av allowed website visited users execute arbitrary code read browser passwords windows pc purportedly protected patch later issued close issue june 2014 av-test published results mobile security endurance tests assessed 30 apps six-month period trend micro ’ mobile security tied highest overall score 13 13 points previous versions include january 2015 trend micro supported trend micro internet security versions 19/2011 higher pc-cillin 2000 earlier versions virus scanners without additional features pc-cillin 2002 2003 stand-alone virus scanners also included firewall component improved software ’ scanning virus detection engine newer versions trend micro internet security offer additional features spyware protection antispam integrated firewall along improved scanning virus detection engine enhanced heuristics pc-cillin 2003 last stand-alone antivirus product offered trend micro 2007 company released standalone anti-malware product offered protection malicious software including viruses spyware adware | [
1809,
385,
7536,
1838,
4689,
6107,
3637,
5401,
6456,
6823,
7193,
6149,
7597,
88,
5452,
91,
4759,
806,
1931,
2296,
4783,
496,
7275,
5144,
142,
3394,
6560,
7289,
860,
4091,
7683,
4456,
6235,
6951,
875,
6962,
1249,
4115,
3089,
4492,
7351,
... | Validation |
7,479 | 4 | Bulk_personal_datasets:bulk personal datasets bulk personal datasets uk government euphemism datasets containing personally identifiable information large number individuals part mass surveillance united kingdom citizens around world term first used publicly march 2015 intelligence security committee parliament subject significant controversy uk government departments programmes utilising bulk personal datasets one care.data programme department health national health service health bulk personal datasets created by-product providing direct care judicial body oversees intelligence services united kingdom investigatory powers tribunal ruled legislative framework united kingdom permit mass surveillance gchq collects analyses data bulk practice mass surveillance special report published intelligence security committee parliament also came view although found past shortcomings oversight said legal framework simplified improve transparency view supported independent reports interception communications commissioner however notable campaign groups broadsheet newspapers continue express strong views contrary others criticised viewpoints turn | [
3241,
2054
] | Validation |
7,480 | 7 | Velocify:velocify velocify inc. cloud computing company headquartered el segundo california provides cloud-based intelligent sales automation software designed fast-paced sales environments velocify co-founded 2004 jeff solomon charles chase tony christopoulos company specializing software service saas company raised 3.25m series funding october 2007 rustic canyon partners initial investor may 2011 velocify named nick hedges president chief executive officer 2011 2012 nick hedges named one “ 50 influential sales lead management ” sales lead management association february 2012 velocify completed 15 million series b fundraising round led volition capital participation existing investor rustic canyon partners november 2012 velocify became marketo solution partner company announced changed name velocify leads360 june 19 2013 reflect solutions become vision future october 2017 velocify acquired ellie mae inc. leading cloud-based platform mortgage finance industry velocify offers two products sales automation solution- leadmanager integrated cloud-based dialing solution dial-iq august 2014 company released velocify salesforce offers sales automation dialing solutions within cloud-based crm platform | [
2810,
1376,
330,
2354,
1456
] | Test |
7,481 | 9 | EuLisp:eulisp eulisp statically dynamically scoped lisp dialect developed loose formation industrial academic lisp users developers around europe standardizers intended create new lisp less encumbered past compared common lisp minimalist scheme another objective integrate object-oriented programming paradigm well third-generation programming language language definition process first began meeting 1985 paris took several years complete specification first implementation interpreted-only available 1990 main traits lisp-1 separate function variable namespaces common lisp object system clos style generic-function type object-oriented system named eulisp object system telos integrated ground built-in module system defined layers promote use lisp small embedded hardware educational machines supports continuations though powerfully scheme simple lightweight process mechanism threads early implementation eulisp free eventually eulisp feel successor feel youtoo interpreted compiled versions university bath united kingdom interpreter basic level eulisp level-0 written russell bradford xscheme implementation scheme david michael betz originally named euschemeeuscheme recent version renamed euxlisp avoid confusion also eu2c eulisp optimizing compiler created fraunhofer isst apply project germany dialect eulisp developed named plural eulisp eulisp parallel computing programming extensions example use classes algorithm solve towers hanoi problem | [
7878,
1445,
5019,
1820,
6796,
6087,
1825,
2915,
5734,
1478,
2218,
4704,
5757,
6116,
1116,
6471,
7573,
2600,
7936,
5077,
1885,
1889,
6507,
795,
6876,
6888,
1557,
4789,
5494,
5501,
6210,
144,
4074,
4085,
7298,
5515,
8025,
3749,
6949,
5883,
... | Test |
7,482 | 8 | SEMrush:semrush semrush software service saas company based boston sells online visibility marketing analytics software subscriptions founded oleg shchegolev dmitry melnikov seo tool browser extension adopting saas model software provides intelligence data including website traffic information keywords projected adwords spend site audit topic research lead generation seo-related data company customers include ebay quora booking.com hewlett packard enterprise bnp paribas oleg shchegolev dmitry melnikov started seo enthusiasts interested industry developments new technologies wanted build tool could identify market trends best industry practices sharing first findings friends local influencers people curious started using daily word mouth tool started increasing popularity community influencers grew result software first launched seodigger launched firefox extension subsequently renamed seoquake company 2007 eventually semrush 400 employees offices boston philadelphia czech republic cyprus russia 2016 reached milestone 1,000,000 users clients 100 countries april 2018 company received 40m usd funding round co-led venture capital firms greycroft e.ventures siguler guff expansion various search platforms including owned amazon microsoft baidu | [
1134,
6024,
330,
3850,
6219,
518
] | Validation |
7,483 | 2 | BeeSafe:beesafe beesafe personal safety mobile app launched 2015 slovak startup location-based next generation security service notifies family members friends case user app gets danger app received numerous awards app 700 downloads 250 active logins 60 countries worldwide beesafe founded march 20 2015 peter stražovec michal kačerík project winner žilina ’ startup weekend 2013 startupawards.sk 2015 finalist later app released android ios marketplace whole beesafe project spot booster incubator bratislava three months beesafe entered agreement city piešťany november 2015 increase security citizen connecting mobile app police platform first city started using beesafe platform application tries help people slovak cities cities see users danger beesafe next generation corporate personal emergency app tracking application neither panic button application user ’ press panic button process help call fully automated beesafe app includes silent alarm system system trigger alarm notify user ’ family friends security service police user dangerous situation available android apple smartphones smart devices b beesafe app received via bona award winner slovak startup nominations | [
5571
] | Test |
7,484 | 3 | Mini-ITX:mini-itx mini-itx motherboard developed via technologies 2001 commonly used small-configured computer systems originally niche product designed fan-less cooling low power consumption architecture made useful home theater pc systems fan noise detract cinema experience four mounting holes mini-itx board line four holes atx-specification motherboards locations backplate expansion slot though one holes used optional earlier versions atx spec mini-itx boards therefore often used cases designed atx micro-atx atx variants desired design provides one expansion slot earlier motherboards conventionally standard 33 mhz 5v 32-bit pci slot many older case designs use riser cards even two-slot riser cards although two-slot riser cards compatible boards boards based around non-x86 processors 3.3v pci slot mini-itx 2.0 2008 boards pci-express ×16 slot boards compatible standard pci riser cards supplied older itx cases march 2001 chipset manufacturer via technologies released reference design itx motherboard promote low power c3 processor bought centaur technology combination chipsets designed robert kuo via chief r expert 215×191 mm vt6009 itx reference board demonstrated information pc set-top box configurations later designed mini-itx specification point manufacturers took itx design shuttle jetway etc produced many itx based cube computers manufactures instead produced smaller boards based similar 229×191 mm flexatx configuration october 2001 via announced decision create new motherboard division provide standardized infrastructure lower-cost pc iterations focus embedded devices result november 2001 release vt6010 mini-itx reference design touted information pc low cost entry level x86 computing platform manufacturers still reluctant customer response much receptive via decided manufacture sell boards april 2002 first mini-itx motherboards—via epia 5000 fanless 533 mhz eden processor epia 800 800 mhz c3 —were sold industrial customers enthusiasts soon noticed advantages small size low noise power consumption started push boundaries case modding something else—building computers nearly every object imaginable sometimes even creating new cases altogether hollowed vintage computers humidors toys electronics musical instruments even 1960s-era toaster become homes relatively quiet even silent mini-itx systems capable many tasks modern desktop pc mini-itx boards primarily appeal industrial embedded pc markets majority sold bulk components integrated finished system single-purpose computing applications produced much longer sales life-cycle consumer boards original epias still available quality industrial users typically require manufacturers prototype using standard cases power supplies build enclosures volumes get high enough typical applications include playing music supermarkets powering self-service kiosks driving content digital displays via continues expand mini-itx motherboard line earlier generations included original pl133 chipset boards dubbed classic boards cle266 chipset boards adding mpeg-2 acceleration cn400 boards added mpeg-4 acceleration second generation boards featured epia mii cl pd tc ms — tailored slightly different markets legacy via boards use x86-compatible cpus — c3 c7 low-power eden variants newer boards featuring via nano cpu launched may 2008 manufacturers also produced boards designed around layout using via also intel amd transmeta powerpc technology intel introduced line mini-itx boards atom cpu demonstrates significant increase processing performance without added power consumption older via c3 c7 offerings helps make design viable personal computers manufacturers saw potential design followed suit even limiting atom evidenced zotac geforce 9300-itx board supports core 2 duo cpus fsb frequencies 1333 mhz two separate-channeled 800 mhz memory slots fully functional pci express 2.0 x16 slot could connect sli onboard video new wave offerings made mini-itx much popular among home users hobbyists even overclockers intel currently one mini-itx mainboard manufacturers list mechanical dimensions manuals number manufacturers released mini-itx motherboards feature embedded cpus often mobile low-tdp versions processors designed draw minimal power resulting lower tdp ideal fanless passively cooled configurations embedded applications starting lga 775 socketed intel mini-itx motherboards released intel zotac followed lga 1156 motherboards starting lga 1155 mini-itx motherboards started become mainstream many different manufacturers releasing products partly almost sandy bridge ivy bridge intel celeron pentium core series cpus integrated processor graphics eliminating need motherboard graphics discrete graphics cards trend continues lga 1150 lga 1151 cpus due limitations mini-itx design physical size lga 2011 socket mini-itx motherboards socket support single pci express expansion slot require using narrow-ilm version lga 2011 socket despite manufacturers released lga 2011 based mini-itx motherboards also mini-itx motherboards lga 2066 socket released four sodimm slots number manufacturers released several socketed amd mini-itx motherboards supporting socket am2 socket am2+ socket am3 socket fm1 socket fm2 socket fm2+ socket am1 socket am4 cpus socket am2+ am3 itx motherboards integrated motherboard graphics discrete graphics processor integrated graphics required platforms mini-itx motherboards integrated amd cpus also released motherboards often use mobile cpus passive cooling feature powerful integrated graphics compared intel counterparts makes suitable htpc ibase made first transmeta-based mini-itx motherboard mb860 board uses transmeta™ efficeon™ processors run 1.2 ghz supports sodimm ddr modules capacities 1 gb onboard 16 mb ati m7 graphics controller supports 3d games graphical intensive programs provides four usb 2.0 ports realtek 8100c 10/100mbit/s baset ethernet optional 8110s gigabit ethernet controller first powerpc motherboards produced eyetech 2005 stopped activity 2005 company acube systems made new board sam440ep primarily amigaos market cadia networks developed mini itx arm board comes arm cortex-a8 freescale i.mx53 series cpu according official website board offers ultra-low power soc variety i/o os support android linux2.6 windows embedded compact 7 kontron also developed mini itx arm board according website features arm cortex-a9 quad core 900mhz processor neon technology nvidia graphics processor 2 gb ram targeted power consumption 7w entire board appliedmicro offers xc-1 server development platform motherboard uses x-gene armv8 system chip 8 2.4 ghz cpu cores supports 128 gb ddr3 dram using 16 gb dimms baseboard management controller mini-itx standard define standard computer power supply though suggests possible options conventionally mini-itx boards use 20- 24-pin original atx power connector usually connected dc-dc converter board connects external power adapter generally vendors provide power adapter dc-dc board case boards built dc-dc converters converters also made plug directly atx connector e.g picopsu either options avoids need mount separate dc-dc converter case saving space design effort boards using full-power intel amd cpus typically use atx12v 2.x connections require case appropriate power supply cooling power-hungry chips defined atx specification power supplies atx12v connector separate 12 volts rail must idle 12 volts rail | [
4765,
7163,
3443,
6173,
7974,
6089,
6351,
2744,
7826,
6015,
4968,
7654,
1759,
6373,
4974,
5853,
5063,
3565,
6935,
4627,
6478,
2147,
7212,
3145,
4090,
5963,
866,
3063,
7041,
352,
2977,
6865
] | Validation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.