node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4 values |
|---|---|---|---|---|
1,185 | 3 | SPARC_Enterprise:sparc enterprise sparc enterprise series range unix server computers based sparc v9 architecture co-developed sun microsystems fujitsu introduced 2007 marketed sold sun microsystems later oracle corporation acquisition sun fujitsu fujitsu siemens computers common brand sparc enterprise superseding sun sun fire fujitsu primepower server product lines since 2010 servers based new sparc cmt processors sparc t3 later branded oracle sparc t-series servers midrange high-end sparc64 vi sparc64 vii sparc64 vii+ processor based servers designated m-series indicates ras features similar mainframe class machines sparc64 vi dual-core processor core featuring two-way vertical multi-threading vmt m9000 server configured maximum number processors supports running 256 concurrent threads vmt coarse-grained multi-threading implementation core sparc64 vi handle two strands threads vmt switches execution one strand basis events execute instructions another thread pipeline must saved/flushed switched registers thread events include l2 cache misses hardware timer exception interrupts multi-threading-related control instructions also called switch event soe threading 2008 fujitsu released sparc64 vii quad-core processor core featuring two-way simultaneous multi-threading existing m-class servers able upgrade sparc64 vii processors field 2010 fujitsu released sparc64 vii+ running higher frequency larger l2 cache predecessor sparc64 vii sparc64 vii+ processor module includes four physical cores core execute two threads physical core able run threads simultaneously smt context-switch time two threads share instruction pipeline smoothly ready run alternate cycles superscalar instruction issue share functional units according need important capability m-series ability mix processor generations clock speeds system domain m-series servers sparc64 vi sparc64 vii cpus installed run native speeds clocking slowest cpu april 17 2007 sun sparc enterprise m9000 achieved 1.032 tflops linpack benchmark making fastest single system supercomputer time may 2 2008 sun sparc enterprise m9000 server achieved world performance record tpc-h data warehousing benchmark 1 terabyte scale factor using oracle database february 19 2009 sparc enterprise m8000 holds 64-thread world performance records spec omp2001 benchmark medium large ultrasparc t1-based sun fire t1000 t2000 rebranded sparc enterprise october 2007 sun added ultrasparc t2-based servers sparc enterprise line april 2008 sun added ultrasparc t2 plus-based servers sparc enterprise line october 2008 sun released 4-way smp ultrasparc t2 plus-based server sparc enterprise models licensed run solaris 10 solaris 11 m-series supports dynamic domains dynamic reconfiguration enable single machine divided multiple electrically isolated partitions ultrasparc t1 ultrasparc t2/t2+ models partition system using logical domains m-series t-series models support solaris containers supports maximum 8191 non-global zones dynamic domain logical domain | [
7535,
6806,
5042,
3294,
1105,
418,
7213,
3673,
6505,
1160,
2992,
1923,
6184,
1937,
2299,
4418,
3026,
4427,
1223,
1590,
5882,
1254,
1258,
1263,
6270,
908,
6279,
6281,
2033,
7368,
4515,
2765,
5587,
3820,
2433,
8138,
8145,
971,
7781,
6329,
... | Test |
1,186 | 4 | Computational_trust:computational trust information security computational trust generation trusted authorities user trust cryptography centralised systems security typically based authenticated identity external parties rigid authentication mechanisms public key infrastructures pkis kerberos allowed model extended distributed systems within closely collaborating domains within single administrative domain recent years computer science moved centralised systems distributed computing evolution several implications security models policies mechanisms needed protect users β information resources increasingly interconnected computing infrastructure identity-based security mechanisms authorise operation without authenticating claiming entity means interaction occur unless parties known authentication frameworks spontaneous interactions would therefore require single trusted certificate authorities cas present context pki considered since issues thus unlikely establish reference standard near future user wishes collaborate another party choose enabling security thereby disabling spontaneous collaboration disabling security enabling spontaneous collaboration fundamental mobile users devices authenticate autonomous way without relying common authentication infrastructure order face problem need examine challenges introduced global computing term coined eu future global information society identify impact security computational trust applies human notion trust digital world seen malicious rather cooperative expected benefits according marsh et al. result use others ability delegation increased cooperation open less protected environment research area computational mechanisms trust reputation virtual societies directed towards increased reliability performance digital communities trust-based decision specific domain multi-stage process first step process consists identifying selecting proper input data trust evidence general domain-specific derived analysis conducted application involved next step trust computation performed evidence produce trust values means estimation trustworthiness entities particular domain selection evidence subsequent trust computation informed notion trust defined trust model finally trust decision taken considering computed values exogenous factors like disposition risk assessments concepts heightened relevance last decade computer science particularly area distributed artificial intelligence multi-agent system paradigm growth e-commerce increased interest trust reputation fact trust reputation systems recognized key factors electronic commerce systems used intelligent software agents incentive decision-making deciding whether honor contracts mechanism search trustworthy exchange partners particular reputation used electronic markets trust-enforcing mechanism method avoid cheaters frauds another area application concepts agent technology teamwork cooperation several definitions human notion trust proposed last years different domains sociology psychology political business science definitions may even change accordance application domain example romano recent definition tries encompass previous work domains trust reputation social value someone trustworthy person may expected perform beneficial least suspicious way assure others high probability good collaborations contrary someone appears trustworthy others refrain collaborating since lower level probability collaborations successful trust strongly connected confidence implies degrees uncertainty hopefulness optimism eventually marsh addressed issue formalizing trust computational concept phd thesis trust model based social psychological factors lot proposals appeared literature selection computational trust reputation models represent good sample current research presented trust reputation analysed different points view applied many situations next classification based considering peculiar characteristics models environment evolve trust reputation model characterized models based cognitive approach trust reputation made underlying beliefs function degree beliefs mental states lead trust another agent assign reputation essential part model well mental consequences decision act relying another agent neurological trust models based neurological theories interaction affective cognitive states modeled neurological level well using theories embodiment emotions models trust dynamics relate experiences external sources cognitive affective perspective specifically feeling emotion associated mental state converging recursive body loops modeled addition based hebbian learning strength connections emotional responses different adaptation processes introduced inspired somatic marker hypothesis trust reputation considered subjective probabilities individual expects individual b perform given action welfare depends approach trust reputation result mental state agent cognitive sense result pragmatic game utility functions numerical aggregation past interactions possible sort models considering information sources used compute trust reputation values traditional information sources direct experiences witness information recent models started consider connection information sociological aspect agent behavior model contains several information sources increase reliability results conversely increase complexity model direct experience relevant reliable information source trust/reputation model two types direct experiences recognizable witness information also called indirect information comes experience members community based direct experience data gathered others β experience witness information usually abundant use complex trust reputation modelling fact introduces uncertainty agents manipulate hide parts information benefit people belong community establish different types relations individual plays one several roles society influencing behavior interaction people multi-agent system plenty interactions social relations among agents simplified reflection complex relations human counterparts trust reputation models adopt sociological information using techniques like social network analysis methods study social relationships among individuals society emerged set methods analysis social structures methods specifically allow investigation relational aspects structures prejudice another though uncommon mechanism influences trust reputation according method individual given properties particular group make recognisable member signs uniform definite behavior etc people today use word prejudice refers negative hostile attitude towards another social group often racially defined however negative connotation revised applied agent communities set signs used computational trust reputations models usually ethical discussion differently signs used human societies like skin color gender literature cognitive social sciences claims humans exhibit non-rational biased behavior respect trust recently biased human trust models designed analyzed validated empirical data results show biased trust models able predict human trust significantly better unbiased trust models relevant sources information considered trust reputation models presented direct experiences witness information e-markets sociological information almost non-existent order increase efficiency actual trust reputation models considered however reason increase complexity models introducing trust evidence later used environment possible realise capabilities aggregation trust reputation evidence useful computational model increase complexity making general solution difficult several models dependent characteristics environment possible solution could use adaptive mechanisms modify combine different sources information given environment lot trust reputation definitions presented several works give meaning concepts relation concepts considered depth reputation concept helps build trust others nowadays game theory predominant paradigm considered design computational trust reputation models likelihood theory taken account significant number economists computer scientists strong background game theory artificial intelligence techniques working multi-agent e-commerce contexts game theoretical models produce good results may appropriate complexity agents terms social relations interaction increases becomes restrictive exploration new possibilities considered example merging cognitive approaches game theoretical ones apart trust evidence considered well time-sensitive trust metrics represent first step encourage improvement computational trust important issue modeling trust represented transferability trust judgements different agents social scientists agree consider unqualified trust values transferable pragmatic approach would conclude qualified trust judgments worth transferred far decisions taken considering others β opinion better ones taken isolation authors investigated problem trust transferability open distributed environments proposing translation mechanism able make information exchanged one agent another accurate useful currently commonly accepted evaluation framework benchmark would allow comparison models set representative common conditions game-theoretic approach direction proposed configuration trust model optimized assuming attackers optimal attack strategies allows next step compare expected utility different trust models similarly model-based analytical framework predicting effectiveness reputation mechanisms arbitrary attack models arbitrary system models proposed peer-to-peer systems | [
2513,
2669,
6430,
5149,
3767,
7567,
8091,
4261,
533,
3794
] | Validation |
1,187 | 2 | Image_Capture:image capture image capture application program apple enables users upload pictures digital cameras scanners either connected directly computer network provides organizational tools like iphoto useful collating pictures variety sources need drivers image capture scriptable applescript may manipulated mac os x v10.4 tiger automator application mac os x 10.4 image capture applescript dictionary open script editor mac os x 10.6 image capture web server opens script editor | [
3940,
713,
4690,
734,
405,
6832,
3989,
2597,
3322,
1502,
5786,
4740,
1897,
6505,
2627,
7609,
1171,
5109,
2284,
1178,
6188,
1562,
6909,
6548,
502,
6557,
2679,
6565,
2329,
3050,
163,
6582,
5535,
5191,
8051,
7335,
3445,
569,
5571,
7000,
62... | Test |
1,188 | 4 | Information_security_indicators:information security indicators information technology benchmarking computer security requires measurements comparing different systems single systems dedicated situations technical approach pre-defined catalog security events security incident vulnerability together corresponding formula calculation security indicators accepted comprehensive information security indicators standardized etsi industrial specification group isg isi indicators provide basis switch qualitative quantitative culture security scope measurements external internal threats attempt success user deviant behaviours nonconformities and/or vulnerabilities software configuration behavioural general security framework 2019 isg isi terminated related standards maintained via etsi tc cyber list information security indicators belongs isi framework consists following eight closely linked work items preliminary work information security indicators done french club r2gs first public set isi standards security indicators list event model released april 2013 | [
4440,
3932,
1805
] | Test |
1,189 | 6 | ExtremeZ-IP:extremez-ip extremez-ip apple filing protocol server grouplogic inc arlington virginia usa runs windows operating systems enabling mac clients access files via apple filing afp 3.3 protocol starting version 8.0 network reshare capability allows extremez-ip server proxy access file shares secondary file server nas device netapp isilon extremez-ip also provides access windows services printing searching file system archiving distributed file system volume shadow service extremez-ip supports macintosh clients running mac os 9.2 mac os 10.9 mavericks extremez-ip extremez-ip.exe requires windows supports windows server 2012 windows server 2008 r2 32-bit 64-bit windows storage server windows home server windows 2003 server windows xp windows xp embedded windows powered nas extremez-ip first third party file server support time machine apple software support searching via apple network spotlight software provides indexed content search search accomplished translating passing search query microsoft windows search service passing results back mac user via reverse process extremez-ip links macs microsoft distributed file system microsoft dfs optional shadowconnect microsoft volume shadow copy service vss snapshots extremez-ip version 9.0 added option index remote volumes enable spotlight searching mac users remote volumes n't local index search capabilities including network attached storage nas emc netapp isilon stornext san volumes | [
7701,
4759,
5571,
1534,
5859,
836
] | Test |
1,190 | 8 | ORBX.js:orbx.js orbx.js javascript library codec able stream video html5-compliant browser project partnership mozilla otoy | [
1152,
2451,
4755,
893,
5549,
7975,
6802,
562,
5571,
3548,
6368,
6458,
7015,
2049,
5506,
4352,
7028,
340,
5699,
3915,
7587,
5263,
5887,
445,
4287
] | Test |
1,191 | 2 | Automatic_Reference_Counting:automatic reference counting automatic reference counting arc memory management feature clang compiler providing automatic reference counting objective-c swift programming languages compile time inserts object code messages codice_1 codice_2 increase decrease reference count run time marking deallocation objects number references reaches zero arc differs tracing garbage collection background process deallocates objects asynchronously runtime unlike tracing garbage collection arc handle reference cycles automatically means long strong references object deallocated strong cross-references accordingly create deadlocks memory leaks developer break cycles using weak references apple inc. deploys arc operating systems macos ios limited support arclite available since snow leopard ios 4 complete support following lion ios 5 garbage collection declared deprecated mountain lion favor arc removed objective-c runtime library macos sierra following rules enforced compiler arc turned // without arc void dealloc // arc void dealloc // without arc nsstring givemeastring // arc nsstring givemeastring // without arc void loopthrougharray nsarray array // arc void loopthrougharray nsarray array arc introduces new property declaration attributes replace old attributes zeroing weak references feature objective-c arc automatically clears sets codice_19 weak-reference local variables instance variables declared properties immediately object pointed starts deallocating ensures pointer goes either valid object codice_19 avoids dangling pointer s. prior introduction feature weak references referred references retaining set codice_19 object pointed deallocated equivalent codice_22 arc thus possibly leading dangling pointer programmer typically ensure possible weak references object set nil manually deallocated zeroing weak references obviates need zeroing weak references indicated using property declarations|declared property attribute codice_23 using variable attribute codice_24 zeroing weak references available mac os x lion 10.7 later ios 5 later require additional support objective-c runtime however os x classes currently support weak references code uses arc needs support versions os older use zeroing weak references therefore must use codice_22 weak references exists third-party library called plweakcompatibility allows one use zeroing weak references even older os versions xcode 4.2 later provides way convert code arc xcode 4.5 found choosing edit refactor convert objective-c arc ... although xcode automatically convert code code may converted manually xcode inform developer complex use cases arise variable declared inside autorelease pool used outside two objects need toll-free bridged special casts swift references objects strong unless declared codice_23 codice_27 swift requires explicit handling nil optional type value type either value nil optional type must handled unwrapping conditional computer programming |conditional statement allowing safe usage value present conversely non-optional type always value nil var mystring string // string var myotherstring string // string nil let mystring myotherstring // unwrap optional accordingly strong reference object type optional object kept heap reference deallocated weak reference type optional object deallocated reference set nil unowned references fall in-between neither strong type optional instead compiler assumes object unowned reference points deallocated long reference remains allocated typically used situations target object holds reference object holds unowned reference var strongreference myclass // strong reference nil weak var weakreference myclass // weak reference nil unowned var unownedreference myclass // weak reference nil swift also differs objective-c usage encouragement value type|value types instead reference type|reference types types swift standard library value types copied value whereas classes closure computer programming |closures reference types passed reference value types copied passed around deallocated automatically reference created category objective-c category memory management | [
1616,
3509,
3351,
379,
7530,
1361,
2736,
1363,
3623,
7391,
5606,
2794,
7308,
5786,
5091
] | Validation |
1,192 | 2 | Dave_Taylor_(game_programmer):dave taylor game programmer dave d. taylor american game programmer best known former id software employee noted work promoting linux gaming 1993 graduated university texas austin bachelor science degree electrical engineering taylor worked id software 1993 1996 time involved development doom quake created ports games irix aix solaris linux helped program atari jaguar ports doom wolfenstein 3d also considers spackle coder doom adding things status bar sound library integration automap level transitions cheat codes network chat system quake wrote original sound engine dos tcp/ip network library added vesa 2.0 support one musical themes doom ii dave d. taylor blues named robert prince 2003 book mentions habit passing prolonged playing doom employees would incidents sketch body outline unconscious form masking tape success game bought couch pass attempts talk quake on-line purchase acura nsx doom money friendship american mcgee eventual departure company also mentioned taylor founded small game company called crack dot com 1996 1998 crack dot com released one game abuse pc platform shooter 1997 interview claimed n't particularly proud abuse set prove person could sell 50,000 copies so-so game led effort build golgotha first-person shooter real-time strategy hybrid company folded completion 1998 2001 worked transmeta president carbon6 2001 2002 also working lead designer producer game boy advance game spy kids challenger since 2002 vice president naked sky entertainment since 2003 also advisor freelance game designer also willing act pay projects 2009 produced abuse classic apple iphone beakiez pc | [
3938,
3084,
462,
7429,
1351,
1822,
638,
4401,
5292,
3780,
5829,
578,
7740,
7463,
7559,
5759,
589,
412,
4435,
3133,
2689,
3404,
7855,
966,
968,
2260,
8149
] | Test |
1,193 | 2 | Jordan_Hubbard:jordan hubbard jordan k. hubbard born april 8 1963 open source software developer authoring software ardent window manager various open source tools libraries co-founding freebsd project nate williams rodney w. grimes 1993 contributed initial freebsd ports collection package management system sysinstall july 2001 hubbard joined apple computer role manager bsd technology group 2005 title director unix technology october 2007 hubbard promoted director engineering unix technologies apple remained june 2013 july 15 2013 became cto ixsystems also led freenas open source project march 24 2017 announced plan depart ixsystems would joining twoporeguys biotechnology company vp engineering.. january 2019 linkedin profile notes part engineering leadership team uber march 31 1987 hubbard executed rwall command expecting send message every machine network university california berkeley headed distributed unix group command instead began broadcasting hubbard message every machine internet stopped hubbard realised message broadcast remotely received complaints people purdue university university texas even though command terminated resulted hubbard receiving 743 messages complaints including one inspector general arpanet | [
7514,
6794,
6085,
732,
738,
3636,
2583,
5760,
3986,
5065,
6477,
424,
6489,
6149,
6860,
443,
6505,
1523,
1547,
481,
2300,
4059,
8001,
6918,
6211,
4806,
4441,
5865,
6583,
8037,
875,
1254,
6609,
191,
908,
4498,
7355,
3457,
1279,
6278,
8096... | Validation |
1,194 | 1 | XLeratorDB:xleratordb xleratordb suite database function libraries enable microsoft sql server perform wide range additional non-native business intelligence ad hoc analytics libraries embedded run centrally database include 450 individual functions similar found microsoft excel spreadsheets individual functions grouped sold six separate libraries based usage finance statistics math engineering unit conversions strings westclintech company developed xleratordb claims first commercial function package add-in microsoft sql server westclintech llc founded software industry veterans charles flock joe stampf 2008 located irvington new york united states flock co-founder frustum group developer opics enterprise banking trading platform acquired london-based misys plc 1996 stampf joined frustum 1994 flock remained active company acquisition helping develop successive generations opics employed 150 leading financial institutions worldwide following full year research development testing westclintech introduced recorded first commercial sale xleratordb april 2009 september 2009 xleratordb became available federal agencies nasa strategic enterprise-wide procurement sewp-iv program government-wide acquisition contract xleratordb uses microsoft sql clr common language runtime technology sql clr allows managed code hosted run microsoft sql server environment sql clr relies creation deployment registration .net framework assemblies physically stored managed code dynamic-link libraries dll assemblies may contain .net namespaces classes functions properties managed code compiles native code prior execution functions using sql clr achieve significant performance increases versus equivalent functions written t-sql scenarios xleratordb requires microsoft sql server 2005 sql server 2005 express editions later compatibility mode 90 higher product installs permission_set=safe safe mode restrictive permission set accessible users code executed assembly safe permissions access external system resources files network internet environment variables registry computer science function portion code within larger program performs specific task relatively independent remaining code used database spreadsheet applications functions generally represent mathematical formulas widely used across variety fields code may user-generated also embedded pre-written sub-routine applications functions typically identified common nomenclature corresponds underlying operations e.g irr identifies function calculates internal rate return series periodic cash flows sub-routines functions integrated used variety ways wide variety larger complicated applications within large enterprise applications may example play important role defining business rules risk management parameters remaining virtually undetected end users within database management systems spreadsheets however kinds functions also represent discrete sets tools accessed directly utilized stand-alone basis complex user-defined configurations context functions used business intelligence ad hoc analysis data fields finance statistics engineering math etc xleratordb uses three kinds functions perform analytic operations scalar aggregate hybrid form westclintech calls range queries scalar functions take single value perform operation return single value example type function log returns logarithm number specified base aggregate functions operate series values return single summarizing value example type function avg returns average values specified group xleratordb functions characteristics aggregate functions operating multiple series values processed sql clr using single column inputs avg example irregular internal rate return xirr financial function operates collection cash flow values one column must also apply variable period lengths another column initial iterative assumption third order return single summarizing value westclintech documentation notes range queries specify data included result set function independently clause associated t-sql statement incorporating select statement function string argument function traps select statement executes internally processes result xleratordb functions employ range queries npv xnpv irr xirr mirr multinomial seriessum within application functions identified _q naming convention e.g npv_q irr_q etc microsoft sql server 3 selling database management system dbms behind oracle ibm versions sql server market since 1987 xleratordb compatible 2005 edition later like major dbms sql server performs variety data mining operations returning arraying data different views also known drill-down addition sql server uses transact-sql t-sql execute four major classes pre-defined functions native mode functions operating dbms offer several advantages client layer applications like excel utilize up-to-date data available process far larger quantities data data subject exporting transcription errors sql server 2008 includes total 58 functions perform relatively basic aggregation 12 math 23 string manipulation 23 operations useful analytics includes native functions perform complex operations directly related finance statistics engineering microsoft excel component microsoft office suite one widely used spreadsheet applications market today addition inherent utility stand-alone desktop application excel overlaps complements functionality dbms several ways storing arraying data rows columns performing certain basic tasks pivot table aggregating values facilitating sharing importing exporting database data excel chief limitation relative true database capacity excel 2003 limited 65k rows 256 columns excel 2007 extends capacity roughly 1million rows 16k columns comparison sql server able manage 500k terabytes memory excel offers however extensive library specialized pre-written functions useful performing ad hoc analysis database data excel 2007 includes 300 pre-defined functions although customized functions also created users imported third party developers add-ons excel functions grouped type operating client computing layer excel plays important role business intelligence tool microsoft reinforces positioning business intelligence documentation positions excel clearly pivotal role operating within database environment xleratordb functions utilize naming conventions input formats cases return calculation results excel functions xleratordb coupled sql server native capabilities compares excel function sets follows | [
3172,
2530,
2054,
7715
] | Test |
1,195 | 3 | The_Light_Corridor:light corridor light corridor first-person puzzle game available atari st amiga amstrad cpc commodore 64 ms-dos msx zx spectrum released 1990 infogrames player must capture light rays order accomplish ultimate challenge illumination stars newborn universe player uses paddle hit metal ball long corridor player releases ball stuck paddle beginning game travel corridor hits wall similar obstacle bounces back towards player point player need hit ball ball hit lose life game continue player stopped ball attached paddle ball travelling corridor player must walk follow object game reach end corridor obstacles moving elevator-style doors make navigating corridor difficult success relies player β quick reactions forward planning collectable power-ups make progress easier colour corridor changes every four levels fifty levels total game played one two players two player games players alternate turns level construction kit included player create levels save future use sinclair user gave 93 overall score crash called simple wildly addictive sinclair said frustratingly difficult worth going back | [
6380
] | Test |
1,196 | 9 | GoldSim:goldsim goldsim dynamic probabilistic simulation software developed goldsim technology group general-purpose simulator hybrid several simulation approaches combining extension system dynamics aspects discrete event simulation embedding dynamic simulation engine within monte carlo simulation framework general-purpose simulator goldsim extensively used environmental engineering risk analysis applications areas water resource management mining radioactive waste management geological carbon sequestration aerospace mission risk analysis energy 1990 golder associates international engineering consulting firm asked united states department energy doe develop probabilistic simulation software could used help decision support management within office civilian radioactive waste management results effort two dos-based programs rip strip used support radioactive waste management projects within doe 1996 effort funded golder associates us doe japan nuclear cycle development institute currently japan atomic energy agency enresa capabilities rip strip incorporated general purpose windows-based simulator called goldsim subsequent funding also provided nasa initially offered original funding organizations goldsim released public 2002 2004 goldsim technology group llc spun golder associates wholly independent company notable applications include providing simulation framework 1 yucca mountain repository performance assessment model developed sandia national laboratories 2 comprehensive system-level computational model performance assessment geological sequestration co developed los alamos national laboratory 3 flood operations model help better understand fine tune operations large dam used water supply flood control queensland australia 4 models simulating risks associated future manned space missions nasa β constellation program developed nasa ames research center goldsim provides visual hierarchical modeling environment allows users construct models adding β elements β model objects represent data equations processes events linking together graphical representations resemble influence diagrams influence arrows automatically drawn elements referenced elements complex systems translated hierarchical goldsim models creating layer β containers β sub-models visual representations hierarchical structures help users build large complex models still explained interested stakeholders e.g. government regulators elected officials public though primarily continuous simulator goldsim number features typically associated discrete simulators combining two simulation methods systems best represented using continuous discrete dynamics often accurately simulated examples include tracking quantity water reservoir subject continuous inflows outflows well sudden storm events tracking quantity fuel space vehicle subjected random perturbations e.g. component failures extreme environmental conditions software originally developed complex environmental applications many inputs uncertain and/or stochastic addition dynamic simulator goldsim monte carlo simulator inputs defined distributions entire system simulated large number times provide probabilistic outputs software incorporates number computational features facilitate probabilistic simulation complex systems including tools generating correlating stochastic time series advanced sampling capabilities including latin hypercube sampling nested monte carlo analysis importance sampling support distributed processing | [
3378,
4759,
6380,
5571
] | Test |
1,197 | 3 | Lockstep_(computing):lockstep computing lockstep systems fault-tolerant computer systems run set operations time parallel redundancy duplication allows error detection error correction output lockstep operations compared determine fault least two systems dual modular redundancy error automatically corrected least three systems triple modular redundancy via majority vote term lockstep originates army usage refers synchronized walking marchers walk closely together physically practical run lockstep system set progress one well-defined state next well-defined state new set inputs reaches system processes generates new outputs updates state set changes new inputs new outputs new state considered define step must treated atomic transaction words either happens none happens something sometimes timeshift delay set systems increases detection probability errors induced external influences e.g voltage spikes ionizing radiation situ reverse engineering vendors including intel use term lockstep memory describe multi-channel memory layout cache lines distributed two memory channels one half cache line stored dimm first channel second half goes dimm second channel combining single error correction double error detection secded capabilities two ecc-enabled dimms lockstep layout single-device data correction sddc nature extended double-device data correction dddc providing protection failure single memory chip downsides intel lockstep memory layout reduction effectively usable amount ram case triple-channel memory layout maximum amount memory reduces one third physically available maximum reduced performance memory subsystem computing systems duplicated actively process step difficult arbitrate outputs differ end step reason common practice run dmr systems master/slave configurations slave hot-standby master rather lockstep since advantage slave unit actively process step common method working master copy state end step processing slave master fail point slave ready continue previous known good step either lockstep dmr approach combined means detecting errors master provide redundancy hardware failure master protect software failure master fails software error highly likely slave attempting repeat execution step failed simply repeat error fail way example common mode failure computing systems triplicated becomes possible treat voting systems one unit output disagrees two detected failed matched output two treated correct | [
5735,
3764,
5738,
7131,
6748,
4847,
5323,
4221,
3397,
6753,
7093
] | Test |
1,198 | 9 | Name_mangling:name mangling compiler construction name mangling also called name decoration technique used solve various problems caused need resolve unique names programming entities many modern programming languages provides way encoding additional information name function structure class another datatype order pass semantic information compilers linkers need arises language allows different entities named identifier long occupy different namespace namespace typically defined module class explicit namespace directive different signatures function overloading object code produced compilers usually linked pieces object code produced another compiler type program called linker linker needs great deal information program entity example correctly link function needs name number arguments types although name mangling generally required used languages support function overloading c classic pascal use cases provide additional information function example compilers targeted microsoft windows platforms support variety calling conventions determine manner parameters sent subroutines results returned different calling conventions compatible one another compilers mangle symbols codes detailing convention used call specific routine mangling scheme established microsoft informally followed compilers including digital mars borland gnu gcc compiling code windows platforms scheme even applies languages pascal delphi fortran c allows subroutines written languages call called existing windows libraries using calling convention different default compiling following c examples 32 bit compilers emit respectively mangling schemes function encoded codice_1 codice_2 respectively number bytes decimal argument parameter list including passed registers fastcall case function name merely prefixed underscore 64-bit convention windows microsoft c leading underscore difference may rare cases lead unresolved externals porting code 64 bits example fortran code use 'alias link c method name follows compile link fine 32 bits generate unresolved external codice_3 64 bits one workaround use 'alias method names typically need capitalized c fortran another use bind option c++ compilers widespread users name mangling first c++ compilers implemented translators c source code would compiled c compiler object code symbol names conform c identifier rules even later emergence compilers produced machine code assembly directly system linker generally support c++ symbols mangling still required c++ language define standard decoration scheme compiler uses c++ also complex language features classes templates namespaces operator overloading alter meaning specific symbols based context usage meta-data features disambiguated mangling decorating name symbol name-mangling systems features standardized across compilers linkers link object code produced different compilers single c++ translation unit might define two functions named distinct functions relation apart name c++ compiler therefore encode type information symbol name result something resembling even though name unique still mangled name mangling applies symbols mangled symbols example comments respective identifier name produced gnu gcc 3.x compilers mangled symbols begin codice_4 note identifier beginning underscore followed capital reserved identifier c conflict user identifiers avoided nested names including namespaces classes followed codice_5 series length id pairs length length next identifier finally codice_6 example codice_7 becomes functions followed type information function simply codice_8 hence standard type codice_9 used special alias codice_10 reference type therefore codice_11 complete name function n't standard scheme even trivial c++ identifiers mangled consequently different compilers even different versions compiler compiler different platforms mangle public symbols radically different thus totally incompatible ways consider different c++ compilers mangle functions notes job common c++ idiom ensure symbols within unmangled β compiler emits binary file names undecorated c compiler would c language definitions unmangled c++ compiler needs avoid mangling references identifiers example standard strings library usually contains something resembling thus code uses correct unmangled used sunpro c++ compiler would produce code equivalent since symbols exist c runtime library e.g libc link errors would result though would seem standardised name mangling c++ language would lead greater interoperability compiler implementations standardization would suffice guarantee c++ compiler interoperability might even create false impression interoperability possible safe n't name mangling one several application binary interface abi details need decided observed c++ implementation abi aspects like exception handling virtual table layout structure stack frame padding etc also cause differing c++ implementations incompatible requiring particular form mangling would cause issues systems implementation limits e.g. length symbols dictate particular mangling scheme standardised requirement name mangling would also prevent implementation mangling required β example linker understood c++ language c++ standard therefore attempt standardise name mangling contrary annotated c++ reference manual also known arm section 7.2.1c actively encourages use different mangling schemes prevent linking aspects abi exception handling virtual table layout incompatible nevertheless detailed section platforms full c++ abi standardized including name mangling c++ symbols routinely exported dll shared object files name mangling scheme merely compiler-internal matter different compilers different versions compiler many cases produce binaries different name decoration schemes meaning symbols frequently unresolved compilers used create library program using employed different schemes example system multiple c++ compilers installed e.g. gnu gcc os vendor compiler wished install boost c++ libraries would compiled multiple times gcc vendor compiler good safety purposes compilers producing incompatible object codes codes based different abis regarding e.g. classes exceptions use different name mangling schemes guarantees incompatibilities detected linking phase executing software could lead obscure bugs serious stability issues reason name decoration important aspect c++-related abi output java signature method class contains name types method arguments return value applicable format signatures documented language compiler .class file format designed together object-orientation universal interoperability mind start scope anonymous classes confined parent class compiler must produce qualified public name inner class avoid conflict classes name inner exist namespace similarly anonymous classes must fake public names generated concept anonymous classes exists compiler runtime compiling following java program produce three .class files class names valid symbols permitted jvm specification names safe compiler generate java language definition advices use symbols normal java class definitions name resolution java complicated runtime fully qualified class names unique inside specific classloader instance classloaders ordered hierarchically thread jvm so-called context class loader cases two different classloader instances contain classes name system first tries load class using root system classloader goes hierarchy context class loader java native method support allows java language programs call programs written another language generally either c c++ two name-resolution concerns neither implemented particularly standard manner python mangling used private class members designated giving name two leading underscores one trailing underscore example codice_13 mangled codice_14 codice_15 codice_16 codice_17 python runtime restrict access members mangling prevents name collisions derived class defines member name encountering name mangled attributes python transforms names prepending single underscore name enclosing class example avoid name mangling pascal use free pascal supports function operator overloading thus also uses name mangling support features hand free pascal capable calling symbols defined external modules created another language exporting symbols called another language information consult chapter 6.2 chapter 7.1 free pascal programmer guide name mangling also necessary fortran compilers originally language case insensitive mangling requirements imposed later evolution language addition modules features fortran 90 standard case mangling especially common issue must dealt order call fortran libraries lapack languages c case insensitivity name subroutine function foo must converted canonical case format fortran compiler linked way regardless case different compilers implemented various ways standardization occurred aix hp-ux fortran compilers convert identifiers lower case foo cray unicos fortran compilers converted identifiers upper case foo gnu g77 compiler converts identifiers lower case plus underscore foo_ except identifiers already containing underscore foo_bar two underscores appended foo_bar__ following convention established f2c many compilers including sgi irix compilers gnu fortran intel fortran compiler except microsoft windows convert identifiers lower case plus underscore foo_ foo_bar_ microsoft windows intel fortran compiler defaults uppercase without underscore identifiers fortran 90 modules must mangled procedure name may occur different modules since fortran 2003 standard requires module procedure names conflict external symbols compilers tend use module name procedure name distinct marker example following module name function mangled e.g. gnu fortran e.g. intel ifort e.g. oracle sun95 etc since fortran allow overloading name procedure uses generic interface blocks generic type-bound procedures instead mangled names need incorporate clues arguments fortran 2003 bind option overrides name mangling done compiler shown function names mangled default rust however disabled function attribute attribute used export functions c c++ objective-c. additionally along function attribute crate attribute allows user define c-style entry point program starting rust 1.9 rust uses c++-style name-mangling scheme partly follows itanium c++ abi essentially two forms method exist objective-c class static method instance method method declaration objective-c following form class methods signified instance methods use typical class method declaration may look like instance methods looking like method declarations specific internal representation compiled method named according following scheme class methods instance methods colons objective-c syntax translated underscores objective-c class method belonging codice_18 class would translate codice_19 instance method belonging class would translate codice_20 methods class labeled way however order look method class may respond would tedious methods represented fashion methods assigned unique symbol integer symbol known selector objective-c one manage selectors directly β specific type objective-c β codice_21 compilation table built maps textual representation codice_20 selectors given type codice_21 managing selectors efficient manipulating textual representation method note selector matches method name class belongs β different classes different implementations method name implementations method given specific identifier β known implementation pointers given type also codice_24 message sends encoded compiler calls function one cousins codice_25 receiver message codice_21 determines method call class table maps selectors implementations β implementation pointer specifies memory actual implementation method resides separate tables class instance methods apart stored codice_21 codice_24 lookup tables functions essentially anonymous codice_21 value selector vary classes enables polymorphism objective-c runtime maintains information argument return types methods however information part name method vary class class since objective-c support namespaces need mangling class names appear symbols generated binaries swift keeps metadata functions mangled symbols referring metadata includes function name attributes module name parameter types return type example mangled name method codice_30 codice_31 class module codice_32 _tfc4test7myclass9calculatefs0_ft1xsi_si components meanings follows codice_33 prefix swift symbols everything start codice_34 non-curried function codice_35 function class method codice_36 module name prefixed length codice_37 class name function belongs prefixed length codice_38 function name codice_39 function attribute case β f β normal function codice_40 designates type first parameter namely class instance first type stack codice_31 nested thus index 0 codice_42 begins type list parameter tuple function codice_43 external name first parameter function codice_44 indicates builtin swift type codice_45 first parameter codice_46 return type codice_45 | [
1339,
6249,
4662,
900,
1541,
2198,
3955,
1361,
4942,
8097,
7096,
7010,
410,
3557,
5591,
5854,
5506,
2803,
5190,
5606,
5965,
4275,
1236,
1989,
2079,
1803,
1435,
3926
] | Test |
1,199 | 3 | POWER3:power3 power3 microprocessor designed exclusively manufactured ibm implemented 64-bit version powerpc instruction set architecture isa including optional instructions isa time instructions present power2 version power isa powerpc isa introduced 5 october 1998 debuting rs/6000 43p model 260 high-end graphics workstation power3 originally supposed called powerpc 630 renamed probably differentiate server-oriented power processors replaced consumer-oriented 32-bit powerpcs power3 successor p2sc derivative power2 completed ibm long-delayed transition power powerpc originally scheduled conclude 1995 power3 used ibm rs/6000 servers workstations 200 mhz competed digital equipment corporation dec alpha 21264 hewlett-packard hp pa-8500 power3 based powerpc 620 earlier 64-bit powerpc implementation late under-performing commercially unsuccessful like powerpc 620 power3 three fixed-point units single floating-point unit fpu replaced two floating-point fused multiplyβadd units extra load-store unit added total two improve floating-point performance power3 superscalar design executed instructions order seven-stage integer pipeline minimal eight-stage load/store pipeline ten-stage floating-point pipeline front end consists two stages fetch decode first stage eight instructions fetched 32 kb instruction cache placed 12-entry instruction buffer second stage four instructions taken instruction buffer decoded issued instruction queues restrictions instruction issue two integer instruction queues one accept one instruction accept four floating-point instruction queue queues enough unused entries instructions issued front end short pipeline resulting small three-cycle branch misprediction penalty stage three instructions instruction queues ready execution operands read register files general-purpose register file contains 48 registers 32 general-purpose registers 16 rename registers register renaming reduce number ports required provide data receive results general purpose register file duplicated two copies first supporting three integer execution units second supporting two load/store units scheme similar contemporary microprocessor dec alpha 21264 simpler require extra clock cycle synchronize two copies due power3 higher cycle times floating-point register file contains 56 registers 32 floating-point registers 24 rename registers compared powerpc 620 rename registers allowed instructions executed order improving performance execution begins stage four instruction queues dispatch eight instructions execution units integer instructions executed three integer execution units termed fixed-point units ibm two units identical execute integer instructions except multiply divide instructions executed one-cycle latency third unit executes multiply divide instructions instructions pipelined multi-cycle latencies 64-bit multiply nine-cycle latency 64-bit divide 37-cycle latency floating-point instructions executed two floating-point units fpus fpus capable fused multiplyβadd multiplication addition performed simultaneously instructions along individual add multiply four-cycle latency divide square-root instructions executed fpus assisted specialized hardware single-precision 32-bit divide square-root instructions 14-cycle latency whereas double-precision 64-bit divide square-root instructions 18-cycle 22-cycle latency respectively execution completed instructions held buffers committed made visible software execution finishes stage five integer instructions stage eight floating-point committing occurs stage six integers stage nine floating-point writeback occurs stage commit power3 retire four instructions per cycle powerpc 620 data cache optimized technical scientific applications capacity doubled 64 kb improve cache-hit rate cache dual-ported implemented interleaving eight banks enable two loads two stores performed one cycle certain cases line-size increased 128-bytes l2 cache bus doubled width 256 bits compensate larger cache line size retain four-cycle latency cache refills power3 contained 15 million transistors 270 mm die fabricated ibm cmos-6s2 process complementary metalβoxideβsemiconductor process hybrid 0.25 Β΅m feature sizes 0.35 Β΅m metal layers process features five layers aluminium packaged 1,088-column ceramic column grid array p2sc different pin power3-ii improved power3 increased clock frequency 450 mhz contains 23 million transistors measured 170 mm fabricated ibm cmos7s process 0.22 Β΅m cmos process six levels copper interconnect succeeded power4 2001 | [
7327,
2719,
3348,
3764,
4661,
3936,
1075,
1346,
4847,
2458,
3440,
3521,
1083,
4408,
5652,
912,
7361,
2845,
3708,
5665,
4702,
1386,
1388,
7099,
234,
2501,
239,
6474,
8125,
4815,
1131,
6226,
608,
3747,
2257,
3156,
3674,
441,
5622
] | Test |
1,200 | 1 | Pseudocolumn:pseudocolumn pseudocolumn column yields value selected actual column table example rowid sysdate often used combination dual table | [
3863,
2054,
8078
] | Test |
1,201 | 4 | NotCompatible:notcompatible notcompatible complex malware infects android-based phones revealed late 2014 thought infected hundreds thousands phones | [] | Test |
1,202 | 2 | Nokia_N9:nokia n9 nokia n9 codename lankku smartphone developed nokia running linux-based meego harmattan mobile operating system announced june 2011 released september first device nokia meego partly company alliance microsoft announced year initially released three colors black cyan magenta white version announced nokia world 2011 despite limited release n9 received widespread critical acclaim describing nokia finest device date praised software hardware including meego operating system buttonless 'swipe user interface high-end features design would form basis windows phone-powered nokia lumia 800 later year successor nokia n900 internally known n9-00 scheduled released late 2010 approximately one year n900 launched pictures prototype leaked august 2010 showed industrial design 4-row keyboard software engineer working nokia device division cited n9-00 product number public bug tracker qt open source application development framework used meego would later known n950 design dropped nokia started working n9-01 codenamed lankku new variant without keyboard nokia planned 2010 make meego flagship smartphone platform replacing symbian whose n8 flagship launched year thus effectively n9 originally meant flagship device company 11 february 2011 nokia partnered microsoft use windows phone 7 flagship operating system replace symbian meego also sidelined nokia ceo stephen elop promised still ship one meego device year would end n9 nokia n9 announced 21 june 2011 nokia connection event singapore time phone presumed become available public september 2011 users get notified via e-mail availability n9 country webpage nokia online store since nokia closed nokia online shop many countries including poland germany netherlands france italy spain united kingdom united states 30 june 2011 availability countries hands retailers operators elop restated company continuing development meego even n9 would success focusing solely future lumia series something meego supporters already felt n9 announcement due microsoft deal responded creating petition want nokia keep meego even severe meego linux also form continuation maemo linux established combining nokia maemo intel moblin frames nokia intel alliance created purposes cooperation despite success alliance broken meego canceled stephen elop decision intel officially expressed regrets situation n9 positive reception generally weak sales lumia range elop criticised move said contributed company demise smartphone market according elop following microsoft alliance meego became experimental project harmattan interface elements used cancelled meltemi project later nokia asha platform august 2011 nokia announced nokia n9 released united states reports indicated device available markets japan canada germany nokia posted official blog last week september 2011 n9 phones heading stores initial retail price announced around β¬480 16gb β¬560 64gb applicable taxes subsidies germany devices imported switzerland available online amazon german cyberport gmbh january 2012 also made available major stores saturn media markt chain february 2012 nokia n9 appeared italian nokia site supposed sign n9 official nokia distribution italian market prices january 2012 depending size internal memory β¬500 β¬630 nokia n9 powered texas instruments omap 3630 system-on-a-chip based 45 nanometer cmos process includes three processor units 1 ghz arm cortex a8 cpu runs operating system applications imagination technologies powervr sgx530 gpu supporting opengl es 2.0 capable processing 14 million polygons per second 430 mhz ti tms320c64x digital signal processor image processing camera audio processing telephony data transmission system also 1 gb low power single channel ram mobile ddr compcache uses part memory compressed fast swap time powerful device nokia created user data stored internal emmc chip 16 64 gb variants n9 first smartphone encompass 64 gb storage nokia n9 capacitive touchscreen 6 simultaneous points resolution 854 Γ 480 pixel fwvga 251 ppi pentile rgbg layout according nokia capable displaying 16.7 million colors oled screen covered curved scratch-resistant corning gorilla glass gap glass display reduced screen coated anti-glare polarizer ease usability daylight proximity sensor deactivates display touchscreen device brought near face call also ambient light sensor adjusts display brightness device also makes use accelerometer rotate screen portrait/landscape mode applications web browser n9 autonomous gps feature optional a-gps functionality wi-fi network positioning magnetometer comes pre-loaded nokia maps nokia drive applications nokia maps similar ovi maps found recent symbian devices nokia mostly finding nearby places restaurants metro station theater etc ... around user nokia maps meego also integrated contacts calendar applications nokia drive dedicated application car navigation provides free lifetime turn-by-turn voice guided car navigation nokia n9 comes preloaded maps continent purchased nokia drive require active data connection work stand-alone gps navigator main back camera autofocus feature dual led flash optimized 16:9 4:3 aspect ratios 4Γ digital zoom video camera sensor size back camera 8.7 megapixels 3552 Γ 2448 px effective resolution 16:9 aspect ratio 3552 Γ 2000 px 7.1 megapixels 3248 Γ 2448 px 8 megapixels 4:3 aspect ratio typically 16:9 picture format digital camera achieved cropping top bottom 4:3 image since sensor 4:3 nokia n9 genuinely provides width picture choosing 16:9 aspect ratio option using full 3552-pixel width sensor height picture choosing 4:3 aspect ratio option using full 2448-pixel height sensor carl zeiss lens quite unusual specifications mobile phone 28mm wide-angle lens focal length fast class f/2.2 aperture 10 cm-to-infinity focus range capable recording 720p video 30 fps stereo sound holding device facing screen right side power on/off long press lock/unlock short press button volume keys nokia n9 fewer hardware buttons smartphones makes extensive use touchscreen navigate user interface example minimize running application user swipe finger one side bezel surrounding screen opposite side also dedicated shutter key camera touch screen instead used focus take picture screen unlocked double tapping n9 two microphones loudspeaker situated bottom phone main microphone enables conversation recording second microphone located back device near flash leds main camera used meego system noise cancellation make phone conversations clearer noisy environment top 3.5 mm av connector simultaneously provides stereo audio output support dolby headphone either microphone input video output next 3.5 mm connector high-speed usb 2.0 usb micro-b connector provided data synchronization mass storage mode client battery charging usb connector protected small door built-in bluetooth v2.1 +edr enhanced data rate supports stereo audio output a2dp profile built-in car hands-free kits also supported hfp profile file transfer supported ftp along opp profile sending/receiving objects possible remote control device avrcp profile bluetooth chip also functions fm receiver/transmitter allowing one listen fm radio using headphones connected 3.5 jack antenna nokia n800 n810 n900 ship without software support however fm radio application already available ovi store independent developer nfc also supported sharing photos contacts music devices supporting nfc e.g nokia c7 nokia 701 also pairing connecting stereo speakers e.g nokia play 360 headset e.g nokia bh-505 one device connected simultaneously n9 via nfc nokia n9 bv-5jw 3.8v 1450mah battery according nokia provides 7h 11h continuous talk time 16 19.5 days standby 4.5h video playback 50h music playback phone supports usb charging number devices used n9 via several connectivity options external keyboards via bluetooth wireless headphones via nfc wireless loudspeakers via nfc many others strictly speaking nokia n9 run meego 1.2 operating system instead runs nokia refers meego instance development harmattan previously marketed maemo 6 nokia intel merged open source projects one new common project called meego postpone development schedule nokia decided keep core harmattan middleware components gstreamer packaging managers harmattan system uses debian packages instead rpm packages nonetheless harmattan designed fully api compatible meego 1.2 via qt far end users application developers concerned distinction harmattan meego 1.2 minimal since marketing effort would directed meego nokia dropped maemo branding adopt meego confuse customers. ref name= renaming maemo 6 meego/harmattan /ref nokia n9 user experience provides three panes called home lock screen dragging flicking horizontally navigates three panes home home consists application swipe gesture one edge screen one return user one three views home close application either suspended keep running background depending application close application user must press hold red x appears upper left corner application thumbnail open application view close user may also close apps swiping top device application fadeout effect tapping status bar top screen using application display menu allowing user adjust volume change active profile silent beep ringing internet connection wifi gsm data bluetooth control shortcut enabled bluetooth settings media sharing dlna shortcut enabled media sharing settings introduced pr 1.2 availability lock screen display status bar clock notifications screen also holds music controls introduced pr 1.1 music player active customizable end user phone unlocked double tapping screen sliding holding lock screen reveals 4 shortcuts called quick launcher quick launcher also accessed using application swiping ui n9 including visual style double-tap feature resurrected nokia asha platform introduced nokia asha 501 device 2013 nokia n9 announced nokia connections event singapore june 2011 reception device positive citing meego v1.2 harmattan ui pseudo-buttonless design polycarbonate unibody construction nfc capabilities still many reviewers recommend buy n9 nokia earlier decision drop meego windows phone future smartphones β often questioning decision time engadget editor vlad savov said june 2011 terrific phone got legitimately excited use future clouded parent investing time money building whole os later review engadget writes love first sight β possibly beautiful phone ever made meego 1.2 harmattan breath fresh air leave gasping β remember 're dealing dead man walking review ars technica ryan paul writes n9 impressively engineered device matched sophisticated touch-oriented interface powerful software stack open source underpinnings verge website writes nokia n9 without doubt one fascinating phones last years german der spiegel titles could nokia winner german magazine stern describes one best devices ever made nokia delimiter called n9 nokia significant handset since nokia n95 nokia n9 released largest smartphone markets u.s. canada uk netherlands germany france italy spain others nokia disclose number sales n9 november 2011 nokia n9 3 4 applicable titles including design camera cellphone year gala held swedish magazine webzine mobil.se january 2012 nokia n9 swipe ui nominated ixda interaction award february 2012 n9 reached number 1 ranking rate rate 8.432 10 votes 74,940 also number 5 daily interest hits gsmarena ranking april 2012 n9 awarded design art direction yellow pencil interactive product design category beating among others ipad 2 nokia lumia 800 approach applied nokia one open platform exception closed user experience maemo 5 nokia n900 community request closed source component owned nokia released open source hundreds 3rd party applications mostly free open source already created ported gnu/linux meego harmattan platform nokia decision abandon meego even n9 success left much team unhappy staff left form new company jolla continue development meego resulted fork called sailfish os ported n9 see released two new smartphones created jolla images n9 prototype running android 2.3 leaked sina weibo user previously uploaded prototype images nokia sea ray later lumia 800 windows phone believed likely genuine steven elop mentioned nokia considered android past unofficial android 4.1.1 port nitdroid community made port features general functionality misses features voice calling use camera 21 november 2012 jolla announced demonstrated sailfish os direct continuation based meego 80 first linux sailfish os open source part linux meego original meego open source code developed frames mer software distribution comes meego reinstated established current standard middleware stack core software kernel ui os open source free vendors harmattan ui several software applications used n9 closed proprietary nokia hence could used neither mer project sailfish os jolla introduced swipe ui used mer core standard created sailfish os videos sailfish os running nokia n950 appeared internet day announcement n950 similar technical specifications n9 slight differences including physical qwerty keyboard led many owners n9 believe sailfish os ported n9 jolla confirmed also stated official possibilities kind support n9 instead community provide unofficial port sailfish os however jolla maintained experience sailfish official jolla phones jolla released first jolla mobile phone november 27 2013 sailfish os first full linux meego os meego harmattan meego instance fully finished combining maemo moblin sailfish os actively developed commonly assumed next better incarnation meego also jolla device assumed unofficial successor n9 legacy means early 2019 kaios technologies inc. demonstrate devices running kaios nokia 8110 2018 jio phone one full touch device suspected nokia n9 | [
1066,
2538,
372,
7521,
3615,
1453,
3952,
4317,
2922,
23,
2564,
6443,
7545,
5044,
740,
7919,
6465,
5062,
3653,
5068,
2240,
3657,
4726,
5775,
1129,
76,
1904,
2271,
6517,
1167,
3694,
472,
4407,
118,
3703,
7261,
5493,
3029,
499,
5499,
139,
... | Test |
1,203 | 2 | PurifyPlus:purifyplus purifyplus memory debugger program used software developers detect memory access errors programs especially written c c++ originally written reed hastings pure software pure software later merged atria software form pure atria software turn later acquired rational software turn acquired ibm divested unicom systems inc. dec 31 2014 functionally similar memory debuggers insure++ valgrind boundschecker purifyplus allows dynamic verification process program discovers errors occur program runs much like debugger static verification static code analysis contrast involves detecting errors source code without ever compiling running discovering logical inconsistencies type checking c compiler example static verification program linked purifyplus corrected verification code automatically inserted executable parsing adding object code including libraries way memory error occurs program print exact location error memory address involved relevant information purifyplus also detects memory leaks default leak report generated program exit also generated calling purifyplus leak-detection api within instrumented application errors purifyplus discovers include array bounds reads writes trying access unallocated memory freeing unallocated memory usually due freeing memory second time well memory leaks allocated memory pointer reference errors fatal least site error often running program way detect except observing something wrong due incorrect program behavior hence purifyplus helps detecting errors telling programmer exactly occur purifyplus works instrumenting object code detects errors occur inside third-party operating system libraries errors often caused programmer passing incorrect arguments library calls misunderstandings protocols freeing data structures used libraries often difficult errors find fix ability detect non-fatal errors major distinction purifyplus similar programs usual debuggers contrast debuggers generally allow programmer quickly find sources fatal errors program crash due dereferencing null pointer help detect non-fatal memory errors debuggers useful things purifyplus intended stepping code line line examining program memory hand particular moment execution words tools complement skilled developer purifyplus also includes functionality high-performance watchpoints general use using debugger one code worth noting using purifyplus makes sense programming languages leave memory management programmer hence java lisp visual basic example automatic memory management reduces occurrence memory leaks languages however still leaks unnecessary references objects prevent memory re-allocated ibm product called rational application developer uncover sorts errors | [
1361,
5606,
2153,
4662,
572,
573,
5571,
3114,
1435
] | Test |
1,204 | 7 | Simple_Grid_Protocol:simple grid protocol simple grid protocol freeware grid computing package developed maintained brendan kosowski package includes protocol software tools needed get computational grid running linux bsd based clisp common lisp implementation simple grid protocol allows computer programs utilize unused cpu resources computers network internet | [
5757,
4159,
1445,
578
] | Test |
1,205 | 7 | Guifi.net:guifi.net guifi.net free open neutral mostly wireless community network 35,000 active nodes 63,000 km wireless links july 2018 majority nodes located catalonia valencian community spain network growing parts world network self-organized operated users using unlicensed wireless links open optical fibre links nodes network contributed individuals companies administrations freely connect open network telecommunications extend network wherever infrastructure content might otherwise accessible nodes join network following self-provision model since whole structure explicitly open facilitate understanding structured everyone create new sections required results network infrastructure commons provides abundant connectivity guifi.net supported guifi.net foundation registered operator spanish telecommunications market commission cmt since april 2009 august 2009 first deployment optical fiber started known fiber farms fftf broadband initiative covering 2 km linking dozens farms farmhouses town gurb since early 2011 guifi.net connected catalonia neutral internet exchange point catnix exchanges data international telecommunications operators cogent communications hurricane electric internet connection used several associations offer members internet access low-cost high speeds internet service providers currently offer model oriented cost sharing compensation mechanism basic principle operation based wireless commons license | [
2132,
6335,
6987
] | Validation |
1,206 | 5 | PhoneNet:phonenet phonenet implementation appletalk networking physical layer created farallon computing netopia instead using expensive shielded twisted pair wiring apple localtalk implementation phonenet uses standard four-conductor telephone category 1 patch cords modular connectors like localtalk theoretical maximum speed data transfer 230 kbit/s generally used daisy chain topology unlike localtalk balanced grounded implementation phonenet used two lines four typical cable normal telephone equipment also normally used two lines phonenet could plugged existing phone lines instances allowing phone calls networking single cable generally requires hand-crimping cable using three rj11 jacks connecting single jack two one two wires phone two networking though phonenet transceivers still available third parties use legacy macintosh networks current apple computer device model comes rs-422 serial ports required phonenet transceivers modern apple devices network use ethernet wi-fi bluetooth | [
8081
] | Test |
1,207 | 3 | MIC-1:mic-1 mic-1 processor architecture invented andrew s. tanenbaum use simple complete example teaching book structured computer organization consists simple control unit runs microcode 512-words store micro-assembly language mal engineered allow simple writing ijvm interpreter source code interpreter found book data path core mic-1 contains 32-bit registers buses alu shifter 2 main buses 32 lines 32 bits registers selected 2 control lines one enable b bus enable c bus b bus enabled one register time since transfer data 2 registers time would make data inconsistent contrast c bus enabled 1 register time matter fact current value present c bus written 1 register without problems reading writing operations carried 1 clock cycle mbr register readonly register contains 2 control lines since 8-bit register output connected least significant 8 bits b bus set provide output 2 ways alu arithmetic logic unit following input output control lines shifter contains 32-bit input output output connected directly c bus shifter used perform logical arithmetic shift operations simply setting respectively control signal sll8 shift left logical sra1 shift right arithmetic | [
1568,
5012,
6778,
336
] | Test |
1,208 | 2 | Zswap:zswap zswap linux kernel feature provides compressed write-back cache swapped pages form virtual memory compression instead moving memory pages swap device swapped zswap performs compression stores memory pool dynamically allocated system ram later writeback actual swap device deferred even completely avoided resulting significantly reduced i/o linux systems require swapping tradeoff need additional cpu cycles perform compression result reduced i/o zswap offers advantages various devices use flash-based storage including embedded devices netbooks similar low-end hardware devices well devices use solid-state drives ssds storage flash memory limited lifespan due nature avoiding used providing swap space prevents wearing quickly zswap integrated rest linux kernel virtual memory subsystem using api provided frontswap mechanism linux kernel abstracts various types storage used swap space result zswap operates backend driver frontswap providing internally visible pseudo-ram device words frontswap api makes zswap capable intercepting memory pages swapped capable intercepting page faults already swapped pages access two paths allows zswap act compressed write-back cache swapped pages internally zswap uses compression modules provided linux kernel crypto api makes possible example offload compression tasks main cpu using hardware compression accelerators supported linux kernel selection desired compression module performed dynamically boot time value kernel boot parameter specified defaults selects lempelβzivβoberhumer lzo compression version 3.13 linux kernel zswap also needs explicitly enabled specifying value kernel boot parameter maximum size memory pool used zswap configurable parameter specifies maximum percentage total system ram occupied pool memory pool preallocated configured maximum size instead grows shrinks required configured maximum pool size reached result performed swapping growing pool impossible due out-of-memory condition swapped pages evicted memory pool swap device least recently used lru basis approach makes zswap true swap cache oldest cached pages evicted swap device cache full making room newer swapped pages compressed cached zbud special-purpose memory allocator used internally zswap storing compressed pages implemented rewrite zbud allocator used oracle zcache another virtual memory compression implementation linux kernel internally zbud works storing two compressed pages buddies hence allocator name per physical memory page brings advantages due easy coalescing reusing freed space disadvantages due possible lower memory utilization however result design zbud allocate memory space would originally occupied uncompressed pages zswap zbud created seth jennings first public announcement december 2012 development continued may 2013 point codebase reached maturity although still status experimental kernel feature zswap together zbud merged linux kernel mainline kernel version 3.11 released september 2 2013 since version 3.15 linux kernel released june 8 2014 zswap properly supports multiple swap devices one alternatives zswap zram provides similar still different swap compressed pages ram mechanism linux kernel main difference zram provides compressed block device using ram storing data acts regular separate swap device comparison zswap acts ram-based cache swap devices provides zswap eviction mechanism less used swapped pages zram lacks though result design least one already existing swap device required zswap used | [
3256,
2182,
3613,
4670,
5021,
13,
7528,
379,
3271,
7532,
3626,
5041,
5744,
6443,
7550,
3298,
405,
1855,
2942,
6117,
4341,
5762,
412,
4347,
415,
56,
65,
3666,
5783,
2970,
5088,
6500,
785,
2266,
788,
7956,
1522,
5453,
7605,
3351,
4759,
... | Validation |
1,209 | 0 | Computational_semantics:computational semantics computational semantics study automate process constructing reasoning meaning representations natural language expressions consequently plays important role natural language processing computational linguistics traditional topics interest construction meaning representations semantic underspecification anaphora resolution presupposition projection quantifier scope resolution methods employed usually draw formal semantics statistical semantics computational semantics points contact areas lexical semantics word sense disambiguation semantic role labeling discourse semantics knowledge representation automated reasoning particular automated theorem proving since 1999 acl special interest group computational semantics sigsem | [
1269,
1314,
2558,
5429,
6827,
5388,
1555,
7732,
7389,
4037,
7290,
4724
] | Test |
1,210 | 5 | Presence_and_Instant_Messaging:presence instant messaging presence instant messaging prim early proposal ietf standard protocol instant messaging abstract model first published ietf request comments nowiki rfc 2778 /nowiki model presence instant messaging february 2000 authored mark day sightpath formerly lotus software helped develop ibm lotus sametime chief scientist riverbed technology jonathan rosenberg dynamicsoft chief technology officer vice president collaboration cisco systems hiroyasu sugano fujitsu laboratories ltdltd work done since 2001 currently sip derivative simple jonathan rosenberg also co-authored invented xmpp considered use instant messaging protocols | [
7148,
3762,
3350,
7967,
2284,
7170,
2201,
6624,
1369,
6629,
4783,
1014,
4337,
1958,
2048,
3050,
2880,
4634,
5535
] | Test |
1,211 | 1 | Structurae:structurae structurae online database containing pictures information structural civil engineering works associated engineers architects builders entries contributed volunteers saved mysql database structurae founded 1998 nicolas janberg studied civil engineering princeton university march 2012 structurae acquired subsidiary john wiley sons inc. janberg joining company structurae editor-in-chief time web site received one million pageviews per month available english french german 2015 janberg bought site back operate freelancer | [
2054
] | Validation |
1,212 | 7 | Apigee:apigee apigee corp. silicon valley based company providing api management predictive analytics software founded 2004 sonoa systems rebranded apigee 2010 apigee acquired google deal worth 625 million 2016 sonoa systems founded 2004 santa clara california raj singh ravi chandra early 2006 sonoa brought chet kapoor ceo initially company developed router-like appliance xml soa governance time branched application platforms cloud computing 2009 sonoa released public beta api management tool called apigee providing app developers free cloud-based platform providing security analytics apis 2010 sonoa rebranded apigee api management platform became core business premium features added shortly apigee quickly expanded corporate customer base including likes netflix walgreens 2012 apigee acquired mobile api company usergrid 2014 acquired predictive analytics company insightsone apigee raised 87 million public ipo nasdaq 2015 apigee became founding member along smartbear ibm openapi initiative sponsorship linux foundation google announced would purchase apigee 625 million deal completed november 2016 apigee revenues generated subscriptions api management platform professional services subscribing customers apigee offers free tiers products premium features reserved subscribers apigee also sells additional functionality subscribing customers including ability monetize apis pci-dss compliance multi-region deployment amazon web services traffic isolation | [
2961,
5064
] | Test |
1,213 | 2 | Shutdown_(computing):shutdown computing shut power computer remove power computer main components controlled way computer shut main components cpus ram modules hard disk drives powered although internal components internal clock may retain power shutdown feature command available microsoft windows reactos hp mpe/ix number unix unix-like operating systems apple macos microsoft windows reactos pc server shut selecting shutdown item start menu desktop options include shutting system powering automatically restarting system shutting putting system stand-by mode also codice_1 command executed within command shell window codice_2 command-line shutdown application located windir \system32\shutdown.exe shut user computer another computer user network different parameters allow different functions one parameter used time command like operating systems windows option prohibit selected users shutting computer home pc every user may shutdown option computers large networks active directory administrator revoke access rights selected users shut windows computer nowadays many software utilities automate task shutting windows computer enabling automatic computer control windows shutdown website lists various software utilities automate task shutting windows program shut system calling codice_3 codice_4 function apple macos computer shut choosing shut down⦠apple menu pressing power key bring power management dialog box selecting button shut administrator may also use unix codice_1 command well also shut pressing alt command eject optical disc optical drive prompt user anything unix linux codice_1 command used turn reboot computer superuser shut system one commonly issued form command codice_7 shut system immediately another one codice_8 reboot another form allows user specify exact time delay shutdown codice_9 turn computer 8:00 pm codice_10 automatically reboot machine within 60 seconds one minute issuing command | [
1710,
2811,
361,
6789,
1812,
2817,
3764,
4387,
4759,
5637,
1537,
2999,
6088,
5116,
644,
2834,
2204,
5480,
2472,
3106,
4955,
6997,
8092,
578,
923,
1382,
3797,
5138,
5234,
7272,
667,
5942,
5946,
2589,
1670,
7494,
4547,
6773,
1140,
1237,
1... | Test |
1,214 | 2 | NewIcons:newicons newicons third-party extension icon handling system amigaos 2 newer newicons first invented developed italian programmer nicola salmoria subsequent development done eric sauvageau phil vedovatti need newicons arose poor overall quality icons amigaos versions prior 3.0 amigaos gui revolutionary first launched early 1980s operating systems mac os microsoft windows quickly caught started become professional-looking standard amigaos workbench icons plain uninteresting limited four colours standard size viewed straight-on perspective left looking two-dimensional aim newicons solve faults unlike standard workbench icon includes palette index information thus mercy user chosen workbench palette newicons icons natively drawn 32 colours 5-bit colour hold actual rgb colour information icon file memory-resident program called commodity amiga terminology tries best adapt icon colours current workbench screen palette 256 colour icons supported newicons system newicons also establishes standard icon size 36Γ40 pixels similar mac os windows design guidelines recommend icons drawn diagonal perspective thus creating illusion three dimensions guidelines also strongly encourage use workbench image highlights selected image changes actual shape clicked instead simply inverting colours becoming darker shade example computer terminal could screen powered pen could write letters paper robot symbolising computer game could move around newicons relatively large file size compared conventional amiga icons magicwb icons newicons stored 8-bit data even colours used image data encoded ascii application metadata consuming even space icon newicons also includes deficons package ready-made icons aims provide default icon image files associated icons provided codice_1 files amigaos deficons uses scheme actually examines file contents instead simply looking filename extension determine file type approach slower file extension system used microsoft windows ultimately accurate png image file .jpg extension appear png-specific icon amigaos 3.5 introduced glowicons icon format supported newicons without need third-party applications glowicons format based newicons file format native icon format used amigaos 3.5 3.9 4.0 matt chaput major difference newicons image data stored newicons uses inefficient ascii encoding embedded application tool type metadata glowicons system developers extended internal icon definition without need resort storing information tool types standard icon size 46Γ46 pixels maximum 256 8-bit colors two image states example open closed drawers second image state uses glow effect indicate icon pressed starting final update amigaos 4.0 supports 32 bit icon images | [
4759,
3688,
1534,
6431,
6009,
307,
5833,
5661,
7746,
7384,
3222,
7942,
7775
] | Test |
1,215 | 5 | Fibre_Channel_over_IP:fibre channel ip fibre channel ip fcip fc/ip also known fibre channel tunneling storage tunneling internet protocol ip created internet engineering task force ietf storage technology fcip entity functions encapsulate fibre channel frames forward ip network fcip entities peers communicate using tcp/ip fcip technology overcomes distance limitations native fibre channel enabling geographically distributed storage area networks connected using existing ip infrastructure keeping fabric services intact fibre channel fabric devices remain unaware presence ip network competing technology fcip known ifcp uses routing instead tunneling enable connectivity fibre channel networks ip | [
3821
] | Test |
1,216 | 3 | Macintosh_TV:macintosh tv macintosh tv personal computer integrated television capabilities released apple computer 1993 apple first attempt computer-television integration shares external appearance macintosh lc 500 series black macintosh tv essentially performa 520 switch built-in 14 sony trinitron crt computer display cable-ready television incapable showing television desktop window although capture still frames pict files comes small credit card-sized remote control also compatible sony televisions first macintosh made black comes matching black keyboard mouse later apple would issue custom black performa 5420 markets outside united states many features mac tv apple similar tv tuner card popular option later lc performa series select models power macintosh g3 beige computers 10,000 made model short time market | [
7890,
5732,
722,
1094,
2926,
5037,
5752,
2954,
7572,
6482,
6142,
4373,
7226,
2978,
7601,
4749,
5097,
3346,
6165,
4389,
5463,
102,
5469,
4768,
3008,
5477,
6200,
6202,
3387,
3390,
2331,
4820,
1234,
1237,
7311,
889,
550,
552,
5916,
3459,
5... | Test |
1,217 | 4 | Bromium:bromium bromium venture capitalβbacked startup based cupertino california works virtualization technology bromium focuses virtual hardware claiming reduce eliminate endpoint computer threats like viruses malware adware bromium founded 2010 gaurav banga later joined former citrix xensource executives simon crosby ian pratt 2013 company raised total 75.7 million three rounds venture funding rounds raised 9.2 million 26.5 million 40 million respectively venture firms andreessen horowitz ignition partners lightspeed venture partners highland capital partners intel capital meritech capital partners bromium shipped first product vsentry 1.0 sept 2012. notable early clients include nyse adp february 2014 company published information bypassing several key defenses microsoft enhanced mitigation experience toolkit emet taking advantage inherent weakness reliance known vectors return-oriented programming rop attack methods feb 2017 hp bromium announced partnership build ship laptop micro-virtualization technology built starting hp elitebook x360 bromium technology called micro-virtualization designed protect computers malicious code execution initiated end user including rogue web links email attachments files virtualization technology relies hardware isolation protection implemented late-load hypervisor called microvisor based open source xen hypervisor microvisor similar concept traditional hypervisor β installed server desktop β operating system traditional vms full versions operating system complete full suites applications microvisor uses hardware virtualization present desktop processors create micro-vms specialized virtual machines tailored support specific task new application opened link clicked email attachment downloaded microvisor creates micro-vm tailored specific task access resources required execute placing vulnerable tasks inside micro-vms tied hardware way malware work sandbox layer attack host environment i.e operating system micro-vms executed process gets micro-vm vm dissolved process stops taking malware microvisor enforces principle least privilege isolating applications operating system functions within micro-vm interacting micro-vm protected desktop system network protected desktop embedded architecture specifically relies x86 virtualization guarantee task-specific mandatory access control mac policies executed whenever micro-vm attempts access key windows services since micro-vms hardware-isolated protected os trusted untrusted tasks coexist single system mutual isolation microvisor β attack surface extremely narrow making exploits prohibitively expensive execute report nss labs details penetration testing bromium architecture achieved perfect score defeating malware expert human attempts penetration vsentry 1.0 available windows 7. vsentry requires intel processor vt-x ept vsentry 2.0 became available june 2013 offers protection users exchanging documents bromium live attack visualization analysis lava released 2014 provided ability collect attack data detected within micro-vm analysis supported structured threat information expression stix emerging xml standard threat information time vsentry 3.0 became available dec 2015 included support behavioral analysis executable code | [
755,
5571,
7570,
5401,
3756
] | Test |
1,218 | 4 | Robert_C._Seacord:robert c. seacord robert c. seacord born june 5 1963 american computer security specialist writer author books computer security legacy system modernization component-based software engineering seacord earned bachelor degree computer science rensselaer polytechnic institute december 1983 also completed graduate-level courses carnegie-mellon university software design creation maintenance user interfaces software project management formal methods human factors operating systems entrepreneurship seacord began programming professionally ibm 1984 working processor development communications operating system software software engineering led secure coding initiative cert division β software engineering institute sei pittsburgh pennsylvania 1991 also worked x consortium cambridge massachusetts developed maintained code common desktop environment x window system returned sei 1996 working component-based software engineering seacord joined ncc group 2015 currently technical director seacord adjunct professor carnegie mellon school computer science information networking institute also part-time faculty member university pittsburgh.. seacord advisory board linux foundation technical expert iso/iec jtc1/sc22/wg14 international standardization working group c programming language | [
1736,
1805,
1435
] | Test |
1,219 | 0 | Solomon_Marcus:solomon marcus solomon marcus 1 march 1925 β 17 march 2016 romanian mathematician member mathematical section romanian academy full member since 2001 emeritus professor university bucharest faculty mathematics main research fields mathematical analysis mathematical computational linguistics computer science also published numerous papers various cultural topics poetics linguistics semiotics philosophy history science education born bacΔu romania sima alter marcus jewish family tailors early age live dictatorships war infringements free speech free thinking well anti-semitism age 16 17 started tutoring younger pupils order help family financially graduated ferdinand high school 1944 completed studies university bucharest faculty science department mathematics 1949 continued tutoring throughout college later recounted interview endure hunger years till age 20 wore hand-me-downs older brothers obtained phd mathematics 1956 thesis monotonic functions two variables written direction miron nicolescu appointed lecturer 1955 associate professor 1964 became professor 1966 emeritus 1991 marcus contributed following areas 1 mathematical analysis set theory measure integration theory topology 2 theoretical computer science 3 linguistics 4 poetics theory literature 5 semiotics 6 cultural anthropology 7 history philosophy science 8 education marcus published 50 books romanian english french german italian spanish russian greek hungarian czech serbo-croatian 400 research articles specialized journals almost european countries united states canada south america japan india new zealand among others cited thousand authors including mathematicians computer scientists linguists literary researchers semioticians anthropologists philosophers recognised one initiators mathematical linguistics mathematical poetics member editorial board tens international scientific journals covering domains interest marcus featured people ideas theoretical computer science human face computing collection papers english followed interviews brief autobiography published 2007 words languages everywhere book meetings solomon marcus spandugino publishing house bucharest romania 2010 1500 pages edited lavinia spandonide gheorghe pΔun marcus β 85th birthday includes recollections several hundred people large variety scientific cultural fields 25 countries also contains longer autobiography died cardiac infections bucharest short stay elias hospital bucharest | [
1314,
1243
] | Test |
1,220 | 1 | Event_store:event store event store type database optimized storage events conceptually event store events dossier policy stored idea behind dossier policy derived events events corresponding data real facts stored database instantiation objects derived events code instantiates objects memory event store database means objects instantiated stored database instead objects instantiated 'on fly memory code based events usage objects e.g shown user interface instantiated objects removed memory example event store concept database applied insurance policies pension dossiers policies dossiers instantiation object make dossier policy person partner employments etc derived instantiated memory based real world events crucial part event store database event double timeline enables event stores correct errors events entered event store database another crucial part event store database events stored allowed changed stored also erroneous events changed anymore way change better correct events instantiate new event new values using double timeline correcting event would new values original event event data corrected event different transaction date mechanism ensures reproducibility moment time even time period correction taken place also allows reproduce situations based erroneous events required one advantage event store concept handling effects back dated events events take effect previous events may even invalidate much easier regular databases handling backdated events correct previous erroneous events painful often results rolling back previous erroneous transactions objects rolling new correct transactions objects event store new event corresponding facts stored code redetermine transactions objects based new facts memory event store simplify code rolling back erroneous situations rolling new correct situations needed anymore disadvantage may code needs re-instantiate objects memory based events time service call received specific dossier policy | [
1768,
2054
] | Test |
1,221 | 3 | Darwin_Core_Archive:darwin core archive darwin core archive dwc-a biodiversity informatics data standard makes use darwin core terms produce single self-contained dataset species occurrence checklist sampling event material sample data essentially set text csv files simple descriptor meta.xml inform others files organized format defined darwin core text guidelines preferred format publishing data gbif network darwin core standard used mobilize vast majority specimen occurrence observational records within gbif network darwin core standard originally conceived facilitate discovery retrieval integration information modern biological specimens spatio-temporal occurrence supporting evidence housed collections physical digital darwin core today broader scope aims provide stable standard reference sharing information biological diversity glossary terms darwin core provides stable semantic definitions goal maximally reusable variety contexts means darwin core may still used way historically used may also serve basis building complex exchange formats still ensuring interoperability common set terms central idea archive data files logically arranged star-like manner one core data file surrounded number β extensions β extension record β extension file row β points record core file way zero many extension records exist single core record space-efficient method data transfer alternative including data within single table could otherwise contain many empty cells details recommended extensions found respective subsections extensively documented gbif registry catalogue available extensions sharing entire datasets instead using pageable web services like digir tapir allows much simpler efficient data transfer example retrieving 260,000 records via tapir takes nine hours issuing 1,300 http requests transfer 500 mb xml-formatted data exact dataset encoded dwc-a zipped becomes 3 mb file therefore gbif highly recommends compressing archive using zip gzip generating dwc-a archive requires stable identifiers core records extensions kind shared data therefore necessary sort local record identifiers good practice maintain β original data β identifiers stable time reused record deleted please provide globally unique identifiers instead local ones completed darwin core archive contain file containing metadata describing whole dataset ecological metadata language eml common format simple dublin core files used | [
6741
] | Test |
1,222 | 3 | Puyo_Puyo_(video_game):puyo puyo video game game released tokuma shoten day msx2 release name part famimaga disk series family computer disk system year msx2 fds versions sega released arcade version heavily expanded previous versions including one-player story mode two-player competitive mode main game puyo puyo played least one opponent computer human game three modes single puyo puyo double puyo puyo endless puyo puyo single mode player takes role arle nadja 16-year-old female spellcaster pleasure foiling dark prince plans dark prince wishes take world arle stands way arle must first however battle way 12 opponents facing dark prince exception rulue sent dark prince mostly want pull shenanigans rulue fell love dark prince arle beaten dark prince world saved return home main puyo games story mode consists playing puyo matches fixed sequence characters one three courses double mode two players play exactly fashion out-chaining one another player tries fill opponent grid since rules sending many garbage blocks made games short-lived matter many chains sent compile added rule offsetting puyo puyo 2 onwards lets players counter opponents attacks chains sending garbage blocks back result overflow endless mode player must continually match puyos get highest score mission mode player must complete 52 missions requiring puyos field eliminated using limited pieces english-translated version arcade original created released internationally replaces original voice work changes many characters names removes wings harpies called dark elves english version sega re-released puyo puyo mega drive december 18 1992 game gear march 19 1993 japan game gear port puyo puyo contains english version named puzlow kids version appears whenever game cartridge used north american european system pc-9801 port released compile pc-9801 march 19 1993 day game gear port released tokuma shoten re-released version puyo puyo family computer july 23 1993 added 2-player competitive mode banpresto released version super famicom title december 10 1993 port game boy developed winkysoft published banpresto released july 31 1994 original name nec released version puyo puyo pc engine cd-romΒ² april 22 1994 titled cri middleware released version puyo puyo fm towns december 1994 game ported amiga request amiga power magazine featured cover disk name super foul egg ported risc os acorn owain cole featured acorn user cover disk finally ported java late 1995 ported apple iigs bret victor branded puyo pop internationally first game saw release outside japan 1993 dr. robotnik mean bean machine north america europe mega drive/genesis well game gear master system europe brazil two years later released kirby avalanche kirby ghost trap europe super nes north america europe respectively mega drive version bestseller japan four months mega drive version re-released wii virtual console japan december 2 2006 arcade version released april 12 2011 two gameboy versions released first puyo puyo 1994 sequel pocket puyo puyo tsuu 1996 arcade vc release features online play | [
224,
5822,
2217
] | Test |
1,223 | 7 | Oracle_Exalogic:oracle exalogic exalogic computer appliance made oracle corporation commercially available since 2010 cluster x86-64-servers running oracle linux solaris preinstalled full trade mark oracle exalogic elastic cloud derived si prefix exa- -logic probably weblogic positioned vendor preconfigured clustered application server use cloud computing elastic computing abilities oracle corporation announced exalogic oracle openworld conference san francisco september 2010 company presented continuation oracle-engineered systems product-line started 2008 exadata preconfigured database cluster exalogic factory assembled 19-inch rack 42 rack units completed servers network equipment 4 configurations different prices depending fills rack weight full rack 1 ton 2000 lbs quarter rack weighs half much hardware component x2-2 appliance consisted group 1-unit intel xeon servers equipped two six-core 2.93 ghz processors two solid-state drives operating system swap space common storage area network set infiniband ethernet switches full rack contains 30 server nodes half rack 16 quarter rack 8 eighth rack 4 server node installed 96 gb ram four 10 gigabit ethernet interfaces double infiniband port storage area network configurations similar 40 tb raw space vendor specifications advertising content usually indicate total parameters 360 processor kernels 2.9 tb ram full rack x3-2 model announced 2012 newer processors memory since late 2013 x4-2 model commercially available yet processor cores four times large capacity solid-state drives two 64-bit operating systems run server nodes appliance oracle linux version 5.5 solaris 11 servers installed cluster configuration oracle weblogic server distributed memory cache oracle coherence run java applications machine choice hotspot jrockit management appliance available oracle enterprise manager toolset also pre-installed appliance transaction monitor tuxedo optionally supplied exalogic deployed university melbourne food drug administration fda united states amway hyundai motor group bank chile haier deutsche post dhl public authority minors affairs pama kuwait mark benioff founder salesforce.com presumes appliance principally lacks scalability end-user compared infrastructure supplied service notes exalogic approach actually rollback obsolete mainframe computer concept also commentators expressed concerns appropriateness placing word elastic name despite ability load balance obvious computing limits box limits transcended like true elastic environment criticism applies solutions designed private cloud computing particular applies emc corporation hewlett-packard products however computing environment collection servers since many exalogic machines combined limited single box capacity may considered merely building block | [
3764,
6878,
6270,
6184,
1185,
6279,
6015,
6281,
7368,
1105,
4427,
418,
1590,
2961,
7213,
7037,
5882,
971
] | Validation |
1,224 | 9 | Java_Business_Integration:java business integration java business integration jbi specification developed java community process jcp approach implementing service-oriented architecture soa jcp reference jsr 208 jbi 1.0 jsr 312 jbi 2.0 jsr 312 removed jcp balloting process 17 dec 2010 submitters without accepted jbi built web services model provides pluggable architecture container hosts service producer consumer components services connect container via binding components bc hosted inside container part service engine se services model used web services description language 2.0 central message delivery mechanism normalized message router nmr delivers normalized messages via one four message exchange patterns meps taken wsdl 2.0 handle functionality deals installation deployment monitoring lifecycle concerns amongst bcs ses java management extensions jmx used jbi defines standardized packaging bcs ses allowing components portable jbi implementation without modification jbi defines standard packaging composite applications applications composed service consumers providers individual service units deployable components groups service units gathered together service assembly service assembly includes metadata wiring service units together associating service providers consumers well wiring service units external services provides simple mechanism performing composite application assembly using services following open-source software jbi based esb implementations available following esbs certified jbi/jsr 208 tck open esb petals esb addition project glassfish open-source java ee application server comes jbi runtime open esb project java ee sdk also includes jbi runtime bpel orchestration engine oracle claims fusion middleware comes jbi implementation tibco activematrix service grid provides service container framework based jsr 208 sca specifications service component architecture allowing service containers java java ee .net bpel added needed composite applications common foundation open jbi components project java.net incubator project started foster community-based development jbi components conform java business integration specification jsr 208 | [
6224,
1760,
5631,
5874
] | Validation |
1,225 | 8 | In-kernel_web_server:in-kernel web server in-kernel web server unlimited http server runs kernel space equivalent also called accelerator | [
578,
5637,
6256,
3135,
900
] | Test |
1,226 | 9 | IBM_Intelligent_Printer_Data_Stream:ibm intelligent printer data stream intelligent printer data stream ipds infoprint solution company systems application architecture host-to-printer data stream advanced function presentation subsystems provides attachment-independent interface controlling managing points addressable apa printers allows presentation pages containing architecturally unlimited mixture different data types including text image graphics bar code object container used variety infoprint oem print servers drive points addressable apa page printers generally printers medium high end print speed volume spectrum ipds architecture allows spooled data print job management flow bidirectionally print server print driver printer controller examples print job management controls examples spooled data ipds data streams purely used carry print information data network transport layer typically tcp/ip sna supporting hardware lans channels network controllers ipds carries data instructions print server printer structured fields printer controller processes ipds commands returns acknowledgment back print server similar ppds ipds uses binary encoded commands parameters ipds compatible ppds | [
3209,
6752
] | Test |
1,227 | 2 | Linux_adoption:linux adoption linux adoption adoption linux computer operating systems os households nonprofit organizations businesses governments many factors resulted expanded use linux systems traditional desktop users well operators server systems including desire minimize software costs increase network security support open-source philosophical principles recent years several governments various levels enacted policies shifting state-owned computers linux proprietary software regimes august 2010 jeffrey hammond principal analyst forrester research declared linux crossed chasm mainstream adoption statement attested large number enterprises transitioned linux late-2000s recession company survey completed third quarter 2009 48 surveyed companies reported using open-source operating system linux foundation regularly releases publications regarding linux kernel linux os distributions related themes one publication linux adoption trends survey enterprise end users freely available upon registration traditionally term linux adoption refers adoption linux os made desktop computers original intended use adoption servers essentially form os adoption form personal computers still low relatively adoption android operating system high term linux adoption often overlooks operating system uses chrome os also use linux kernel almost nothing else common even name β linux β usually applied android popular variant β fact popular operating system world outside traditional web services linux powers many biggest internet properties e.g. google amazon facebook ebay twitter yahoo linux used desktop computers servers supercomputers well wide range devices linux desktop distributions usually distributed retail sale sales numbers indicate number users one downloaded file may used create many cds cd may used install operating system multiple computers hand file might used test installation erased soon due factors estimates current linux desktop often rely webpage hits computers identifying running linux use statistics criticized unreliable underestimating linux use using webpage hits measure 2008 linux accounted 1 desktop market share microsoft windows operating systems held 90 might linux seen time direct replacement windows w3counter estimated linux web browser market share 4.63 android versions 6 5 4 combined based linux kernel estimated 33.77 linux counter uses alternate method estimating adoption asking users register using mathematical model estimate total number desktop users november 2014 method estimated 73 million linux users september 2014 pornhub released usage statistics website reported 1.7 linux users unity game engine gathers user statistics showed march 2016 0.4 linux users similarly steam client tracks usage reported may 2015 around 1 linux users april 2009 aaron seigo kde indicated web-page counter methods produce linux adoption numbers far low given system extensive penetration non-north american markets especially china stated north american-based web-measurement methods produce high windows numbers ignore widespread use linux parts world estimating true worldwide desktop adoption accounting windows-distorted environment usa canada indicated least 8 world desktops run linux distributions possibly high 10β12 numbers rising quickly commentators echoed belief noting competitors expending lot effort discredit linux incongruent tiny market share may 2009 preston gralla contributing editor computerworld.com reacting net applications web hit numbers showing linux use 1 said linux never become important desktop notebook operating system reasoned upsurge linux desktop use recently seen due linux netbooks trend saw already diminishing would eroded windows 7 became available indeed linux netbooks fall wayside though whether solely responsible upsurge linux usage open question concluded desktop operating system linux n't important enough think servers top-notch likely wo n't use desktop β even though finally manage crack 1 barrier 18 years 2009 microsoft then-ceo steve ballmer indicated linux greater desktop market share mac stating recent years linux certainly increased share somewhat third dell netbook sales 2009 linux installed caitlyn martin researching retail market numbers summer 2010 also concluded traditional numbers mentioned linux desktop adoption far low reasons change operating systems linux include better system stability better malware protection low cost distributions come complete application software hardware drivers simplified updates installed software free software licensing availability application repositories access source code linux desktop distributions also offer multiple desktop workspaces greater customization free unlimited support forums operating system n't slow time environmental reasons also cited linux operating systems usually come boxes retail packaging downloaded via internet lower system specifications also mean older hardware kept use instead recycled discarded linux distributions also get security vulnerabilities patched much quickly non-free operating systems improvements linux occurring faster rate windows report economist december 2007 said investments made improve desktop linux usability since 2007 report indian bulk computer purchaser electronics corporation tamil nadu elcot started recommending linux june 2008 following testing stated elcot using suse linux ubuntu linux operating systems desktop laptop computers numbering 2,000 past two years found far superior compared operating systems notably microsoft operating system many developing nations china due widespread software piracy microsoft windows easily obtained free linux distributions gaining high level adoption hence countries essentially cost barrier obtaining proprietary operating systems users adopting linux based merit rather price january 2001 microsoft then-ceo bill gates explained attraction adopting linux internal memo released comes vs microsoft case said greatest barrier linux desktop adoption probably desktop pcs come factory a.y siu asserted 2006 people use windows simply pcs come windows pre-installed n't choose linux much lower market penetration cases users install task beyond capabilities many pc users users β even use windows restore cds let alone install windows scratch would install unfamiliar operating system computers techrepublic writer jack wallen expands barrier saying august 2008 linus torvalds stated june 2012 interaction students aalto university although linux originally conceived desktop system market flourished suggested key reason keeps linux getting substantial presence desktop market average desktop user want install operating system getting manufacturers sell computers linux pre-installed would missing piece fulfill vision linux desktop market added chromebooks shipping linux-based chrome os could provide key turning point transition much like android allowed linux spread mobile space september 2012 gnome developer michael meeks also indicated main reason lack adoption linux desktops lack manufacturers shipping computers pre-installed supporting siu arguments six years earlier meeks also indicated users would n't embrace desktop linux wider range applications developers wo n't create wider range applications users classic catch-22 situation opensuse survey conducted 2007 69.5 respondents said dual booted microsoft windows operating system addition linux operating system early 2007 bill whyman analyst precursor advisors noted still n't compelling alternative microsoft infrastructure desktop application support quality peripheral support end user support one time seen biggest obstacles desktop linux adoption according 2006 survey linux foundation factors seen major obstacle 56 49 33 respondents respectively time november 2006 desktop linux client survey identified foremost barrier deploying linux desktops users accustomed windows applications ported linux ca n't live without included microsoft office adobe photoshop autodesk autocad microsoft project visio intuit quickbooks creates chicken egg situation developers make programs windows due market share consumers use windows due availability said programs desktoplinux.com survey conducted 2007 72 respondents said used ways run windows applications linux 51 respondents 2006 linux foundation survey believed cross-distribution linux desktop standards top priority linux desktop community highlighting fact fragmented linux market preventing application vendors developing distributing supporting operating system may 2008 gartner predicted version control incompatibilities continue plague open-source oss associated middleware 2013 timeframe 2008 design linux applications porting windows apple applications progressed point difficult find application equivalent linux providing adequate better capabilities example application progress seen comparing main productivity suite linux openoffice.org microsoft office release openoffice.org 3.0 october 2008 ars technica assessed two past availability quality open source device drivers issues linux desktops particular areas lacking drivers included printers well wireless audio cards example early 2007 dell sell specific hardware software ubuntu 7.04 computers including printers projectors bluetooth keyboards mice tv tuners remote controls desktop modems blu-ray disc drives due incompatibilities time well legal issues 2008 linux hardware support driver issues adequately addressed september 2008 jack wallen assessment critics stated compared windows linux lacking end-user support linux traditionally seen requiring much technical expertise dell website described open source software requiring intermediate advanced knowledge use september 2007 founder ubuntu project mark shuttleworth commented would reasonable say ready mass market october 2004 chief technical officer adeptiva linux stephan february noted time linux technical software product people outside technical community able support consumers windows users able rely friends family help linux users generally use discussion boards uncomfortable consumers 2005 dominic humphries summarized difference user tech support recently critics found linux user support model using community-based forum support greatly improved 2008 jack wallen stated addressing question user support manu cornet said linux credibility also attack times ron miller linuxplanet points continuing debate total cost ownership linux gartner warning 2005 costs migration may exceed cost benefits linux gartner reiterated warning 2008 predicting 2013 majority linux deployments real software total cost ownership tco advantage operating systems however comes v. microsoft lawsuit plaintiff exhibit 2817 revealed microsoft successfully lobbied gartner changing tco model favour microsoft 1998 organizations moved linux disagreed warnings sterling ball ceo ernie ball world leading maker premium guitar strings 2003 linux adopter said total cost ownership arguments think propaganda ... cost dealing virus n't 'em ... doubt 'm cheaper operate analyst guys say whatever want sco-linux controversies sco group alleged unix source code donated ibm illegally incorporated linux threat sco might able legally assert ownership linux initially caused potential linux adopters delay move court cases bankrupted sco 2007 lost four-year court battle ownership unix copyrights sco case hinged showing linux included intellectual property misappropriated unix case failed court discovered novell sco rightful owner copyrights legal process revealed sco claims linux fraudulent sco internal source code audits showed evidence infringement rival operating system vendor green hills software called open source paradigm linux fundamentally insecure us army agree linux security problem brigadier general nick justice deputy program officer army program executive office command control communications tactical peo c3t said april 2007 2008 gartner analysts predicted mobile devices like netbooks linux could potentially break dominance microsoft windows operating system provider netbook concept focuses os-agnostic applications built web applications browsing 2008 netbook market dominated linux-powered devices changed 2009 windows xp became available option one reasons given many customers returned linux-based netbooks still expecting windows-like environment despite netbook vision web-surfing web-application device 2011 google introduced chromebook web thin client running linux-based chrome os ability use web applications remote desktop computers running windows mac os x traditional linux distribution chrome os using chrome remote desktop 2012 google samsung introduced first version chromebox small-form-factor desktop equivalent chromebook 2013 chromebooks captured 20β25 sub- 300 us laptop market note term mobile devices computing context refers cellphones tablets term include regular laptops despite fact always designed mobile android based linux open source popular mobile platform second quarter 2013 79.3 smartphones sold worldwide running android android tablets also available firefox os another open source linux-based mobile operating system discontinued nokia previously produced phones running variant linux e.g nokia n900 2013 nokia handset division bought microsoft smartphones gradually replacing kinds embedded devices still exist example portable media players oem firmware linux based community-driven fully free open-source project rockbox in-vehicle infotainment hardware usually involves kind display either built dashboard additional displays genivi alliance works linux-based open platform run ivi may interface values delivered engine control unit albeit completely separate system special variant tizen ivi different tizen smartphones several regards linux often used various single- multi-purpose computer appliances embedded systems customer-premises equipment group devices embedded graphical user interface common sense remotely operated via secure shell via web-based user interface running lightweight web server software oem firmware based linux kernel free open-source software e.g das u-boot busybox also couple community driven projects e.g openwrt smaller scale embedded network-attached storage-devices also mostly linux-driven linux became popular internet server market particularly due lamp software bundle september 2008 steve ballmer microsoft ceo claimed 60 servers run linux 40 run windows server according idc report covering q2 2013 linux 23.2 worldwide server revenue although compensate potential price disparity linux non-linux servers may 2014 w3techs estimated 67.5 top 10 million according alexa websites run form unix linux used least 57.2 websites use unix linux-based solution stacks come general advantages benefits free open-source software commonly known examples according netcraft apache http server highest market share various freely available implementations ldap servers additionally univention corporate server integrated management system based debian supports functions provided microsoft active directory administration computers running microsoft windows free routing software available linux includes bird b.a.t.m.a.n. quagga xorp whether customer-premises equipment personal computer hardware server-hardware mainline linux kernel adapted highly optimized linux kernel capable routing rates limited hardware bus throughput linux popular operating system among supercomputers due general advantages benefits free open-source software like superior performance flexibility speed lower costs november 2008 linux held 87.8 percent share world top 500 supercomputers june 2016 operating systems used world top 500 supercomputers january 2010 weiwu hu chief architect loongson family cpus institute computing technology part chinese academy sciences confirmed new dawning 6000 supercomputer use chinese-made loongson processors run linux operating system recent supercomputer organization built dawning 5000a first run 2008 used amd chips ran windows hpc server 2008 many organizations advocate linux adoption foremost linux foundation hosts sponsors key kernel developers manages linux trademark manages open source developer travel fund provides legal aid open source developers companies linux legal defense fund sponsors kernel.org also hosts patent commons project international free open source software foundation ifossf nonprofit organization based michigan usa dedicated accelerating promoting adoption foss worldwide research civil society partnership networks open invention network formed protect vendors customers patent royalty fees using oss advocates linux include gartner claimed linux-powered personal computers accounted 4 unit sales 2008 however common users install linux addition dual boot arrangement place factory-installed microsoft windows operating system | [
1807,
3256,
2182,
3938,
3613,
6422,
7528,
3271,
6092,
7532,
2559,
1100,
5744,
6443,
740,
2942,
7555,
6117,
4341,
5762,
412,
415,
2240,
1128,
768,
7214,
3666,
2970,
6865,
7956,
5453,
5803,
4759,
5460,
7242,
462,
1535,
1924,
6892,
4400,
1... | Test |
1,228 | 4 | Tapestry_Technologies:tapestry technologies tapestry technologies small privately owned systems integration defense contractor based chambersburg pennsylvania company provides professional services united states department defense united states navy u.s. army information technology agency areas cybersecurity network systems engineering training support tapestry technologies founded 2005 jacquie sipes jim govekar cindy whitmer sipes serving company β ceo since inception company focused performing defense contract work category woman-owned small business recognized fortune magazine one top 20 great workplaces technology 2014 listed inc. 5000 one fastest growing private companies united states start 2015 tapestry 10 million revenue three-year sales growth 217 may 2015 company 73 employees occupying 20,000 square feet office space since october 2013 tapestry technologies served prime contractor gsa schedule 70 contract gs-35f-007ba company also performed work sub-contractor encore ii veterans administration transformation twenty-one total technology va-t4 gsm-eti contract vehicles tapestry centers business niche market within defense information systems agency providing information assurance cyber security services including certification accreditation security readiness reviews ssr security technical implementation guides stig technical training company main areas expertise cyber defense cyber training cyber integration help desk services areas expertise tapestry performed work various government task orders including writing β security policy consolidated email system used 4.6 million dod users clients β | [
5568
] | Test |
1,229 | 7 | Mailchimp:mailchimp mailchimp capitalized mailchimp 2018 marketing automation platform email marketing service platform trading name operator rocket science group american company founded 2001 ben chestnut mark armstrong dan kurzius joining later date mailchimp began paid service added freemium option 2009 within year user base grown 85,000 450,000 june 2014 sending 10 billion emails per month behalf users 2017 company gaining 14,000 new customers every day company still owned co-founders never accepted venture capital funds 2016 mailchimp ranked 7 forbes cloud 100 list february 2017 company named one fast company innovative companies 2017 august 2017 reported mailchimp would opening offices brooklyn oakland california february 2019 mailchimp acquired lemonstand smaller competitor later 2019 company announced annual revenue would reach 700 million mailchimp going become full marketing platform aimed smaller organizations may 2019 new users charged per contact opposed subscribed contacts new users paying unsubscribed contacts yet confirmed podcast advertiser mailchimp also sponsored launch serial podcast exploring murder case multiple episodes series parodies serial targeted several show aspects including podcast sponsor especially meme mailkimp february 2016 mailchimp announced merging mandrill transactional email service mailchimp add-on feature gave customers 60 days notice switch new pricing structure find alternative service platform announcement met widespread criticism customer outrage due new pricing structure requiring paid mailchimp plan able purchase mandrill credits resulting customers paying two products order access mandrill previously customers able purchase mandrill credits sending emails without signing mailchimp credits originally priced 9.95 25,000 emails increased 20 number emails new pricing scheme addition needing purchase mandrill credits customers need paid mailchimp monthly plan minimum monthly plan 10 month even customer need mailchimp services wants access mandrill mandrill renamed mailchimp transactional | [
670,
2964,
4067
] | Test |
1,230 | 1 | Diplomatic_Documents_of_Switzerland:diplomatic documents switzerland diplomatic documents switzerland dodis research project edits important documents swiss foreign relations contemporary history project includes book series several volumes online database dodis contrast editions foreign policy dodis state-run project product academic research research group chooses documents published according independently defined criteria bound scientific principles choice published documents researchers aim show main features international relations switzerland maintaining diversity basic research done dodis provides historians primary sources allowing work specific aspects swiss foreign policy contextualise complex developments diplomatic documents switzerland enterprise swiss academy humanities social sciences sagw works auspices swiss society history ssh funding administration project taken academy january 2000 swiss national science foundation snf major financial contributor dodis furthermore project supported swiss federal archives sfa research centre located federal department foreign affairs fdfa research centre diplomatic documents switzerland managed director director accountable dodis-committee consists representatives contributing organisations professors history departments switzerland 1972 group historians took initiative publish documents study swiss foreign policy international relations switzerland fifteen volumes covering period 1848 1945 subsequently published 1979 1997 volume published different team researchers based swiss university project restructured mid 1990s course planning second series dodis online-database various changing research teams replaced permanent research centre assigned staff work second series dodis covering period 1945 1989 started 1997 time database dodis.ch went online dodis.ch integrative freely accessible internet database diplomatic documents switzerland dodis contains thousands documentes primarily sourced swiss federal archives related swiss foreign relations database also links meta-data regarding persons organisations important international swiss history sources thus critically contextualised research extended dodis documents well relevant archival holdings relational database works addition printed volumes aims illustrate detail various aspects swiss international relations thousands documents dodis.ch contrary volumes annotated indexed tagged according scientific criteria documents dodis.ch scans downloaded pdf format book series several volumes aims illustrate main features guidelines international relations switzerland documents printed volumes therefore primarily either show general orientation swiss foreign relations indicate certain time strongly influenced orientation 1979 1997 first series published fifteen volumes covering period 1848 1945 volumes later digitalised accessed swiss federal archives search engine publications officielles numΓ©risΓ©es uses full text search second series covering period 1945 1989 completed 2020 planned published fifteen volumes well recent volume vol 26 1973-75 published 2018 | [
6462
] | Validation |
1,231 | 9 | John_Launchbury:john launchbury john launchbury american british computer scientist currently chief scientist galois inc previously directed one darpa β technical offices oversaw nation-scale scientific engineering research cybersecurity data analysis artificial intelligence known research entrepreneurship implementation application functional programming languages 2010 launchbury inducted fellow association computing machinery launchbury received first-class honors mathematics oxford university 1985 m.sc computation 1986 holds ph.d. computing science university glasgow 1991 cambridge university press published thesis projection factorizations partial evaluation british computer society distinguished dissertation prize lecturer university glasgow launchbury focused early research semantics analysis lazy functional languages one contributing designers haskell programming language apple developers later cited one influences behind swift programming language 1993 launchbury provided formal description lazy evaluation addressing challenges analyzing program β storage requirements operational semantics widely cited later research haskell context glasgow haskell compiler team launchbury established effective partnership simon l. peyton jones write number papers dramatically influenced design haskell 1995 paper state haskell introduced β io monad β mathematically-clean practical way expressing effects external world solidified β β launchbury introduced earlier papers unboxed values removal intermediate data structures addressed many efficiency challenges inherent lazy evaluation 1994 launchbury relocated west coast united states becoming full professor oregon graduate institute 2000 research addressed creation optimization domain-specific programming languages dsls ranging fundamental research combining disparate semantic elements embedding dsls haskell applied research modeling reasoning very-large scale integration vlsi micro-architectures launchbury founded galois inc. 1999 address challenges information assurance application functional programming formal methods served company β ceo chief scientist 2000 2014 launchbury β direction galois inc. developed cryptol domain-specific language specifying verifying cryptographic implementations originally designed use national security agency language made available public 2008 launchbury holder two patents cryptographic structures data storage one effective mechanisms configuring programmable cryptographic components 2014 launchbury joined darpa initially program manager director information innovation office i2o 2015 launchbury led programs homomorphic cryptography proceed cybersecurity vehicles embedded systems hacms data privacy brandeis 2017 launchbury rejoined galois chief scientist launchbury published theological perspective moral exemplar interpretation doctrine atonement entitled change us god biblical meditations death jesus | [
3852,
1998,
2740,
4573,
1243,
5091,
7554,
1805
] | Test |
1,232 | 2 | DirectX_Video_Acceleration:directx video acceleration directx video acceleration dxva microsoft api specification microsoft windows xbox 360 platforms allows video decoding hardware accelerated pipeline allows certain cpu-intensive operations idct motion compensation deinterlacing offloaded gpu dxva 2.0 allows operations including video capturing processing operations hardware accelerated well dxva works conjunction video rendering model used video card dxva 1.0 introduced standardized api windows 2000 currently available windows 98 later use either overlay rendering mode vmr 7/9 dxva 2.0 available windows vista windows 7 windows 8 later oss integrates media foundation mf uses enhanced video renderer evr present mf dxva used software video decoders define codec-specific pipeline hardware-accelerated decoding rendering codec pipeline starts cpu used parsing media stream conversion dxva-compatible structures dxva specifies set operations hardware accelerated device driver interfaces ddis graphic driver implement accelerate operations codec needs defined operations use interfaces access hardware-accelerated implementation operations graphic driver implement one interfaces codec provide software fallback decoded video handed hardware video renderer video post-processing might applied rendered device resulting pipeline usable directshow compatible application dxva specifies motion compensation ddi specifies interfaces idct operations huffman coding motion compensation alpha blending inverse quantization color space conversion frame-rate conversion operations among others also includes three sub-specifications deinterlacing ddi copp ddi procamp ddi deinterlacing ddi specifies callbacks deinterlacing operations copp certified output protection protocol ddi functions allow pipeline secured drm-protected media specifying encryption functions procamp ddi used accelerate post-processing video procamp driver module sits hardware video renderer display driver provides functions applying post-processing filters decompressed video functions exposed dxva ddis accessible directly directshow client supplied callback functions video renderer renderer plays important role anchoring pipeline dxva 2.0 enhances implementation video pipeline adds host ddis including capture ddi video capture ddis shares dxva 1.0 also enhanced ability use hardware acceleration operations also ddi functions directly available callers need mediated video renderer program also create pipeline simply decoding media without rendering post-processing rendering without decoding features require windows display driver model drivers limits dxva 2.0 windows vista windows server 2008 windows 7 windows server 2008 r2 windows 8 windows xp windows 2000 programs use dxva 1.0 dxva 2.0 allows enhanced video renderer video renderer vista windows 7 windows 8 windows xp dxva-rendering possible vmr9 well-known overlay mixer dxva integrates media foundation allows dxva pipelines exposed media foundation transforms mfts even decoder pipelines post-processing pipelines exposed mfts used media foundation topology loader create full media playback pipeline dxva 1.0 emulated using dxva 2.0 dxva 2.0 include copp ddi rather uses pvp protected content windows 7 implements dxva-hd driver complies wddm 1.1 dxva2 implementations come two variants native copy-back native implementation decoded video stays gpu memory displayed video decoder must connected video renderer intermediary processing filter video renderer must also support dxva gives less freedom choice renderers copy-back implementation decoded video copied gpu memory back cpu memory implementation n't limitations mentioned acts similarly normal software decoder however video stuttering occur gpu fast enough copy memory back cpu memory native mode advantageous unless need customized processing additional copy-back operations increase gpu memory load | [
7149,
3937,
3263,
6420,
714,
5371,
378,
2198,
720,
1460,
6096,
7176,
2566,
2928,
7907,
1475,
5747,
7553,
5410,
7564,
2953,
6840,
422,
6844,
2245,
1138,
435,
5442,
4017,
3340,
5090,
6504,
7602,
4022,
4026,
7607,
1526,
6164,
458,
3687,
47... | Test |
1,233 | 4 | CRM114_(program):crm114 program crm114 full name crm114 discriminator program based upon statistical approach classifying data especially used filtering email spam name comes crm-114 discriminator stanley kubrick movie piece radio equipment designed filter messages lacking specific code-prefix others done statistical bayesian spam filtering based upon frequency single word occurrences email crm114 achieves higher rate spam recognition creating hits based upon phrases five words length phrases used form markov random field representing incoming texts additional contextual recognition one accurate spam filters available initial testing 2002 author bill yerazunis gave 99.87 accuracy holden trec 2005 2006. gave results better 99 significant variation depending particular corpus crm114 classifier also switched use littlestone winnow algorithm character-by-character correlation variant knn k-nearest neighbor algorithm classification called hyperspace bit-entropic classifier uses entropy encoding determine similarity svm mutual compressibility calculated modified lz77 algorithm experimental classifiers actual features matched based generalization skip-grams crm114 algorithms multi-lingual compatible utf-8 encodings null-safe voting set crm114 classifiers demonstrated detect confidential versus non-confidential documents written japanese better 99.9 detection rate 5.3 false alarm rate crm114 good example pattern recognition software demonstrating machine learning accomplished reasonably simple algorithm program c source code available gpl deeper level crm114 also string pattern matching language similar grep even perl although turing complete highly tuned matching text even simple recursive definition factorial takes almost ten lines part crm114 language syntax positional declensional programming language may used many applications aside detecting spam crm114 uses tre approximate-match regex engine possible write programs depend absolutely identical strings matching function correctly crm114 applied number applications including detection bots twitter yahoo well first-level filter us dept transportation vehicle defect detection system also used predictive method classifying fault-prone software modules | [
3683,
5983,
2366,
2905,
4734,
6102,
7360,
3017,
715
] | Validation |
1,234 | 2 | IPhone_XS:iphone xs iphone xs iphone xs max stylized marketed iphone iphone max roman numeral x pronounced ten smartphones designed developed marketed apple inc twelfth-generation flagships iphone succeeding iphone x announced september 12 2018 alongside lower-priced iphone xr steve jobs theater apple park cupertino apple ceo tim cook pre-orders beginning september 14 2018 official release september 21 2018 iphone xs max first plus-sized iphone new bezel-less form factor 2017 iphone x larger variant upon release xs xs max iphone x discontinued meaning shelf life 10 months shortest ever tenure flagship device history iphone release xs xs max starting prices 999/ 1099 us Β£999/Β£1099 uk β¬1149/β¬1249 europe rmb8699/rmb9599 china βΉ99900/βΉ109900 india xs design visually near-identical x includes upgraded hardware featuring a12 bionic chip built 7 nanometer process also features 5.85-inch 149 mm oled display contains dual 12-megapixel rear cameras one 7-megapixel front-facing camera xs max features hardware cameras larger 6.46-inch 164 mm oled display battery 3,174mah also noted media xs received smaller battery x dropping 2,658 mah 2,716 mah xs battery new single-cell l-shaped battery iphone xs max battery remains two cells like iphone x. additionally apple states iphone xs lasts 30 minutes longer iphone x iphone xs max lasts 1.5 hours longer iphone x. apple claims devices faster face id technology also announced june 2019 wwdc face id iphone xs iphone xs max iphone xr iphone x would 30 faster ios 13 set arrive fall xs xs max rated ip68 dust water resistance iec standard 60529 apple specifying maximum depth 2 meters 30 minutes submersion water improvement ip67 water resistance iphone 8 x. apple performed tests various liquids including chlorinated water salt water tea wine beer juices unlike xr iphone xs devices optical zoom xs xs max support dual sims nano-sim esim mainland china hong kong macau however xs max comes dual nano-sim tray esim xs dual nano-sim tray esim functionality enabled use hong kong macau mainland china wireless charging coil made copper reduce charging time power loss iphones starting iphone 6s iphone 6s plus iphone se iphone 7 iphone 7 plus iphone 8 iphone 8 plus iphone x main camera 12mp 1/2.94 sensor size 1.22 ΞΌm pixel size starting iphone 2018 series xs xs max xr iphones updated 12mp 1/2.55 sensor size 1.4 ΞΌm pixel size sensor pixel size primary cameras samsung galaxy s10 samsung galaxy s9 samsung galaxy s8 samsung galaxy s7 pixel 2 pixel 3a pixel 3a xl pixel 3 pixel 3 xl moto x4 users reported problems charging iphone xs xs max lightning cable device failed charge would begin charge screen turned would occur due software bug apple β β disable usb accessories locked β setting feature intended prevent unknown devices accessing user content within iphone press dubbed issue chargegate issue resolved release ios 12.0.1 october 8 2018 customers also reported seeing unrealistic smoothness skin taking selfie automatic filter observers noted face-smoothing effect likely unintentionally caused new smart hdr camera feature xs xs max technology combines multiple photos varying exposures increase dynamic range iphones photos also lead less pronounced facial imperfections decreased highlights selfies speculated result hidden β beauty mode β actual feature smartphones dubbed issue β beautygate. β general dispute community whether camera actually intends perfect faces appear way result better quality camera apple said results due smart hdr algorithm incorrectly selecting blurrier long exposure base frame instead sharpest short exposure issue resolved software release ios 12.1 october 30 2018 iphone xs users issues lte wi-fi reception bluetooth connection radio expert claims faulty antenna blame apple contacted users help investigation ios 12.0.1 addresses issue bluetooth could become unavailable | [
6788,
3940,
7890,
5732,
722,
1094,
4320,
2926,
4690,
5037,
734,
740,
5752,
405,
6125,
2954,
1123,
7572,
6482,
768,
6847,
6142,
2609,
1895,
4373,
7226,
4376,
2978,
5091,
4749,
5450,
7601,
3346,
6874,
6165,
4389,
5463,
102,
5469,
4768,
30... | Test |
1,235 | 8 | Behavioral_retargeting:behavioral retargeting behavioral retargeting also known behavioral remarketing simply retargeting form online targeted advertising online advertising targeted consumers based previous internet actions retargeting tags online users including pixel within target webpage email sets cookie user browser cookie set advertiser able show display ads user elsewhere internet via ad exchange dynamic creative also known personalized retargeting allows advertiser display banner created on-the-fly particular consumer based specific pages viewed example consumer visits advertiser website browses products b c β retargeted display banner featuring exact products b c previously viewed typically restricted visitor browsing single website refined version improves re-engagement customers customer begins online order example fails complete flag indicates interest product ordered later ads showing product interest custom-linked point back order system user clicks ad returned incomplete order implementation requires order system support deep linking retargeting services retargeting depends setting cookies user browser several different methods retargeting ad campaigns usually run lower cost media display ads increases effectiveness specifically targeting interested audience also improves overall roi advertiser common use-case retargeting situations website visitor actions result sale conversion retargeting providers employ variety pricing models charge advertisers ads viewed consumers three prominent models include cost per impression cpm common metric used online advertising industry charge advertisers inventory based set price per thousand page impressions impression defined time banner ad loads individual β web browser pay per click ppc charges advertisers every verifiable click leads consumers back retailer β website unlike cpm model charges advertisers flat rate advertisers working ppc model charged person clicks ad cost per action cpa pricing model advertisers charged based pre-arranged action purchase view etc although completed sale common action used cpa model united states several organizations including federal trade commission congress media expressed privacy concerns around practice retargeting however responsible personalized retargeting providers β collect personally identifiable information pii consumers providers blind user β age sex personal information instead providers rely upon data gathered cookies placed consumer β browser websites visit information shared among publishers advertisers third parties linked specific user united states legislated many laws around practice instead relies upon industry overarching organizations interactive advertising bureau network advertising initiative truste self-regulate october 2010 iab announced advertising option icon partner sites place near banner advertisements collect non-pii user data eu 2002 eprivacy directive 2009 revision require opt-in consent use cookies stipulate users must given option opting | [
1355
] | Test |
1,236 | 2 | Year_2038_problem:year 2038 problem year 2038 problem relates representing time many digital systems number seconds passed since 1 january 1970 storing signed 32-bit binary integer implementations encode times 03:14:07 utc 19 january 2038 like y2k problem year 2038 problem caused insufficient capacity chosen storage unit latest time represented unix signed 32-bit integer time format 2-1 2,147,483,647 seconds 1 january 1970 times beyond wrap around stored internally negative number systems interpret occurred 13 december 1901 rather 19 january 2038 caused integer overflow counter runs usable digit bits flips sign bit instead reports maximally negative number continues count zero positive integers resulting erroneous calculations systems likely cause problems users reliant parties programs work future dates begin run problems sooner example program works dates 20 years future fixed later 19 january 2018 may 2006 reports surfaced early manifestation y2038 problem aolserver software software designed kludge handle database request never time rather specifically handling special case initial design simply specified arbitrary time-out date future default configuration server specified request time one billion seconds one billion seconds approximately 32 years 01:27:28 utc 13 may 2006 beyond 2038 cutoff date thus time time-out calculation overflowed returned date actually past causing software crash problem discovered aolserver operators edit configuration file set time-out lower value players games apps programmed impose waiting periods running problem attempt work around waiting period devices harbor coding manually setting devices date past 19 january 2038 unable since 32-bit unix time format used embedded systems use dates either computation diagnostic logging likely affected 2038 bug many transportation systems flight automobiles use embedded systems extensively automotive systems may include anti-lock braking system abs electronic stability control esc/esp traction control tcs automatic four-wheel drive aircraft may use inertial guidance systems gps receivers however imply systems suffer bug since many systems require access dates systems track difference times/dates absolute times/dates nature calculation experience major problem case automotive diagnostics based legislative standards carb california air resources board another major use embedded systems communications devices including cell phones internet appliances routers wireless access points etc rely storing accurate time date increasingly based unix-like operating systems example bug makes devices running 32-bit android crash restart time changed date despite modern 18β24 month generational update computer systems technology embedded systems designed last lifetime machine component conceivable systems may still use 2038 may impractical cases impossible upgrade software running systems ultimately requiring replacement 32-bit codice_1 limitations corrected mysql database built-in functions like codice_2 return 0 03:14:07 utc 19 january 2038 many data structures use today 32-bit time representations embedded structure full list data structures virtually impossible derive well-known data structures unix time problem examples systems using data structures may contain 32-bit time representations include system making use data structures containing 32-bit time representations present risk degree risk dependent mode failure network time protocol ntp related overflow issue manifests 2036 rather 2038 64-bit timestamps used ntp consist 32-bit part seconds 32-bit part fractional second giving ntp time scale rolls every 2 seconds 136 years theoretical resolution 2 seconds 233 picoseconds ntp uses epoch 1 january 1900 first rollover occurs 2036 prior unix year 2038 problem implementations disambiguate ntp time using knowledge approximate time sources since ntp works differences timestamps never absolute values wraparound invisible calculations long timestamps within 68 years however wraparound clients still face two problems means ntp rollover invisible running systems since correct time within small tolerance however systems starting need know date within 68 years given large allowed error expected onerous requirement one suggested method set clock earlier system build date release date current version ntp software many systems use battery-powered hardware clock avoid problem even future versions ntp may extend time representation 128 bits 64 bits second 64 bits fractional-second current ntp4 format support era number era offset used properly aid fixing date rollover issues according mills 64 bit value fraction enough resolve amount time takes photon pass electron speed light 64 bit second value enough provide unambiguous time representation universe goes dim universal solution year 2038 problem change definition codice_1 data type would result code compatibility problems application date time representations dependent nature signed 32-bit codice_1 integer example changing codice_1 unsigned 32-bit integer would extend range 2106 specifically 06:28:15 utc sunday 7 february 2106 would adversely affect programs store retrieve manipulate dates prior 1970 dates represented negative numbers increasing size codice_1 type 64-bit existing system would cause incompatible changes layout structures binary interface functions also universal solution issue dvb atsc real-time transmitted dates due issues legacy receivers issue yet acknowledged resolved either organization workaround would discontinue time-related metadata services programming guides automatic date synchronization affected dates one possible option would create new table types affected part specifications use iso 8601 date strings rather fixed integersβas used iso 9660 iso 13346 filesystems operating systems designed run 64-bit hardware already use signed 64-bit codice_1 integers using signed 64-bit value introduces new wraparound date twenty times greater estimated age universe approximately 292 billion years 15:30:08 utc sunday 4 december 292,277,026,596 ability make computations dates limited fact codice_9 uses signed 32 bit integer value starting 1900 year limits year maximum 2,147,485,547 2,147,483,647 1900 freebsd uses 64-bit codice_1 32-bit 64-bit architectures except 32-bit i386 uses unsigned 32-bit codice_1 instead starting netbsd version 6.0 released october 2012 netbsd operating system uses 64-bit codice_1 32-bit 64-bit architectures applications compiled older netbsd release 32-bit codice_1 supported via binary compatibility layer older applications still suffer year 2038 problem openbsd since version 5.5 released may 2014 also uses 64-bit codice_1 32-bit 64-bit architectures contrast netbsd binary compatibility layer therefore applications expecting 32-bit codice_1 applications using anything different codice_1 store time values may break linux uses 64-bit codice_1 64-bit architectures pure 32-bit abi changed due backward compatibility ongoing work mostly embedded linux systems support 64-bit codice_1 32-bit architectures x32 abi linux defines environment programs 32-bit addresses running processor 64-bit mode uses 64-bit codice_1 since new environment need special compatibility precautions network file system version 4 defined time fields codice_20 since december 2000 values greater zero seconds field denote dates 0-hour january 1 1970 values less zero seconds field denote dates 0-hour january 1 1970 cases nseconds nanoseconds field added seconds field final time representation alternative proposals made use storing either milliseconds microseconds since epoch typically either 1 january 1970 1 january 2000 signed 64-bit integer providing minimum range 300,000 years microsecond resolution proposals new time representations provide different precisions ranges sizes almost always wider 32 bits well solving related problems handling leap seconds particular tai64 implementation temps atomique international standard current international real-time standard defining second frame reference | [
1339,
5983,
6249,
4662,
5373,
4942,
5397,
578,
1198,
7096,
3557,
2589,
6658,
1592,
4990,
1686,
5606,
7217,
5783,
869,
1989,
174,
5190
] | Validation |
1,237 | 3 | Central_processing_unit:central processing unit central processing unit cpu also called central processor main processor electronic circuitry within computer carries instructions computer program performing basic arithmetic logic controlling input/output i/o operations specified instructions computer industry used term central processing unit least since early 1960s traditionally term cpu refers processor specifically processing unit control unit cu distinguishing core elements computer external components main memory i/o circuitry form design implementation cpus changed course history fundamental operation remains almost unchanged principal components cpu include arithmetic logic unit alu performs arithmetic logic operations processor registers supply operands alu store results alu operations control unit orchestrates fetching memory execution instructions directing coordinated operations alu registers components modern cpus microprocessors cpu contained single metal-oxide-semiconductor mos integrated circuit ic chip ic contains cpu may also contain memory peripheral interfaces components computer integrated devices variously called microcontrollers systems chip soc computers employ multi-core processor single chip containing two cpus called cores context one speak single chips sockets array processors vector processors multiple processors operate parallel unit considered central also exists concept virtual cpus abstraction dynamical aggregated computational resources early computers eniac physically rewired perform different tasks caused machines called fixed-program computers since term cpu generally defined device software computer program execution earliest devices could rightly called cpus came advent stored-program computer idea stored-program computer already present design j. presper eckert john william mauchly eniac initially omitted could finished sooner june 30 1945 eniac made mathematician john von neumann distributed paper entitled first draft report edvac outline stored-program computer would eventually completed august 1949 edvac designed perform certain number instructions operations various types significantly programs written edvac stored high-speed computer memory rather specified physical wiring computer overcame severe limitation eniac considerable time effort required reconfigure computer perform new task von neumann design program edvac ran could changed simply changing contents memory edvac however first stored-program computer manchester baby small-scale experimental stored-program computer ran first program 21 june 1948 manchester mark 1 ran first program night 16β17 june 1949 early cpus custom designs used part larger sometimes distinctive computer however method designing custom cpus particular application largely given way development multi-purpose processors produced large quantities standardization began era discrete transistor mainframes minicomputers rapidly accelerated popularization integrated circuit ic ic allowed increasingly complex cpus designed manufactured tolerances order nanometers miniaturization standardization cpus increased presence digital devices modern life far beyond limited application dedicated computing machines modern microprocessors appear electronic devices ranging automobiles cellphones sometimes even toys von neumann often credited design stored-program computer design edvac design became known von neumann architecture others konrad zuse suggested implemented similar ideas so-called harvard architecture harvard mark completed edvac also used stored-program design using punched paper tape rather electronic memory key difference von neumann harvard architectures latter separates storage treatment cpu instructions data former uses memory space modern cpus primarily von neumann design cpus harvard architecture seen well especially embedded applications instance atmel avr microcontrollers harvard architecture processors relays vacuum tubes thermionic tubes commonly used switching elements useful computer requires thousands tens thousands switching devices overall speed system dependent speed switches tube computers like edvac tended average eight hours failures whereas relay computers like slower earlier harvard mark failed rarely end tube-based cpus became dominant significant speed advantages afforded generally outweighed reliability problems early synchronous cpus ran low clock rates compared modern microelectronic designs clock signal frequencies ranging 100 khz 4 mhz common time limited largely speed switching devices built design complexity cpus increased various technologies facilitated building smaller reliable electronic devices first improvement came advent transistor transistorized cpus 1950s 1960s longer built bulky unreliable fragile switching elements like vacuum tubes relays improvement complex reliable cpus built onto one several printed circuit boards containing discrete individual components 1964 ibm introduced ibm system/360 computer architecture used series computers capable running programs different speed performance significant time electronic computers incompatible one another even made manufacturer facilitate improvement ibm used concept microprogram often called microcode still sees widespread usage modern cpus system/360 architecture popular dominated mainframe computer market decades left legacy still continued similar modern computers like ibm zseries 1965 digital equipment corporation dec introduced another influential computer aimed scientific research markets pdp-8 transistor-based computers several distinct advantages predecessors aside facilitating increased reliability lower power consumption transistors also allowed cpus operate much higher speeds short switching time transistor comparison tube relay increased reliability dramatically increased speed switching elements almost exclusively transistors time cpu clock rates tens megahertz easily obtained period additionally discrete transistor ic cpus heavy usage new high-performance designs like simd single instruction multiple data vector processors began appear early experimental designs later gave rise era specialized supercomputers like made cray inc fujitsu ltd. period method manufacturing many interconnected transistors compact space developed integrated circuit ic allowed large number transistors manufactured single semiconductor-based die chip first basic non-specialized digital circuits gates miniaturized ics cpus based building block ics generally referred small-scale integration ssi devices ssi ics ones used apollo guidance computer usually contained dozen transistors build entire cpu ssi ics required thousands individual chips still consumed much less space power earlier discrete transistor designs ibm system/370 follow-on system/360 used ssi ics rather solid logic technology discrete-transistor modules dec pdp-8/i ki10 pdp-10 also switched individual transistors used pdp-8 pdp-10 ssi ics extremely popular pdp-11 line originally built ssi ics eventually implemented lsi components became practical mosfet metal-oxide-semiconductor field-effect transistor also known mos transistor invented mohamed atalla dawon kahng bell labs 1959 demonstrated 1960 led development mos metal-oxide-semiconductor integrated circuit proposed kahng 1961 fabricated fred heiman steven hofstein rca 1962 high scalability much lower power consumption higher density bipolar junction transistors mosfet made possible build high-density integrated circuits lee boysel published influential articles including 1967 manifesto described build equivalent 32-bit mainframe computer relatively small number large-scale integration circuits lsi way build lsi chips chips hundred gates build using mos semiconductor manufacturing process either pmos logic nmos logic cmos logic however companies continued build processors bipolar transistorβtransistor logic ttl chips bipolar junction transistors faster mos chips 1970s companies datapoint continued build processors ttl chips early 1980s 1960s mos ics slower initially considered useful applications required low power following development silicon-gate mos technology federico faggin fairchild semiconductor 1968 mos ics largely replaced bipolar ttl standard chip technology early 1970s microelectronic technology advanced increasing number transistors placed ics decreasing number individual ics needed complete cpu msi lsi ics increased transistor counts hundreds thousands 1968 number ics required build complete cpu reduced 24 ics eight different types ic containing roughly 1000 mosfets stark contrast ssi msi predecessors first lsi implementation pdp-11 contained cpu composed four lsi integrated circuits advances mos ic technology led invention microprocessor early 1970s since introduction first commercially available microprocessor intel 4004 1971 first widely used microprocessor intel 8080 1974 class cpus almost completely overtaken central processing unit implementation methods mainframe minicomputer manufacturers time launched proprietary ic development programs upgrade older computer architectures eventually produced instruction set compatible microprocessors backward-compatible older hardware software combined advent eventual success ubiquitous personal computer term cpu applied almost exclusively microprocessors several cpus denoted cores combined single processing chip previous generations cpus implemented discrete components numerous small integrated circuits ics one circuit boards microprocessors hand cpus manufactured small number ics usually one overall smaller cpu size result implemented single die means faster switching time physical factors like decreased gate parasitic capacitance allowed synchronous microprocessors clock rates ranging tens megahertz several gigahertz additionally ability construct exceedingly small transistors ic increased complexity number transistors single cpu many fold widely observed trend described moore law proven fairly accurate predictor growth cpu ic complexity 2016 complexity size construction general form cpus changed enormously since 1950 basic design function changed much almost common cpus today accurately described von neumann stored-program machines moore law longer holds concerns arisen limits integrated circuit transistor technology extreme miniaturization electronic gates causing effects phenomena like electromigration subthreshold leakage become much significant newer concerns among many factors causing researchers investigate new methods computing quantum computer well expand usage parallelism methods extend usefulness classical von neumann model fundamental operation cpus regardless physical form take execute sequence stored instructions called program instructions executed kept kind computer memory nearly cpus follow fetch decode execute steps operation collectively known instruction cycle execution instruction entire process repeats next instruction cycle normally fetching next-in-sequence instruction incremented value program counter jump instruction executed program counter modified contain address instruction jumped program execution continues normally complex cpus multiple instructions fetched decoded executed simultaneously section describes generally referred classic risc pipeline quite common among simple cpus used many electronic devices often called microcontroller largely ignores important role cpu cache therefore access stage pipeline instructions manipulate program counter rather producing result data directly instructions generally called jumps facilitate program behavior like loops conditional program execution use conditional jump existence functions processors instructions change state bits flags register flags used influence program behaves since often indicate outcome various operations example processors compare instruction evaluates two values sets clears bits flags register indicate one greater whether equal one flags could used later jump instruction determine program flow first step fetch involves retrieving instruction represented number sequence numbers program memory instruction location address program memory determined program counter pc stores number identifies address next instruction fetched instruction fetched pc incremented length instruction contain address next instruction sequence often instruction fetched must retrieved relatively slow memory causing cpu stall waiting instruction returned issue largely addressed modern processors caches pipeline architectures see instruction cpu fetches memory determines cpu decode step performed circuitry known instruction decoder instruction converted signals control parts cpu way instruction interpreted defined cpu instruction set architecture isa often one group bits field within instruction called opcode indicates operation performed remaining fields usually provide supplemental information required operation operands operands may specified constant value called immediate value location value may processor register memory address determined addressing mode cpu designs instruction decoder implemented hardwired unchangeable circuit others microprogram used translate instructions sets cpu configuration signals applied sequentially multiple clock pulses cases memory stores microprogram rewritable making possible change way cpu decodes instructions fetch decode steps execute step performed depending cpu architecture may consist single action sequence actions action various parts cpu electrically connected perform part desired operation action completed typically response clock pulse often results written internal cpu register quick access subsequent instructions cases results may written slower less expensive higher capacity main memory example addition instruction executed arithmetic logic unit alu inputs connected pair operand sources numbers summed alu configured perform addition operation sum operand inputs appear output alu output connected storage e.g. register memory receive sum clock pulse occurs sum transferred storage resulting sum large i.e. larger alu output word size arithmetic overflow flag set hardwired cpu circuitry set basic operations perform called instruction set operations may involve example adding subtracting two numbers comparing two numbers jumping different part program basic operation represented particular combination bits known machine language opcode executing instructions machine language program cpu decides operation perform decoding opcode complete machine language instruction consists opcode many cases additional bits specify arguments operation example numbers summed case addition operation going complexity scale machine language program collection machine language instructions cpu executes actual mathematical operation instruction performed combinational logic circuit within cpu processor known arithmetic logic unit alu general cpu executes instruction fetching memory using alu perform operation storing result memory beside instructions integer mathematics logic operations various machine instructions exist loading data memory storing back branching operations mathematical operations floating-point numbers performed cpu floating-point unit fpu control unit cu component cpu directs operation processor tells computer memory arithmetic logic unit input output devices respond instructions sent processor directs operation units providing timing control signals computer resources managed cu directs flow data cpu devices john von neumann included control unit part von neumann architecture modern computer designs control unit typically internal part cpu overall role operation unchanged since introduction arithmetic logic unit alu digital circuit within processor performs integer arithmetic bitwise logic operations inputs alu data words operated called operands status information previous operations code control unit indicating operation perform depending instruction executed operands may come internal cpu registers external memory may constants generated alu input signals settled propagated alu circuitry result performed operation appears alu outputs result consists data word may stored register memory status information typically stored special internal cpu register reserved purpose address generation unit agu sometimes also called address computation unit acu execution unit inside cpu calculates addresses used cpu access main memory address calculations handled separate circuitry operates parallel rest cpu number cpu cycles required executing various machine instructions reduced bringing performance improvements performing various operations cpus need calculate memory addresses required fetching data memory example in-memory positions array elements must calculated cpu fetch data actual memory locations address-generation calculations involve different integer arithmetic operations addition subtraction modulo operations bit shifts often calculating memory address involves one general-purpose machine instruction necessarily decode execute quickly incorporating agu cpu design together introducing specialized instructions use agu various address-generation calculations offloaded rest cpu often executed quickly single cpu cycle capabilities agu depend particular cpu architecture thus agus implement expose address-calculation operations also include advanced specialized instructions operate multiple operands time furthermore cpu architectures include multiple agus one address-calculation operation executed simultaneously bringing performance improvements capitalizing superscalar nature advanced cpu designs example intel incorporates multiple agus sandy bridge haswell microarchitectures increase bandwidth cpu memory subsystem allowing multiple memory-access instructions executed parallel high-end microprocessors desktop laptop server computers memory management unit translating logical addresses physical ram addresses providing memory protection paging abilities useful virtual memory simpler processors especially microcontrollers usually n't include mmu cpu cache hardware cache used central processing unit cpu computer reduce average cost time energy access data main memory cache smaller faster memory closer processor core stores copies data frequently used main memory locations cpus different independent caches including instruction data caches data cache usually organized hierarchy cache levels l1 l2 l3 l4 etc. modern fast cpus specialized exceptions multiple levels cpu caches first cpus used cache one level cache unlike later level 1 caches split l1d data l1i instructions almost current cpus caches split l1 cache also l2 caches larger processors l3 caches well l2 cache usually split acts common repository already split l1 cache every core multi-core processor dedicated l2 cache usually shared cores l3 cache higher-level caches shared cores split l4 cache currently uncommon generally dynamic random-access memory dram rather static random-access memory sram separate die chip also case historically l1 bigger chips allowed integration generally cache levels possible exception last level extra level cache tends bigger optimized differently types caches exist counted towards cache size important caches mentioned translation lookaside buffer tlb part memory management unit mmu cpus caches generally sized powers two 4 8 16 etc kib mib larger non-l1 sizes although ibm z13 96 kib l1 instruction cache cpus synchronous circuits means employ clock signal pace sequential operations clock signal produced external oscillator circuit generates consistent number pulses second form periodic square wave frequency clock pulses determines rate cpu executes instructions consequently faster clock instructions cpu execute second ensure proper operation cpu clock period longer maximum time needed signals propagate move cpu setting clock period value well worst-case propagation delay possible design entire cpu way moves data around edges rising falling clock signal advantage simplifying cpu significantly design perspective component-count perspective however also carries disadvantage entire cpu must wait slowest elements even though portions much faster limitation largely compensated various methods increasing cpu parallelism see however architectural improvements alone solve drawbacks globally synchronous cpus example clock signal subject delays electrical signal higher clock rates increasingly complex cpus make difficult keep clock signal phase synchronized throughout entire unit led many modern cpus require multiple identical clock signals provided avoid delaying single signal significantly enough cause cpu malfunction another major issue clock rates increase dramatically amount heat dissipated cpu constantly changing clock causes many components switch regardless whether used time general component switching uses energy element static state therefore clock rate increases energy consumption causing cpu require heat dissipation form cpu cooling solutions one method dealing switching unneeded components called clock gating involves turning clock signal unneeded components effectively disabling however often regarded difficult implement therefore see common usage outside low-power designs one notable recent cpu design uses extensive clock gating ibm powerpc-based xenon used xbox 360 way power requirements xbox 360 greatly reduced another method addressing problems global clock signal removal clock signal altogether removing global clock signal makes design process considerably complex many ways asynchronous clockless designs carry marked advantages power consumption heat dissipation comparison similar synchronous designs somewhat uncommon entire asynchronous cpus built without using global clock signal two notable examples arm compliant amulet mips r3000 compatible minimips rather totally removing clock signal cpu designs allow certain portions device asynchronous using asynchronous alus conjunction superscalar pipelining achieve arithmetic performance gains altogether clear whether totally asynchronous designs perform comparable better level synchronous counterparts evident least excel simpler math operations combined excellent power consumption heat dissipation properties makes suitable embedded computers every cpu represents numerical values specific way example early digital computers represented numbers familiar decimal base 10 numeral system values others employed unusual representations ternary base three nearly modern cpus represent numbers binary form digit represented two-valued physical quantity high low voltage related numeric representation size precision integer numbers cpu represent case binary cpu measured number bits significant digits binary encoded integer cpu process one operation commonly called word size bit width data path width integer precision integer size cpu integer size determines range integer values directly operate example 8-bit cpu directly manipulate integers represented eight bits range 256 2 discrete integer values integer range also affect number memory locations cpu directly address address integer value representing specific memory location example binary cpu uses 32 bits represent memory address directly address 2 memory locations circumvent limitation various reasons cpus use mechanisms bank switching allow additional memory addressed cpus larger word sizes require circuitry consequently physically larger cost consume power therefore generate heat result smaller 4- 8-bit microcontrollers commonly used modern applications even though cpus much larger word sizes 16 32 64 even 128-bit available higher performance required however benefits larger word size larger data ranges address spaces may outweigh disadvantages cpu internal data paths shorter word size reduce size cost example even though ibm system/360 instruction set 32-bit instruction set system/360 model 30 model 40 8-bit data paths arithmetic logical unit 32-bit add required four cycles one 8 bits operands even though motorola 68000 series instruction set 32-bit instruction set motorola 68000 motorola 68010 16-bit data paths arithmetic logical unit 32-bit add required two cycles gain advantages afforded lower higher bit lengths many instruction sets different bit widths integer floating-point data allowing cpus implementing instruction set different bit widths different portions device example ibm system/360 instruction set primarily 32 bit supported 64-bit floating point values facilitate greater accuracy range floating point numbers system/360 model 65 8-bit adder decimal fixed-point binary arithmetic 60-bit adder floating-point arithmetic many later cpu designs use similar mixed bit width especially processor meant general-purpose usage reasonable balance integer floating point capability required description basic operation cpu offered previous section describes simplest form cpu take type cpu usually referred subscalar operates executes one instruction one two pieces data time less one instruction per clock cycle process gives rise inherent inefficiency subscalar cpus since one instruction executed time entire cpu must wait instruction complete proceeding next instruction result subscalar cpu gets hung instructions take one clock cycle complete execution even adding second execution unit see improve performance much rather one pathway hung two pathways hung number unused transistors increased design wherein cpu execution resources operate one instruction time possibly reach scalar performance one instruction per clock cycle however performance nearly always subscalar less one instruction per clock cycle attempts achieve scalar better performance resulted variety design methodologies cause cpu behave less linearly parallel referring parallelism cpus two terms generally used classify design techniques methodology differs ways implemented well relative effectiveness afford increasing cpu performance application one simplest methods used accomplish increased parallelism begin first steps instruction fetching decoding prior instruction finishes executing simplest form technique known instruction pipelining used almost modern general-purpose cpus pipelining allows one instruction executed given time breaking execution pathway discrete stages separation compared assembly line instruction made complete stage exits execution pipeline retired pipelining however introduce possibility situation result previous operation needed complete next operation condition often termed data dependency conflict cope additional care must taken check sorts conditions delay portion instruction pipeline occurs naturally accomplishing requires additional circuitry pipelined processors complex subscalar ones though significantly pipelined processor become nearly scalar inhibited pipeline stalls instruction spending one clock cycle stage improvement upon idea instruction pipelining led development method decreases idle time cpu components even designs said superscalar include long instruction pipeline multiple identical execution units load-store units arithmetic-logic units floating-point units address generation units superscalar pipeline multiple instructions read passed dispatcher decides whether instructions executed parallel simultaneously dispatched available execution units resulting ability several instructions executed simultaneously general instructions superscalar cpu able dispatch simultaneously waiting execution units instructions completed given cycle difficulty design superscalar cpu architecture lies creating effective dispatcher dispatcher needs able quickly correctly determine whether instructions executed parallel well dispatch way keep many execution units busy possible requires instruction pipeline filled often possible gives rise need superscalar architectures significant amounts cpu cache also makes hazard-avoiding techniques like branch prediction speculative execution register renaming out-of-order execution transactional memory crucial maintaining high levels performance attempting predict branch path conditional instruction take cpu minimize number times entire pipeline must wait conditional instruction completed speculative execution often provides modest performance increases executing portions code may needed conditional operation completes out-of-order execution somewhat rearranges order instructions executed reduce delays due data dependencies also case single instruction stream multiple data streamβa case lot data type processedβ modern processors disable parts pipeline single instruction executed many times cpu skips fetch decode phases thus greatly increases performance certain occasions especially highly monotonous program engines video creation software photo processing case portion cpu superscalar part part suffers performance penalty due scheduling stalls intel p5 pentium two superscalar alus could accept one instruction per clock cycle fpu could accept one instruction per clock cycle thus p5 integer superscalar floating point superscalar intel successor p5 architecture p6 added superscalar capabilities floating point features therefore afforded significant increase floating point instruction performance simple pipelining superscalar design increase cpu ilp allowing single processor complete execution instructions rates surpassing one instruction per clock cycle modern cpu designs least somewhat superscalar nearly general purpose cpus designed last decade superscalar later years emphasis designing high-ilp computers moved cpu hardware software interface isa strategy long instruction word vliw causes ilp become implied directly software reducing amount work cpu must perform boost ilp thereby reducing design complexity another strategy achieving performance execute multiple threads processes parallel area research known parallel computing flynn taxonomy strategy known multiple instruction stream multiple data stream mimd one technology used purpose multiprocessing mp initial flavor technology known symmetric multiprocessing smp small number cpus share coherent view memory system scheme cpu additional hardware maintain constantly up-to-date view memory avoiding stale views memory cpus cooperate program programs migrate one cpu another increase number cooperating cpus beyond handful schemes non-uniform memory access numa directory-based coherence protocols introduced 1990s smp systems limited small number cpus numa systems built thousands processors initially multiprocessing built using multiple discrete cpus boards implement interconnect processors processors interconnect implemented single chip technology known chip-level multiprocessing cmp single chip multi-core processor later recognized finer-grain parallelism existed single program single program might several threads functions could executed separately parallel earliest examples technology implemented input/output processing direct memory access separate thread computation thread general approach technology introduced 1970s systems designed run multiple computation threads parallel technology known multi-threading mt approach considered cost-effective multiprocessing small number components within cpu replicated support mt opposed entire cpu case mp mt execution units memory system including caches shared among multiple threads downside mt hardware support multithreading visible software mp thus supervisor software like operating systems undergo larger changes support mt one type mt implemented known temporal multithreading one thread executed stalled waiting data return external memory scheme cpu would quickly context switch another thread ready run switch often done one cpu clock cycle ultrasparc t1 another type mt simultaneous multithreading instructions multiple threads executed parallel within one cpu clock cycle several decades 1970s early 2000s focus designing high performance general purpose cpus largely achieving high ilp technologies pipelining caches superscalar execution out-of-order execution etc trend culminated large power-hungry cpus intel pentium 4 early 2000s cpu designers thwarted achieving higher performance ilp techniques due growing disparity cpu operating frequencies main memory operating frequencies well escalating cpu power dissipation owing esoteric ilp techniques cpu designers borrowed ideas commercial computing markets transaction processing aggregate performance multiple programs also known throughput computing important performance single thread process reversal emphasis evidenced proliferation dual core processor designs notably intel newer designs resembling less superscalar p6 architecture late designs several processor families exhibit cmp including x86-64 opteron athlon 64 x2 sparc ultrasparc t1 ibm power4 power5 well several video game console cpus like xbox 360 triple-core powerpc design playstation 3 7-core cell microprocessor less common increasingly important paradigm processors indeed computing general deals data parallelism processors discussed earlier referred type scalar device name implies vector processors deal multiple pieces data context one instruction contrasts scalar processors deal one piece data every instruction using flynn taxonomy two schemes dealing data generally referred single instruction stream multiple data stream simd single instruction stream single data stream sisd respectively great utility creating processors deal vectors data lies optimizing tasks tend require operation example sum dot product performed large set data classic examples types tasks include multimedia applications images video sound well many types scientific engineering tasks whereas scalar processor must complete entire process fetching decoding executing instruction value set data vector processor perform single operation comparatively large set data one instruction possible application tends require many steps apply one operation large set data early vector processors cray-1 associated almost exclusively scientific research cryptography applications however multimedia largely shifted digital media need form simd general-purpose processors become significant shortly inclusion floating-point units started become commonplace general-purpose processors specifications implementations simd execution units also began appear general-purpose processors early simd specifications like hp multimedia acceleration extensions max intel mmx integer-only proved significant impediment software developers since many applications benefit simd primarily deal floating-point numbers progressively developers refined remade early designs common modern simd specifications usually associated one isa notable modern examples include intel sse powerpc-related altivec also known vmx cloud computing involve subdividing cpu operation virtual central processing units vcpus host virtual equivalent physical machine virtual system operating several physical machines operating tandem managed whole grouped computing memory resources form cluster systems possible dynamically add remove cluster resources available host cluster level partitioned resources pools fine granularity performance speed processor depends among many factors clock rate generally given multiples hertz instructions per clock ipc together factors instructions per second ips cpu perform many reported ips values represented peak execution rates artificial instruction sequences branches whereas realistic workloads consist mix instructions applications take longer execute others performance memory hierarchy also greatly affects processor performance issue barely considered mips calculations problems various standardized tests often called benchmarks purposesuch specinthave developed attempt measure real effective performance commonly used applications processing performance computers increased using multi-core processors essentially plugging two individual processors called cores sense one integrated circuit ideally dual core processor would nearly twice powerful single core processor practice performance gain far smaller 50 due imperfect software algorithms implementation increasing number cores processor i.e dual-core quad-core etc increases workload handled means processor handle numerous asynchronous events interrupts etc take toll cpu overwhelmed cores thought different floors processing plant floor handling different task sometimes cores handle tasks cores adjacent single core enough handle information due specific capabilities modern cpus simultaneous multithreading uncore involve sharing actual cpu resources aiming increased utilization monitoring performance levels hardware use gradually became complex task response cpus implement additional hardware logic monitors actual use various parts cpu provides various counters accessible software example intel performance counter monitor technology | [
2903,
5718,
5720,
1447,
1454,
5732,
4317,
2922,
23,
5737,
2926,
4321,
5738,
7178,
7179,
1473,
2934,
5750,
5752,
1481,
7195,
2950,
2954,
4354,
2961,
7213,
5781,
1508,
7222,
4373,
7226,
2976,
5794,
2978,
2979,
5799,
5804,
4389,
2989,
102,
... | Validation |
1,238 | 3 | Haitz's_law:haitz law haitz law observation forecast steady improvement many years light-emitting diodes leds claims every decade cost per lumen unit useful light emitted falls factor 10 amount light generated per led package increases factor 20 given wavelength color light considered led counterpart moore law states number transistors given integrated circuit doubles every 18 24 months laws rely process optimization production semiconductor devices haitz law named roland haitz 1935β2015 scientist agilent technologies among others first presented larger public strategies light 2000 first series annual conferences organized strategies unlimited besides forecast exponential development cost per lumen amount light per package publication also forecast luminous efficacy led-based lighting could reach 200 lm/w lumen per watt 2020 crossing 100 lm/w 2010 would case enough industrial government resources spent research led-lighting 50 electricity consumption lighting 20 totally consumed electrical energy would saved reaching 200 lm/w prospect stepping-stone applications leds e.g mobile phone flash lcd-backlighting led massive investment led-research led efficacy indeed cross 100 lm/w 2010 trend continues leds become efficient light source 2020 theoretical maximum continuous wavelength opposed one made combination discrete-wavelength sources white light source 5800k colour temperature wavelengths restricted visible band 400nm 700nm 251 lm/w however non-continuous wavelength composite white leds achieved efficacies 300 lm/w 2010 cree inc. developed marketed xm-l led claimed 1000 lumens 100 lm/w efficacy 160 lm/w 350 150 lm/w 700 also claimed broken 200 lm/w barrier r prototype producing 208 lm 350 may 2011 cree announced another prototype 231 lm/w efficacy 350 march 2014 cree announced another prototype record breaking 303 lm/w efficacy 350 2017 philips lighting started offering consumer led lights 200 lm/w efficacy dubai using filament technology full 3 years haitz law predicted | [
4654,
1592,
4049,
4051,
48,
5832,
553,
107,
4899
] | Validation |
1,239 | 4 | Protocol_for_Carrying_Authentication_for_Network_Access:protocol carrying authentication network access pana protocol carrying authentication network access ip-based protocol allows device authenticate network granted access pana define new authentication protocol key distribution key agreement key derivation protocols purposes extensible authentication protocol eap used pana carry eap payload pana allows dynamic service provider selection supports various authentication methods suitable roaming users independent link layer mechanisms pana internet engineering task force ietf protocol described rfc 5191 pac pana client pac client part protocol element located node wants reach access network paa pana authentication agent entity represents server part pana protocol main task message exchange pac authenticating authorizing network access addition scenarios paa entity message exchange aaa server order offer pac credentials case eap configured pass-through aaa server placed physically different place paa authentication server element contains information needed check pac credentials node receives pac credentials paa sends packet result credential checking process moreover result ok packet contains information access parameters bandwidth allowed ip configuration session paa pac established session session time expires needs re-authentication process order get network access pac ep enforcement point works filter packets source authenticated pac basically ep network node drops packets according parameters provided results authentication processes typically function applied communication device access point router authentication process done successfully key installed ep pac establishing session ep pac session n't expire pac access network services authorised session expires indicate situation paa order re-authentication | [
4836,
2119
] | Test |
1,240 | 1 | SQLJ:sqlj sqlj deprecated working title efforts combine java sql common effort started around 1997 engineers ibm oracle compaq informix sybase cloudscape sun microsystems consists three parts 0 1 2 part 0 describes embedding sql statements java programs sqlj part 0 basis part 10 standard aka sql object language bindings sql/olb sqlj parts 1 2 describes converse possibility use java classes routines types sql statements parts 1 2 basis part 13 sql standard sql routines types using java programming language sql/jrt sqlj commonly used refer sqlj part 0 usually contrasted means embedding sql java like jdbc part 0 updated jdbc 2.0 compatibility ratified iso 2000 last two parts combined submitted iso part 2 substantially rewritten iso submission ansi version formal enough specification closer style user manual combined version ratified 2002 sqlj part 0 specification largely originated oracle also provided first reference implementation following sqlj synonym sqlj part 0 whereas jdbc provides api sqlj consists language extension thus programs containing sqlj must run preprocessor sqlj translator compiled advantages sqlj jdbc include following examples compare sqlj syntax jdbc usage | [
1834,
5711
] | Test |
1,241 | 4 | PunkeyPOS_Malware:punkeypos malware punkeypos new type point sale malware recently discovered pandalabs new point sale malware infects point sale pos systems two types malware applications keylogger ram scraper punkeypos gets installed computer automatically without knowledge user similar manner pos malware keylogger captures records keystrokes made pos terminals retail stores captures data related credit cards ram scraper reads memory system processes pos terminals information magnetic strips cards gets stored pos terminal/ device memory stolen information encrypted forwarded cybercriminal β control command server c c reported pandalabs 200 retail stores use pos systems infected new variant punkeypos malware | [
7194,
142,
4256,
3480,
4440
] | Train |
1,242 | 2 | Tomsrtbt:tomsrtbt tomsrtbt pronounced tom root boot small linux distribution short tom floppy root filesystem also bootable author tom oehser touts gnu/linux one floppy disk containing many common linux command-line tools useful system recovery linux operating systems also features drivers many types hardware network connectivity could created within linux earlier versions windows running ms-dos mode either formatting standard 1.44mb floppy disk higher density 1.722mb disk writing tomsrtbt image disk burning bootable cd capable reading writing filesystems many operating systems era including ext2/ext3 used linux fat used dos windows ntfs used windows nt 2000 xp minix used minix operating system windows nt later versions windows including 2000 xp vista create tomsrtbt floppy floppy driver allow extended format utilities tomsrtbt written lua programming language many use busybox space saving compiler options used throughout kernel patched support loading image compressed bzip2 many cases older alternate versions programs selected due smaller size | [
362,
5200,
6256,
1534,
1629,
3444,
7251,
474,
7075,
5571,
1941,
314,
2758,
1663,
2864,
6209,
6761,
2063,
343,
4824,
5523,
169,
5259,
1893,
5530,
5704,
6317,
7587,
7954,
6244
] | Validation |
1,243 | 1 | Mathematics_Genealogy_Project:mathematics genealogy project mathematics genealogy project web-based database academic genealogy mathematicians 13 february 2019 contained information 238,725 mathematical scientists contributed research-level mathematics typical mathematician project entry includes graduation year thesis title alma mater doctoral advisor doctoral students project grew founder harry coonce desire know name advisor advisor coonce professor mathematics minnesota state university mankato time project founding project went online fall 1997 coonce retired mankato 1999 fall 2002 university decided would longer support project project relocated time north dakota state university since 2003 project also operated auspices american mathematical society 2005 received grant clay mathematics institute harry coonce assisted mitchel t. keller assistant professor washington lee university keller currently managing director project mathematics genealogy mission statement states throughout project use word mathematics mathematician mean word inclusive sense thus relevant data statistics computer science philosophy operations research welcome genealogy information obtained sources dissertation abstracts international notices american mathematical society may supplied anyone via project website searchable database contains name mathematician university awarded degree year degree awarded title dissertation names advisor second advisor flag country degree awarded listing doctoral students count academic descendants historically significant figures lacked doctoral degree listed notably joseph louis lagrange noted data collected mathematics genealogy project self-reported guarantee observed genealogy network complete description mentorship network fact 16,147 mathematicians recorded mentor 8,336 recorded proteges maimgren ottino amaral 2010 stated mathematicians graduated 1900 1960 believe graduation mentorship record reliable | [
4660,
7152,
7515,
4669,
3965,
1845,
6448,
43,
412,
6466,
6470,
762,
5424,
6846,
6485,
6861,
101,
813,
4405,
6900,
6534,
2303,
2667,
3718,
8012,
851,
1219,
4085,
7678,
3409,
1231,
1600,
6949,
6955,
1245,
7695,
3429,
7707,
186,
2006,
6611... | Test |
1,244 | 3 | Peter_Hofstee:peter hofstee harm peter hofstee born 1962 dutch physicist computer scientist currently distinguished research staff member ibm austin usa part-time professor big data systems delft university technology netherlands hofstee best known contributions heterogeneous computing chief architect synergistic processor elements cell broadband engine processor used sony playstation 3 first supercomputer reach sustained petaflop operation returning ibm research 2011 focused optimizing system roadmap big data analytics cloud including use accelerated compute early research work coherently attached reconfigurable acceleration power7 paved way new coherent attach processor interface power8 hofstee ibm master inventor 100 issued patents hofstee born groningen obtained master degree theoretical physics university groningen 1988 continued study california institute technology wrote master thesis constructing distributed programs 1991 obtained ph.d. thesis titled synchronizing processes 1995 joined caltech lecturer two years moved ibm austin texas research laboratory staff member senior technical staff member distinguished engineer positions since 2011 peter leading big data system design work ibm march 2016 peter appointed professor chair big data computer systems faculty electrical engineering mathematics computer science delft university technology | [
6597,
450,
4408,
2845,
5042,
4242,
5665,
1388,
2139,
4718,
239,
763,
602,
2601,
2873,
3234,
4200,
1606,
4839
] | Test |
1,245 | 2 | Niels_Provos:niels provos niels provos researcher security engineering malware cryptography received phd computer science university michigan 2003 2018 worked google distinguished engineer security google cloud platform 2018 left google join stripe new head security many years provos contributed openbsd operating system developed bcrypt adaptive cryptographic hash function author numerous software packages including libevent event driven programming system systrace access control system honeyd honeypot system stegdetect steganography detector bcrypt password encryption technique many others provos outspoken critic effect dmca similar laws security researchers arguing threaten make criminals people conducting legitimate security research provos also served program chair usenix security symposium program committees network distributed system security symposium acm sigcomm numerous conferences served board directors usenix 2006 2010 provos hobbies include swordsmithing forged swords japanese viking styles routinely posts videos blacksmithing activities online | [
6414,
2001,
2453,
2823,
191,
5373,
5814,
5571,
6630,
1572,
1394,
7752,
3572,
4990,
1133,
2883,
1243,
6242,
1805
] | Test |
1,246 | 3 | Solbourne_Computer:solbourne computer solbourne computer inc. originally vendor computer systems based longmont colorado united states first 52 owned matsushita late 1980s early 1990s company produced range computer workstations servers based sparc microprocessor architecture largely compatible sun microsystems sun-4 systems notable supporting symmetric multiprocessing time sun produced multiprocessor systems even sun produced multiprocessor systems sunos uses asymmetric multiprocessing model rather os/mp symmetric multiprocessing model sun would adopt symmetric multiprocessing release solaris 2.0 1992 due cost engineering producing new systems compete sun increasingly competitive hardware offerings loss symmetric multiprocessing distinguishing feature 1994 solbourne left computer hardware business grumman systems support corporation taking support solbourne customers 2000 1994 walt pounds assumed role ceo solbourne solbourne headquarters moved boulder colorado point july 2008 solbourne focused providing consulting services solutions based oracle applications associated technologies solbourne established strong reputation oracle e-business suite community become dominant provider consulting services state local oracle e-business suite customers july 11 2008 solbourne closed transaction sell substantially company assets deloitte consulting solbourne management team 100 professionals joined deloitte β enterprise applications technology integration human capital service areas solbourne range comprises following solbourne systems run os/mp modified version sunos 4.1 supporting multiprocessor systems final release os/mp 4.1d corresponding sunos 4.1.3. work done porting openbsd solbourne idt workstations | [
971,
6572
] | Test |
1,247 | 4 | Fluentd:fluentd fluentd cross platform open-source data collection software project originally developed treasure data written primarily ruby programming language fluentd big data tool semi- un-structured data sets like apache kafka analyzes event logs application logs clickstreams according suonsyrjΓ€ mikkonen core idea fluentd unifying layer different types log inputs outputs fluentd available linux mac osx windows fluentd created sadayuki furuhashi project mountain view-based firm treasure data written primarily ruby source code released open-source software october 2011 company announced 5 million funding 2013 fluentd one data collection tools recommended amazon web services 2013 said similar apache flume scribe google cloud platform bigquery recommends fluentd default real-time data-ingestion tool uses google customized version fluentd called google-fluentd default logging agent | [
664,
2317,
5571,
5064,
397,
7848,
578,
6428
] | Test |
1,248 | 3 | Ntoskrnl.exe:ntoskrnl.exe computing ntoskrnl.exe short windows nt operating system kernel executable also known kernel image provides kernel executive layers microsoft windows nt kernel space responsible various system services hardware abstraction process memory management thus making fundamental part system contains cache manager executive kernel security reference monitor memory manager scheduler dispatcher system binary native application linked codice_1 instead containing standard 'start entry point its-own function calls architecture-independent kernel initialization function ntoskrnl.exe linked codice_1 linked codice_3 codice_4 codice_5 requires static copy c runtime objects depends executable usually 2mb size overall four kernel image files revision windows two kernel image files windows system multiprocessor uniprocessor files selected install time pae non-pae files selected boot.ini bcd option according routines ntoskrnl use prefixes names indicate component ntoskrnl defined following table lists kernel receives control gets pointer structure parameter structure passed bootloader contains information hardware path registry file kernel parameters containing boot preferences options change behavior kernel path files loaded bootloader codice_6 registry hive nls character encoding conversion vga font definition structure retrieved using kernel debugger downloading microsoft symbol database x86 architecture kernel receives system already protected mode gdt idt tss ready since know address one load one one fill pcr structure main entry point ntoskrnl.exe performs system dependent initialization calls system independent initialization enters idle loop modern operating systems use interrupts instead i/o port polling wait information devices x86 architecture interrupts handled interrupt dispatch table idt device triggers interrupt interrupt flag flags register set processor hardware looks interrupt handler table entry corresponding interrupt number turn translated irq pic chips modern hardwares apic interrupt handlers usually save subset state registers handling restore back original values done interrupt table contains handlers hardware interrupts software interrupts exceptions ia-32 versions kernel one example software interrupt handler many idt table entry 2e hexadecimal 46 decimal used assembly language codice_7 system calls real implementation entry points internal subroutine named per symbol information published microsoft codice_8 newer versions different mechanisms making use codice_9 instruction x86-64 codice_10 instruction used instead one notable feature nt interrupt handling interrupts usually conditionally masked based priority called irql instead disabling irqs via interrupt flag permits various kernel components carry critical operations without necessarily blocking services peripherals devices microsoft windows divides virtual address space two regions lower part starting zero instantiated separately process accessible user kernel mode application programs run processes supply code runs user mode upper part accessible kernel mode exceptions instantiated system-wide ntoskrnl.exe mapped region several kernel mode components region also contains data used kernel mode code kernel mode heaps file system cache entire physical memory ram address range broken many small usually 4 kb blocks properties block stored structures called page table entries managed os accessed processor hardware page tables organized tree structure physical page number top-level table stored control register 3 cr3 windows registry repository configuration settings information operating system software applications thought filesystem optimized small files however accessed file system-like semantics rather specialized set apis implemented kernel mode exposed user mode registry stored disk several different files called hives one system hive loaded early boot sequence provides configuration information required time additional registry hives providing software-specific user-specific data loaded later phases system initialization user login respectively list drivers loaded disk retrieved codice_11 key current control set key codice_6 registry hive key stores device drivers kernel processes user processes collectively called services stored mixed place initialization upon driver load request kernel transverses tree looking services tagged kernel services | [
7879,
3937,
3263,
378,
2198,
6096,
1475,
7553,
7195,
5410,
7564,
2953,
421,
422,
6844,
2245,
435,
5442,
4377,
5090,
3340,
7602,
6164,
4759,
1534,
6885,
7619,
5108,
2999,
5475,
6528,
2290,
4774,
1181,
3711,
5134,
7272,
1571,
5850,
140,
6... | Test |
1,249 | 4 | Context-based_access_control:context-based access control context-based access control cbac feature firewall software intelligently filters tcp udp packets based application layer protocol session information used intranets extranets internets cbac configured permit specified tcp udp traffic firewall connection initiated within network needing protection words cbac inspect traffic sessions originate external network however example discusses inspecting traffic sessions originate external network cbac inspect traffic sessions originate either side firewall basic function stateful inspection firewall without cbac traffic filtering limited access list implementations examine packets network layer transport layer however cbac examines network layer transport layer information also examines application-layer protocol information ftp connection information learn state tcp udp session allows support protocols involve multiple channels created result negotiations ftp control channel multimedia protocols well protocols ftp rpc sql*net involve multiple control channels cbac inspects traffic travels firewall discover manage state information tcp udp sessions state information used create temporary openings firewall access lists allow return traffic additional data connections permissible sessions sessions originated within protected internal network cbac deep packet inspection hence termed ios firewall cbac also provides following benefits | [
3165,
1809,
6162,
4759,
5725,
806,
994,
3185,
2557,
4492,
7351,
4138,
385,
7536,
2296,
2746,
7637,
3461,
6107,
578,
3637,
8100,
6456,
3551,
1291,
7275,
3884,
7744,
3394,
6560,
4977,
7289,
7478,
3223,
3484,
5074,
4091,
2790,
6944,
7683,
... | Train |
1,250 | 8 | Dark_social_media:dark social media dark social media dark social dark traffic social shares contain digital referral information source idea generally used web analytics well online advertising contrary sharing social networking service like facebook done publicly dark social done privately irc channels emails sms simply copy-and-paste ways private sharing confuse deep web dark social media content traffic online sharing sharing activities often come name direct typed/bookmarked similar form today web analytic services 2014 believed dark social consisted 69 sharing activities globally whereas facebook holds 23 however exact nature dark social media still unknown word dark name suggests unknown can't-see heart concept like dark energy astronomy alexis madrigal curious traffic really coming site worked atlantic grew time web built knew ways share information big name sites like facebook lead believe large portion web traffic coming β bookmarked β β typed β sources led believe help web analytics firm chartbeat able quantify traffic something much meaningful article wrote brought usage term dark social dark social also known direct social dark traffic however alexis madrigal β term dark social widely used dark social media perceived differently looking desktop computers vs mobile computers 2014 almost 50 total external mobile traffic dark social traffic meaning traffic referrer showing coming contrast one-third external desktop traffic dark social 2014 two years alexis madrigal wrote original post dark social started notice dark social traffic could come mobile devices well madrigal mentioned since october 2015 facebook changed algorithm mobile app resulted media publisher receiving 100 traffic meantime also noticed atlantic company used work received lot dark social traffic facebook mobile traffic alexis madrigal later performed experiment confirm theory dark social traffic boost indeed facebook mobile app found referrer links facebook β mobile app β always pass destination website creates dark social traffic mobile devices updated charbeat report also confirmed part dark social traffic generated facebook mobile app users addition facebook mobile app dark social traffic also come reddit mobile app gmail instant messaging apps well one radiumone β report published february 2016 dark side mobile sharing company stated found 84 online traffic coming dark social channels date furthermore also showed dark social traffic 62 mobile devices 38 desktops rise smart phones mobile apps largely increased dark social traffic mobile devices last years amount dark social traffic mobile devices jumps 53 2014 62 2016 dark social traffic comes desktops decreases 47 2014 38 2016 dark social traffic consists mostly one-to-one messaging non-dark channels facebook messenger snapchat rather commonly used one-to-many methods example sharing twitter feed facebook wall traditional analytics tools rely upon links shared private messaging methods may include referral tags analytics tool simply appear though came direct traffic could include referral tags copy pasted another non-dark social channel referral tags always carried private messaging becomes impossible tell person sharing dark traffic originally obtained content another referral method directly copy-pasting link makes difficult marketers understand effective social media marketing strategy make changes accordingly combat lack transparency websites include attractive ways share links simply copy-pasting another application example sites implement highly visible share buttons copy-paste button buttons share link referral tag directly dark social channel like whatsapp facebook messenger email rules also made within traditional analytics tools filter dark social traffic include direct links exclude n't referred homepage analytics tools also beginning incorporate ability distinguish dark social copy-paste based traffic types traffic invisible web also known deep web dark social referring web traffic analyzed invisible web referring websites data indexed search engines essence kinds information invisible general population internet dark social data found web analytics software see traffic originates invisible web data show using search engines like google search microsoft bing hidden results unintentional dark web associated dark social invisible web mainly hidden nature dark web data data intentionally hidden internet involved wish remain anonymous interest shares content share psychology dark social sharing found people share three reasons dark social sharing allows individualism people able freely express choosing what- whom- share rather broadcasting everything β friends. β dark social sharing creates β personal β channel sharing elevates builds personal relationships even defying geographical boundaries dark social sharing allows people feel helpful trend interesting sharing smaller intimate social circle sharer gets knowledgeable within groups giving street cred email im common sources dark social sharing facebook may actually part cause increase dark social-through chatting messaging services sources dark social reddit stumbleupon twitter tumblr linkedin google+ whatsapp viber kwik firechat om livetext evidence pew research age accounts sharing darkly sharing means tracked easier baby boomers born 1946-1964 gen xers born 1965-1981 commonly share email word mouth fact gen xers heaviest users email considered dark social millennials born 1982-1995 younger tend toward social media sharing applications often reported dark addition sharing professionally darkly linkedin requires upwards 15 hours week impact certain platforms also attract types populations blogs lgbt communinty | [
4600,
3641
] | Test |
1,251 | 2 | SUNMOS:sunmos sunmos sandia/unm operating system operating system jointly developed sandia national laboratories computer science department university new mexico goal project started 1991 develop highly portable yet efficient operating system massively parallel-distributed memory systems sunmos uses single-tasking kernel provide demand paging takes control nodes distributed system application loaded running manage available memory node use full resources provided hardware applications started controlled process called yod runs host node yod runs sun frontend ncube 2 service node intel paragon sunmos developed reaction heavy weight version osf/1 ran single-system image paragon consumed 8-12 mb 16 mb available node leaving little memory available compute applications comparison sunmos used 250 kb memory per node additionally overhead osf/1 limited network bandwidth 35 mb/s sunmos able use 170 mb/s peak 200 mb/s available ideas sunmos inspired puma multitasking variant ran i860 paragon among extensions puma portals api scalable high performance message passing api intel ported puma portals pentium pro based asci red system named cougar cray ported cougar opteron based cray xt3 renamed catamount version catamount released public named opencatamount 2009 catamount lightweight kernel selected r 100 award | [
5571,
802,
5744,
83,
56
] | Test |
1,252 | 3 | Comparison_of_instruction_set_architectures:comparison instruction set architectures instruction set architecture isa abstract model computer also referred architecture computer architecture realization isa called implementation isa permits multiple implementations may vary performance physical size monetary cost among things isa serves interface software hardware software written isa run different implementations isa enabled binary compatibility different generations computers easily achieved development computer families developments helped lower cost computers increase applicability reasons isa one important abstractions computing today isa defines everything machine language programmer needs know order program computer isa defines differs isas general isas define supported data types state main memory registers semantics memory consistency addressing modes instruction set set machine instructions comprises computer machine language input/output model early decades computing computers used binary decimal even ternary contemporary computers almost exclusively binary computer architectures often described n -bit architectures today n often 8 16 32 64 sizes used actually strong simplification computer architecture often less natural datasizes instruction set hardware implementation may different many architectures instructions operating half and/or twice size respective processors major internal datapaths examples 8080 z80 mc68000 well many others type implementations twice wide operation typically also takes around twice many clock cycles case high performance implementations 68000 instance means 8 instead 4 clock ticks particular chip may described 32-bit architecture 16-bit implementation external databus width often useful determine width architecture ns32008 ns32016 ns32032 basically 32-bit chip different external data buses ns32764 64-bit bus used 32-bit registers width addresses may may different width data early 32-bit microprocessors often 24-bit address system/360 processors number operands one factors may give indication performance instruction set three-operand architecture allow computed one instruction two-operand architecture allow computed one instruction two instructions need executed simulate single three-operand instruction architecture may use big little endianness configurable use either little endian processors order bytes memory least significant byte multi-byte value lowest-numbered memory location big endian architectures instead order significant byte lowest-numbered address x86 architecture well several 8-bit architectures little endian risc architectures sparc power powerpc mips originally big endian arm little endian many including arm configurable endianness applies processors allow individual addressing units data bytes smaller basic addressable machine word usually number registers power two e.g 8 16 32 cases hardwired-to-zero pseudo-register included part register files architectures mostly simplify indexing modes table counts integer registers usable general instructions moment architectures always include special-purpose registers program pointer pc counted unless mentioned note architectures sparc register window architectures count indicates many registers available within register window also non-architected registers register renaming counted note common type architecture load-store synonym register register meaning instructions access memory except special β load register β store register β possible exceptions atomic memory operations locking table compares basic information instruction sets implemented cpu architectures | [
5012,
1447,
5371,
3948,
7527,
7529,
5737,
1465,
7541,
2567,
4694,
5042,
1481,
5055,
2226,
1867,
6480,
5079,
2248,
5431,
6148,
441,
2266,
5459,
467,
6523,
4047,
4408,
5483,
1556,
5487,
7990,
6198,
1568,
1570,
6922,
4077,
6563,
7666,
515,
... | Validation |
1,253 | 9 | Gauche_(Scheme_implementation):gauche scheme implementation gauche r7rs scheme implementation designed scripting production environment intended allow programmers system administrators write scripts support daily operations quick startup built-in system interface native multilingual support key design goals gauche free software bsd license primarily developed shiro kawai | [
7032,
7219,
3915,
5571,
6981
] | Validation |
1,254 | 3 | Computer_data_storage:computer data storage digvijay singh computer data storage often called storage memory technology consisting computer components recording media used retain digital data core function fundamental component computers central processing unit cpu computer manipulates data performing computations practice almost computers use storage hierarchy puts fast expensive small storage options close cpu slower larger cheaper options farther away generally fast volatile technologies lose data power referred memory slower persistent technologies referred storage even first computer designs charles babbage analytical engine percy ludgate analytical machine clearly distinguished processing memory babbage stored numbers rotations gears ludgate stored numbers displacements rods shuttles distinction extended von neumann architecture cpu consists two main parts control unit arithmetic logic unit alu former controls flow data cpu memory latter performs arithmetic logical operations data without significant amount memory computer would merely able perform fixed operations immediately output result would reconfigured change behavior acceptable devices desk calculators digital signal processors specialized devices von neumann machines differ memory store operating instructions data computers versatile need hardware reconfigured new program simply reprogrammed new in-memory instructions also tend simpler design relatively simple processor may keep state successive computations build complex procedural results modern computers von neumann machines modern digital computer represents data using binary numeral system text numbers pictures audio nearly form information converted string bits binary digits value 1 0 common unit storage byte equal 8 bits piece information handled computer device whose storage space large enough accommodate binary representation piece information simply data example complete works shakespeare 1250 pages print stored five megabytes 40 million bits one byte per character data encoded assigning bit pattern character digit multimedia object many standards exist encoding e.g. character encodings like ascii image encodings like jpeg video encodings like mpeg-4 adding bits encoded unit redundancy allows computer detect errors coded data correct based mathematical algorithms errors generally occur low probabilities due random bit value flipping physical bit fatigue loss physical bit storage ability maintain distinguishable value 0 1 due errors inter intra-computer communication random bit flip e.g. due random radiation typically corrected upon detection bit group malfunctioning physical bits always specific defective bit known group definition depends specific storage device typically automatically fenced-out taken use device replaced another functioning equivalent group device corrected bit values restored possible cyclic redundancy check crc method typically used communications storage error detection detected error retried data compression methods allow many cases database represent string bits shorter bit string compress reconstruct original string decompress needed utilizes substantially less storage tens percents many types data cost computation compress decompress needed analysis trade-off storage cost saving costs related computations possible delays data availability done deciding whether keep certain data compressed security reasons certain types data e.g. credit-card information may kept encrypted storage prevent possibility unauthorized information reconstruction chunks storage snapshots generally lower storage hierarchy lesser bandwidth greater access latency cpu traditional division storage primary secondary tertiary off-line storage also guided cost per bit contemporary usage memory usually semiconductor storage read-write random-access memory typically dram dynamic ram forms fast temporary storage storage consists storage devices media directly accessible cpu secondary tertiary storage typically hard disk drives optical disc drives devices slower ram non-volatile retaining contents powered historically memory called core memory main memory real storage internal memory meanwhile non-volatile storage devices referred secondary storage external memory auxiliary/peripheral storage primary storage also known main memory internal memory prime memory often referred simply memory one directly accessible cpu cpu continuously reads instructions stored executes required data actively operated also stored uniform manner historically early computers used delay lines williams tubes rotating magnetic drums primary storage 1954 unreliable methods mostly replaced magnetic core memory core memory remained dominant 1970s advances integrated circuit technology allowed semiconductor memory become economically competitive led modern random-access memory ram small-sized light quite expensive time particular types ram used primary storage also volatile i.e lose information powered shown diagram traditionally two sub-layers primary storage besides main large-capacity ram main memory directly indirectly connected central processing unit via memory bus actually two buses diagram address bus data bus cpu firstly sends number address bus number called memory address indicates desired location data reads writes data memory cells using data bus additionally memory management unit mmu small device cpu ram recalculating actual memory address example provide abstraction virtual memory tasks ram types used primary storage volatile uninitialized start computer containing storage would source read instructions order start computer hence non-volatile primary storage containing small startup program bios used bootstrap computer read larger program non-volatile secondary storage ram start execute non-volatile technology used purpose called rom read-only memory terminology may somewhat confusing rom types also capable random access many types rom literally read updates possible however slow memory must erased large portions re-written embedded systems run programs directly rom similar programs rarely changed standard computers store non-rudimentary programs rom rather use large capacities secondary storage non-volatile well costly recently primary storage secondary storage uses refer historically called respectively secondary storage tertiary storage secondary storage also known external memory auxiliary storage differs primary storage directly accessible cpu computer usually uses input/output channels access secondary storage transfer desired data primary storage secondary storage non-volatile retaining data power shut modern computer systems typically two orders magnitude secondary storage primary storage secondary storage less expensive modern computers hard disk drives hdds solid-state drives ssds usually used secondary storage access time per byte hdds ssds typically measured milliseconds one thousandth seconds access time per byte primary storage measured nanoseconds one billionth seconds thus secondary storage significantly slower primary storage rotating optical storage devices cd dvd drives even longer access times examples secondary storage technologies include usb flash drives floppy disks magnetic tape paper tape punched cards ram disks disk read/write head hdds reaches proper placement data subsequent data track fast access reduce seek time rotational latency data transferred disks large contiguous blocks sequential block access disks orders magnitude faster random access many sophisticated paradigms developed design efficient algorithms based upon sequential block access another way reduce i/o bottleneck use multiple disks parallel order increase bandwidth primary secondary memory secondary storage often formatted according file system format provides abstraction necessary organize data files directories also providing metadata describing owner certain file access time access permissions information computer operating systems use concept virtual memory allowing utilization primary storage capacity physically available system primary memory fills system moves least-used chunks pages swap file page file secondary storage retrieving later needed lot pages moved slower secondary storage system performance degraded tertiary storage tertiary memory level secondary storage typically involves robotic mechanism mount insert dismount removable mass storage media storage device according system demands data often copied secondary storage use primarily used archiving rarely accessed information since much slower secondary storage e.g 5β60 seconds vs. 1β10 milliseconds primarily useful extraordinarily large data stores accessed without human operators typical examples include tape libraries optical jukeboxes computer needs read information tertiary storage first consult catalog database determine tape disc contains information next computer instruct robotic arm fetch medium place drive computer finished reading information robotic arm return medium place library tertiary storage also known nearline storage near online formal distinction online nearline offline storage example always-on spinning hard disk drives online storage spinning drives spin automatically massive arrays idle disks maid nearline storage removable media tape cartridges automatically loaded tape libraries nearline storage tape cartridges must manually loaded offline storage off-line storage computer data storage medium device control processing unit medium recorded usually secondary tertiary storage device physically removed disconnected must inserted connected human operator computer access unlike tertiary storage accessed without human interaction off-line storage used transfer information since detached medium easily physically transported additionally case disaster example fire destroys original data medium remote location probably unaffected enabling disaster recovery off-line storage increases general information security since physically inaccessible computer data confidentiality integrity affected computer-based attack techniques also information stored archival purposes rarely accessed off-line storage less expensive tertiary storage modern personal computers secondary tertiary storage media also used off-line storage optical discs flash memory devices popular much lesser extent removable hard disk drives enterprise uses magnetic tape predominant older examples floppy disks zip disks punched cards storage technologies levels storage hierarchy differentiated evaluating certain core characteristics well measuring characteristics specific particular implementation core characteristics volatility mutability accessibility addressability particular implementation storage technology characteristics worth measuring capacity performance non-volatile memory retains stored information even constantly supplied electric power suitable long-term storage information volatile memory requires constant power maintain stored information fastest memory technologies volatile ones although universal rule since primary storage required fast predominantly uses volatile memory dynamic random-access memory form volatile memory also requires stored information periodically reread rewritten refreshed otherwise would vanish static random-access memory form volatile memory similar dram exception never needs refreshed long power applied loses content power supply lost uninterruptible power supply ups used give computer brief window time move information primary volatile storage non-volatile storage batteries exhausted systems example emc symmetrix integrated batteries maintain volatile storage several minutes utilities hdparm sar used measure io performance linux full disk encryption volume virtual disk encryption andor file/folder encryption readily available storage devices hardware memory encryption available intel architecture supporting total memory encryption tme page granular memory encryption multiple keys mktme sparc m7 generation since october 2015.. commonly used data storage media semiconductor magnetic optical paper still sees limited usage fundamental storage technologies all-flash arrays afas proposed development semiconductor memory uses semiconductor-based integrated circuits store information semiconductor memory chip may contain millions tiny transistors capacitors volatile non-volatile forms semiconductor memory exist modern computers primary storage almost exclusively consists dynamic volatile semiconductor memory dynamic random-access memory since turn century type non-volatile semiconductor memory known flash memory steadily gained share off-line storage home computers non-volatile semiconductor memory also used secondary storage various advanced electronic devices specialized computers designed early 2006 notebook desktop computer manufacturers started using flash-based solid-state drives ssds default configuration options secondary storage either addition instead traditional hdd magnetic storage uses different patterns magnetization magnetically coated surface store information magnetic storage non-volatile information accessed using one read/write heads may contain one recording transducers read/write head covers part surface head medium must moved relative another order access data modern computers magnetic storage take forms early computers magnetic storage also used optical storage typical optical disc stores information deformities surface circular disc reads information illuminating surface laser diode observing reflection optical disc storage non-volatile deformities may permanent read media formed write media reversible recordable read/write media following forms currently common use magneto-optical disc storage optical disc storage magnetic state ferromagnetic surface stores information information read optically written combining magnetic optical methods magneto-optical disc storage non-volatile sequential access slow write fast read storage used tertiary off-line storage 3d optical data storage also proposed light induced magnetization melting magnetic photoconductors also proposed high-speed low-energy consumption magneto-optical storage paper data storage typically form paper tape punched cards long used store information automatic processing particularly general-purpose computers existed information recorded punching holes paper cardboard medium read mechanically later optically determine whether particular location medium solid contained hole technologies allow people make marks paper easily read machineβthese widely used tabulating votes grading standardized tests barcodes made possible object sold transported computer readable information securely attached group bits malfunction may resolved error detection correction mechanisms see storage device malfunction requires different solutions following solutions commonly used valid storage devices device mirroring typical raid designed handle single device failure raid group devices however second failure occurs raid group completely repaired first failure data lost probability single failure typically small thus probability two failures raid group time proximity much smaller approximately probability squared i.e. multiplied database tolerate even smaller probability data loss raid group replicated mirrored many cases mirroring done geographically remotely different storage array handle also recovery disasters see disaster recovery secondary tertiary storage may connect computer utilizing computer networks concept pertain primary storage shared multiple processors lesser degree large quantities individual magnetic tapes optical magneto-optical discs may stored robotic tertiary storage devices tape storage field known tape libraries optical storage field optical jukeboxes optical disk libraries per analogy smallest forms either technology containing one drive device referred autoloaders autochangers robotic-access storage devices may number slots holding individual media usually one picking robots traverse slots load media built-in drives arrangement slots picking devices affects performance important characteristics storage possible expansion options adding slots modules drives robots tape libraries may 10 100,000 slots provide terabytes petabytes near-line information optical jukeboxes somewhat smaller solutions 1,000 slots robotic storage used backups high-capacity archives imaging medical video industries hierarchical storage management known archiving strategy automatically migrating long-unused files fast hard disk storage libraries jukeboxes files needed retrieved back disk | [
1438,
1447,
1454,
5737,
5738,
2936,
5753,
1481,
4339,
5760,
2956,
2960,
7213,
2979,
2992,
2999,
4397,
3007,
1547,
1550,
4418,
3026,
1568,
1570,
4441,
1590,
1601,
7314,
1607,
5889,
4472,
7329,
4479,
191,
5918,
7355,
7143,
216,
4515,
5939,
... | Test |
1,255 | 9 | Mallard_BASIC:mallard basic mallard basic basic interpreter cp/m written locomotive software supplied amstrad pcw range small business computers zx spectrum +3 version cp/m plus acorn bbc micro z80 second processor 1980s standard industry practice bundle basic interpreter microcomputers pcw followed practice primarily wordprocessor business use dedicated wp also ran cp/m operating system though existing implementations basic cp/m digital research cbasic third-party zbasic followed earlier 1970s model compilers fed source code prepared separate text editor mallard like traditional micro rom basic integrated editor tailored pcw non-standard 90-column screen although pcw actually excellent monochrome graphics support time specification closely comparable hercules graphics card pc mallard basic graphics support whatsoever instead locomotive optimised business use instance full isam random-access file support making easier write database applications also optimised speed named lner a4 class 4468 mallard locomotive fastest steam locomotive world displaying company fondness railway-oriented nomenclature instance see company name fact locomotive name came phrase run like train theme used name mallard basic locomotive product named anything railway-oriented acorn version designed simply run compact software small business accounting products acorn including target z80 second processor small businesses mallard major innovation designed specifically acorn addition jetsam b*-tree keyed access filing system give similar superior features miksam product compact originally designed around graphics could implemented loading gsx extension cp/m cumbersome basic programmers lack graphics support rectified several basic toolkits popular lightning extended basic lebβsee external links patched mallard basic replacing redundant let keyword leb could followed wide variety parameters allow sophisticated graphics time drawn screen saved disc printed et cetera probably widespread mallard application ever rped text editor supplied pcw name short roland perry editor program put together quickly roland perry amstrad executive running computer product development realised cp/m-80 came usable full-screen editor users requirement edit configuration files problem apparent dos plus ms-dos supplied ibm-compatible amstrad computers rped machines written 8086 assembler mallard basic pc version mallard basic still available locoscript software ms-dos program run windows disc version licence full introduction reference manual | [
5367,
12,
2463,
6891,
1361,
8183,
4139,
5651,
2925,
7448,
5926,
5129,
5571,
7906,
5137,
5234,
2941,
3303,
4611,
5852,
6380,
1304,
61,
6394,
4003,
7864,
1789,
5877,
6778,
4012,
4745,
1064
] | Test |
1,256 | 7 | United_Devices:united devices united devices inc. privately held commercial distributed computing company focused use grid computing manage high-performance computing systems enterprise cluster management products services allowed users allocate workloads computers devices throughout enterprises aggregating computing power would normally go unused operated name univa ud time merging univa september 17 2007 founded 1999 austin texas united devices began distributed computing expertise distributed.net seti home although original technical staff organizations remained years april 2001 grid.org formally announced philanthropic non-profit website demonstrate benefits internet-based large scale grid computing later 2002 help ud ntt data launched similar internet-based cell computing project targeting japanese users 2004 ibm united devices worked together start world community grid project another demonstration internet-based grid computing august 2005 united devices acquired paris-based gridxpert company added synergy product lineup 2006 company acknowledged seeing industry shift using grid computing compute-intensive applications towards data center automation business application optimization partly response market shifts reorganization grid.org shut april 27 2007 completing mission demonstrate viability benefits large-scale internet-based grid computing september 17 2007 company announced would merge lisle illinois-based univa operate new name univa ud combined company would offer open source solutions based around globus toolkit continuing sell existing grid products support existing customers june 26 2008 united devices client software world community grid finished role completely relayed boinc 2001 2007 united devices operated series public projects grid.org website part philanthropic effort also acted marketing tool helping spread awareness grid mp product demonstrating platform scalability costs associated operating past projects grid.org financially sponsored part companies including microsoft intel ibm april 27 2007 united devices closed grid.org cancer research project announcement completed mission demonstrate viability benefits large-scale internet-based grid computing | [
7930,
817,
6690,
4159,
2325,
4484,
1923,
1431,
2441,
5447
] | Test |
1,257 | 7 | Entera:entera entera middleware product introduced mid-1990s open environment corporation oec early implementation three-tiered clientβserver model|clientβserver model development model entera viewed business software collection services rather monolithic application entera designed allow companies build manage large multinational information systems preserving existing investments skill sets hardware software systems multi-tiered architecture solved problems inherent first generation client/server application development including lack scalability software maintenance|manageability application security vendor lock-in entera built industry-standard distributed computing infrastructures supported variety programming language management framework origination oec oec β purchase borland software rights entera acquired ecube systems llc 2003 today entera nxtera still used fortune 1000 companies several countries developed maintained marketed ecube systems 1992 open environment corporation β oec β located cambridge massachusetts released middleware product called β oec toolkit. β product eventually would become known β entera β first middleware product sold application server platform subsequent years company added entera three-tier application monitoring called appminder transaction processing system called entera fx next nine years oec sold tens millions dollars worth entera least 300 fortune 1000 customers 1995 oec went public completing initial public offering nasdaq stock exchange ticker continuing develop entera two primary versions software developed transmission control protocol tcp version distributed computing environment dce latter based dcs cell directory service dce endpoint mapper dce threads computer science |threads despite various challenges dce version entera became popular ibm customer base simplified complexity dce development time oec developers began work fourth version entera aimed unifying tcp dce versions used dce endpoint mapper provide stability increased performance newer version implemented multithreading software |multithreading broker persistence prior acquisition oec developed number products including oec toolkit encompass netminder entera workbench oec3270 appminder entera ole entera fx 1996 year going public oec acquired borland borland continued invest entera software peaked popularity time 300 fortune 1000 companies using entera worldwide post-buyout transition phase original entera development team underwent changes entera 4.0 released prematurely causing problems use replacement entera 3.2 borland responded releasing version 4.1 proved stable version 2000 stable version 4.2.1 released next years borland sold hundreds copies entera new former entera customers time borland also developed professional services organizations capable working diverse programming environments november 1997 borland announced acquisition visigenic software vsgn corba vendor developer visibroker visibroker overlapped entera β capabilities adding support java programming language |java programming language object computer science |object-orientation degree complexity distributed computing following year borland refocused efforts targeting enterprise applications development spent less time developing entera turned attention visibroker borland changed name inprise fusion β integrating enterprise. β new aim integrate borland β tools including delphi programming language |delphi c++builder jbuilder visigenic β cobra-based visibroker c++ java efforts concentrated visigenic software borland unsuccessfully attempted switch entera users visibroker ultimately discontinuing active development entera 2001 even experiencing growth within customer base borland quietly reallocated entera development resources borland licensed rights entera ecube systems llc 2002 provide migration path existing clients enable development entera platform ecube systems started former oec borland engineers architects still wanted develop product ecube systems continues support develop existing entera installations today latest version entera called nxtera added new technology models allows interoperability contemporary middleware technologies including messaging platforms web service standards soap rest july 2009 micro focus acquired borland 75 million february 2012 micro focus ecube systems announced cooperation delivery middleware consulting today ecube micro focus collaborate variety middleware projects category middleware category distributed computing | [
5666,
2087,
6986,
5014,
7637,
7315,
5447
] | Test |
1,258 | 3 | Sun-1:sun-1 sun-1 first generation unix computer workstations servers produced sun microsystems launched may 1982 based cpu board designed andy bechtolsheim graduate student stanford university funded darpa sun-1 systems ran sunos 0.9 port unisoft uniplus v7 port seventh edition unix motorola 68000 microprocessor window system early sun-1 workstations servers used original sun logo series red u laid square rather familiar purple diamond shape used later first sun-1 workstation sold solo systems may 1982 sun-1/100 used original lucasfilm editdroid non-linear editing system sun 1 workstation based stanford university sun workstation designed andy bechtolsheim advised vaughan pratt forest baskett graduate student co-founder sun microsystems heart design multibus cpu memory video display cards cards used sun-1 workstation second-generation design private memory bus allowing memory expanded 2 mb without performance degradation sun 68000 board introduced 1982 powerful single-board computer combined 10 mhz motorola 68000 microprocessor sun designed memory management unit mmu 256 kb zero wait state memory parity 32 kb eprom memory two serial ports 16-bit parallel port intel multibus ieee 796 bus interface single multibus form factor using motorola 68000 processor tightly coupled sun-1 mmu sun 68000 cpu board able support multi-tasking operating system unix included advanced sun designed multi-process two-level memory management unit facilities memory protection code sharing demand paging memory sun-1 mmu necessary motorola 68451 mmu always work correctly 68000 could always restore processor state page fault cpu board included 256 kb memory could replaced augmented two additional memory cards total 2 mb although memory cards used multibus form factor used multibus interface power memory access via smaller private p2 bus synchronous private memory bus allowed simultaneous memory input/output transfers also allowed full performance zero wait state operation memory installing first 1 mb expansion board either 256 kb memory cpu board first 256 kb expansion board disabled on-board i/o included dual serial port uart 16-bit parallel port serial ports implemented intel 8274 uart later nec d7201c uart serial port wired data communications equipment dce port full modem control also console port graphical display installed system serial port b wired data terminal equipment dte port modem control serial ports could also used terminal ports quite often allowing 3 people use one workstation although two graphical displays 16-bit parallel port special purpose port connecting 8-bit parallel port keyboard 8-bit parallel port optical mouse workstations graphical displays parallel port never used general purpose parallel printer port cpu board included fully compatible multibus ieee 796 bus asynchronous bus accommodated devices various transfer rates maintaining maximum throughput 20 address lines could address 1 mb multibus memory 1 mb i/o locations although i/o devices decoded first 64 kb address space sun cpu board fully supported multi-master functionality allowed share multibus dma devices keyboard micro switch 103sd30-2 keytronic p2441 german market memory-mapped bit-mapped frame buffer graphics board resolution 1024Γ1024 pixels 1024Γ800 displayed monitor graphics board included hardware accelerate raster operations ball model hd17h 17-inch video display monitor used ethernet board available originally implementing 3 mbit/s xerox parc ethernet specification later upgraded 3com 10 mbit/s version interphase smd 2180 disk controller could installed connect four fujitsu 84 mb m2313k cdc 16.7 mb 8.35 mb fixed 8.35 mb removable 9455 lark drives boards installed 6 7-slot multibus card cage later documentation shows 13- 19-inch color display available color frame buffer resolution 640Γ512 pixels 640Γ480 displayed monitor board could display 256 colors palette 16 million Β½-inch 9-track reel-to-reel tape drives qic-02 ΒΌ-inch cartridge tape drives also added offering also second generation sun-1 cpu board referred sun-1.5 cpu board sun-1 systems upgraded sun-2 multibus cpu boards identified u suffix model number | [
6329,
1254,
2992,
3614,
1923,
1263,
6505,
6270,
908,
7535,
1185,
1937,
2299,
4418,
2033,
3294,
3026,
4515,
4967,
7010,
5587,
1023,
418,
7114,
1590,
3820,
5079,
8138,
4999,
3673,
5705,
8145,
7781,
971
] | Test |
1,259 | 6 | ECryptfs:ecryptfs ecryptfs enterprise cryptographic filesystem package disk encryption software linux implementation posix-compliant filesystem-level encryption layer aiming offer functionality similar gnupg operating system level part linux kernel since version 2.6.19 ecryptfs package included ubuntu since version 9.04 used implementing ubuntu encrypted home directory feature ecryptfs derived erez zadok cryptfs uses variant openpgp file format encrypted data extended allow random access storing cryptographic metadata including per-file randomly generated session key individual file also encrypts file directory names makes internally longer average one third reason needs uuencode encrypted names eliminate unwanted characters resulting name lowers maximum usable byte name length original file system entry depending used file system lead four times fewer characters example asian utf-8 file names | [
3599,
2547,
7161,
4672,
3626,
2566,
6458,
6117,
5773,
6854,
5437,
5440,
4014,
4375,
6500,
6505,
3350,
5457,
5808,
460,
1534,
7976,
4406,
821,
7258,
5130,
1561,
836,
5843,
3033,
6558,
2683,
5859,
5865,
4444,
5518,
6231,
869,
2704,
1605,
... | Test |
1,260 | 2 | List_of_software_package_management_systems:list software package management systems list software package management systems categorized first package format binary source code hybrid operating system family following package management systems distribute apps binary package form i.e. apps compiled ready installed use following package management systems distribute source code apps either user must know compile packages come script automates compilation process example gobolinux recipe file contains information download unpack compile install package using compile tool cases user must provide computing power time needed compile app legally responsible consequences compiling package following unify package management several linux sometimes unix variants based concept recipe file wide variety package management systems common use today proprietary software operating systems handling installation proprietary free packages | [
1807,
3938,
5017,
1445,
1077,
3613,
5726,
6422,
4675,
7528,
3271,
6428,
2559,
5386,
1100,
6443,
4705,
2581,
7555,
6117,
2594,
2240,
5786,
781,
2619,
5091,
5092,
7956,
5453,
5803,
4759,
7242,
462,
1535,
7619,
6892,
7251,
4400,
1176,
3366,
... | Validation |
1,261 | 4 | X-Wrt:x-wrt x-wrt discontinued set packages patches provide web interface linux distribution openwrt based haserl nothing x window system allows web based management openwrt device originally created package openwrt white russian present found openwrt trunk webif package newer features dual-band support may present 31 october 2013 x-wrt homepage moved google code x-wrt extension openwrt end-user openwrt prior release 8.09 minimal web-management console whereas x-wrt supplied enhanced web-management console webifΒ² 40 control status pages router webifΒ² pages include graphical traffic system status monitoring pages control status network wireless security controls provided data logging booting cron nvram file editing linux package management snmp backup restore firmware upgrade wan vlan wi-fi wep wpa wds mac filtering firewall port forwarding dhcp dnsmasq hostnames ip control routing upnp qos dyndns wol openvpn pptp hotspots | [
2001,
3766,
994,
2390,
4951,
2746,
5571,
1559,
2119,
2219,
7189,
7275,
4162,
6918,
3559,
7752,
7289,
7207,
4177,
7209,
1992
] | Test |
1,262 | 7 | Feng_Office_Community_Edition:feng office community edition feng office community edition formerly opengoo open-source collaboration platform developed supported feng office opengoo community fully featured online office suite similar set features online office suites like g suite microsoft office live zimbra libreoffice online zoho office suite application downloaded installed server feng office could also categorized collaborative software personal information manager software feng office community edition main features include project management document management contact management e-mail time management text documents presentations created edited online files uploaded organized shared independent file formats organization information feng office community edition done using workspaces tags application presents information stored using different interfaces lists dashboards calendar views feng office community edition distributed gnu affero general public license version 3 feng office uses php javascript ajax extjs mysql technology several open source projects served basis development activecollab last open sourced release used initial code base includes ckeditor online document editing server could run operating system system needs following packages client side user required use modern web browser opengoo started degree project faculty engineering university republic uruguay project presented championed software engineer conrado viΓ±a software engineers marcos saiz ignacio de soto developed first prototype thesis professors eduardo fernΓ‘ndez tomΓ‘s laurenzo served tutors conrado ignacio marcos founded opengoo community remain active members core developers thesis approved highest score currently second project opengoo university developed students fernando rodrΓguez ignacio vΓ‘zquez juan pedro del campo project aims build open source web-based spreadsheet december 2009 opengoo name changed feng office community edition | [
6029,
2451,
2608,
2609,
3915,
4759,
5571,
6279,
84,
578,
7975
] | Test |
1,263 | 3 | SuperSPARC:supersparc supersparc microprocessor implements sparc v8 instruction set architecture isa developed sun microsystems 33 40 mhz versions introduced 1992 supersparc contained 3.1 million transistors fabricated texas instruments ti miho japan 0.8 micrometre triple-metal bicmos process two derivatives supersparc supersparc+ supersparc-ii supersparc+ developed remedy design flaws limited supersparc clock frequency thus performance supersparc-ii introduced 1994 major revision improvements enabled microprocessor reach 85 mhz desktop systems 90 mhz heavily cooled sparcserver-1000e supersparc-ii replaced 1995 64-bit ultrasparc implementation 64-bit sparc v9 isa | [
6329,
1254,
1258,
2992,
1185,
1937,
7639,
2299,
4418,
3294,
3026,
4515,
4967,
2950,
418,
1590,
8138,
3747,
1237,
8145,
441,
971,
7781
] | Test |
1,264 | 8 | Qwiki:qwiki qwiki new york city based startup automated video production company qwiki released iphone app automatically turns pictures videos user camera roll movies share company initial product ipad application created video summaries 3 million search terms downloaded 3 million times named apple best search reference application 2011 integrating technology bing search engine launching video creation tools major publishers cooperation abc news company launched qwiki iphone received apple editor choice mentioned honoree 2013 webby two categories time inc. named qwiki one β 10 nyc startups watch β 2013 company investors include cofounders facebook youtube groupon co-founders qwiki inc. louis monier founder altavista search engine doug imbruce qwiki acquired yahoo july 2 2013 reported 50 million qwiki launched alpha testing mode january 24 2011 winning techcrunch disrupt award 2010 soon google offered buy qwiki 100-150 million declined january 2011 qwiki raised 8 million series financing round led primarily facebook co-founder eduardo saverin investors included jawed karim co-founder youtube pradeep sindhu co-founder juniper networks institutional investors included lerer media ventures tugboat ventures contour venture partners individual investor syndicate arranged new york city-based felix investments january 24 2011 qwiki launched public alpha march 2011 qwiki raised additional 1 million groupon lightbank co-founders brad keywell eric lefkofsky bringing total raised date 10.5 million april 2011 qwiki released ipad app version service application additional feature present web version lets user browse google maps displays qwiki annotations certain points linked content relevant locations seven weeks launch qwiki app downloaded 500,000 times february 2012 qwiki relocated new york city bay area offices order closer major media organizations may 2012 qwiki launched new platform bloggers online publishers including partnership abc news television network used qwiki technology abcnews.com goodmorningamerica.com june 2012 bing announced would display qwiki videos bing search pages wikipedia users able play qwikis without leaving search february 2013 qwiki iphone launched app store editors choice app downloaded 125k times first 6 days launch may 2013 time inc. named qwiki one 10 nyc startups watch 2013 july 2013 yahoo acquires qwiki 50 million september 2014 yahoo announced qwiki would close november 1 | [
4575,
6092,
6788,
518
] | Test |
1,265 | 2 | Executable_space_protection:executable space protection computer security executable-space protection marks memory regions non-executable attempt execute machine code regions cause exception makes use hardware features nx bit no-execute bit cases software emulation features however technologies somehow emulate supply nx bit usually impose measurable overhead using hardware-supplied nx bit imposes measurable overhead burroughs 5000 offered hardware support executable-space protection introduction 1961 capability remained successors least 2006 implementation tagged architecture word memory associated hidden tag bit designating code data thus user programs write even read program word data words executed operating system mark writable regions memory non-executable may able prevent stack heap memory areas executable helps prevent certain buffer-overflow exploits succeeding particularly inject execute code sasser blaster worms attacks rely part memory usually stack writeable executable attack fails many operating systems implement available executable space protection policy list systems alphabetical order technologies ordered newest oldest technologies summary gives major features technology supports summary structured technology supplying architecture independent emulation functional processors n't hardware supported supported line processors allow grey-area method explicit nx bit n't exist yet hardware allows one emulated way android 2.3 later architectures support non-executable pages default including non-executable stack heap initial support nx bit x86-64 ia-32 processors support first appeared freebsd -current june 8 2004 freebsd releases since 5.3 release linux kernel supports nx bit x86-64 ia-32 processors support modern 64-bit processors made amd intel transmeta via support feature 64-bit mode x86-64 cpus added 2004 andi kleen later year ingo molnar added support 32-bit mode 64-bit cpus features part linux kernel mainline since release kernel version 2.6.8 august 2004 availability nx bit 32-bit x86 kernels may run 32-bit x86 cpus 64-bit ia-32-compatible cpus significant 32-bit x86 kernel would normally expect nx bit amd64 ia-64 supplies nx enabler patch assures kernels attempt use nx bit present desktop linux distributions fedora ubuntu opensuse enable highmem64 option default default kernels required gain access nx bit 32-bit mode pae mode required use nx bit causes boot failures pre-pentium pro including pentium mmx celeron pentium processors without nx support processors support pae amd k6 earlier transmeta crusoe via c3 earlier geode gx lx vmware workstation versions older 4.0 parallels workstation versions older 4.0 microsoft virtual pc virtual server support pae guest fedora core 6 ubuntu 9.10 later provide kernel-pae package supports pae nx nx memory protection always available ubuntu systems hardware support ran 64-bit kernel 32-bit server kernel 32-bit pae desktop kernel linux-image-generic-pae ubuntu 9.10 later also provides pae mode needed hardware nx cpu feature systems lack nx hardware 32-bit kernels provide approximation nx cpu feature via software emulation help block many exploits attacker might run stack heap memory non-execute functionality also present non-x86 processors supporting functionality many releases red hat kernel developer ingo molnar released linux kernel patch named exec shield approximate utilize nx functionality 32-bit x86 cpus.the exec shield patch released linux kernel mailing list may 2 2003 rejected merging base kernel involved intrusive changes core code order handle complex parts emulation exec shield legacy cpu support approximates nx emulation tracking upper code segment limit imposes cycles overhead context switches intents purposes immeasurable legacy cpus without nx bit exec shield fails protect pages code segment limit mprotect call mark higher memory stack executable mark memory limit executable well thus situations exec shield schemes fails cost exec shield low overhead exec shield checks two elf header markings dictate whether stack heap needs executable called pt_gnu_stack pt_gnu_heap respectively exec shield allows controls set binary executables libraries executable loads library requiring given restriction relaxed executable inherit marking restriction relaxed pax nx technology emulate nx functionality use hardware nx bit pax works x86 cpus nx bit 32-bit x86 linux kernel still ship pax may 2007 patch must merged manually pax provides two methods nx bit emulation called segmexec pageexec segmexec method imposes measurable low overhead typically less 1 constant scalar incurred due virtual memory mirroring used separation execution data accesses segmexec also effect halving task virtual address space allowing task access less memory normally could problem task requires access half normal address space rare segmexec cause programs use system memory i.e ram restricts much access 32-bit cpus becomes 1.5 gb rather 3 gb pax supplies method similar exec shield approximation pageexec speedup however higher memory marked executable method loses protections cases pax falls back older variable-overhead method used pageexec protect pages cs limit may become quite high-overhead operation certain memory access patterns pageexec method used cpu supplying hardware nx bit hardware nx bit used thus significant overhead incurred pax supplies mprotect restrictions prevent programs marking memory ways produce memory useful potential exploit policy causes certain applications cease function disabled affected programs pax allows individual control following functions technology binary executable pax ignores pt_gnu_stack pt_gnu_heap past pax configuration option honor settings option removed security reasons deemed useful results pt_gnu_stack normally attained disabling mprotect restrictions program normally mprotect stack load may always true situations fails simply disabling pageexec segmexec effectively remove executable space restrictions giving task protections executable space non-pax system macos intel supports nx bit cpus supported apple mac os x 10.4.4 β first intel release β onwards mac os x 10.4 supported nx stack protection mac os x 10.5 64-bit executables nx stack heap w^x protection includes x86-64 core 2 later 64-bit powerpc g5 macs netbsd 2.0 later december 9 2004 architectures support non-executable stack heap architectures per-page granularity consist alpha amd64 hppa i386 pae powerpc ibm4xx sh5 sparc sun4m sun4d sparc64 architectures support region granularity i386 without pae powerpc macppc architectures benefit non-executable stack heap netbsd default use software emulation offer features architectures technology openbsd operating system known w^x marks writable pages default non-executable processors support 32-bit x86 processors code segment set include part address space provide level executable space protection openbsd 3.3 shipped may 1 2003 first include w^x solaris supported globally disabling stack execution sparc processors since solaris 2.6 1997 solaris 9 2002 support disabling stack execution per-executable basis added starting windows xp service pack 2 2004 windows server 2003 service pack 1 2005 nx features implemented first time x86 architecture executable space protection windows called data execution prevention dep windows xp server 2003 nx protection used critical windows services exclusively default x86 processor supported feature hardware nx features turned automatically windows xp/server 2003 default feature supported x86 processor protection given early implementations dep provided address space layout randomization aslr allowed potential return-to-libc attacks could feasibly used disable dep attack pax documentation elaborates aslr necessary proof-of-concept produced detailing method dep could circumvented absence aslr may possible develop successful attack address prepared data corrupted images mp3s known attacker microsoft added aslr functionality windows vista windows server 2008 platform dep implemented automatic use pae kernel 32-bit windows native support 64-bit kernels windows vista dep works marking certain parts memory intended hold data nx xd bit enabled processor understands non-executable windows version vista whether dep enabled disabled particular process viewed processes/details tab windows task manager windows implements software dep without use nx bit microsoft safe structured exception handling safeseh properly compiled applications safeseh checks exception raised program execution exception handler one defined application originally compiled effect protection attacker able add exception handler stored data page unchecked program input nx supported enabled default windows allows programs control pages disallow execution api well section headers pe file api runtime access nx bit exposed win32 api calls virtualalloc ex virtualprotect ex page may individually flagged executable non-executable despite lack previous x86 hardware support executable non-executable page settings provided since beginning pre-nx cpus presence 'executable attribute effect documented function result programmers used properly pe file format section specify executability execution flag existed since beginning format standard linkers always used flag correctly even long nx bit windows able enforce nx bit old programs assuming programmer complied best practices applications work correctly nx actually enforced cases problems microsoft .net runtime problems nx bit updated microsoft xbox although cpu nx bit newer versions xdk set code segment limit beginning kernel .data section code point normal circumstances starting version 51xx change also implemented kernel new xboxes broke techniques old exploits used become tsr however new versions quickly released supporting new version fundamental exploit unaffected code written executed runtimeβa jit compiler prominent exampleβthe compiler potentially used produce exploit code e.g using jit spray flagged execution therefore would trapped return-oriented programming allow attacker execute arbitrary code even executable space protection enforced | [
449,
5627,
4662,
2458,
895,
2549,
6002,
6180,
1180,
4779,
6725,
5571,
3635,
1658,
1019,
5055,
2226,
2318,
755,
3220,
512,
5190,
4985,
4729,
7581,
5697,
5962,
2885,
4098,
5530,
6236,
6586,
352,
1427,
971,
3836,
1805
] | Test |
1,266 | 4 | Seal_(emblem):seal emblem seal device making impression wax clay paper medium including embossment paper also impression thus made original purpose authenticate document wrapper one modern envelope cover container package holding valuables objects seal-making device also referred seal matrix die imprint creates seal impression rarely sealing impression made purely relief resulting greater pressure paper high parts matrix touch seal known dry seal cases ink another liquid liquefied medium used another color paper traditional forms dry seal design seal matrix intaglio cut flat surface therefore design impressions made relief raised surface design impression reverse mirror-image matrix especially important script included design often case paper embossed behind matrix impression read way matrix impression relief however engraved gems often carved relief called cameo context giving counter-relief intaglio impression used seals process essentially mould seals always given single impression essentially flat surface medieval europe two-sided seals two matrices often used institutions rulers towns bishops kings make two-sided fully three-dimensional impressions wax tag piece ribbon strip parchment running pendent seal impressions dangled documents authenticated attachment tag sewn otherwise attached single-sided seals treated way jurisdictions consider rubber stamps specified signature-accompanying words seal l.s abbreviation locus sigilli place seal legal equivalent i.e equally effective substitute seal united states word seal sometimes assigned facsimile seal design monochrome color may used variety contexts including architectural settings flags official letterheads thus example great seal united states among uses appears reverse one-dollar bill several seals u.s. states appear respective state flags europe although coats arms heraldic badges may well feature contexts well seals seal design entirety rarely appears graphical emblem used mainly originally intended impression documents study seals known sigillography sphragistics seals used earliest civilizations considerable importance archaeology art history ancient mesopotamia carved engraved cylinder seals stone materials used could rolled along create impression clay could repeated indefinitely used labels consignments trade goods purposes normally hollow presumed worn string chain round neck many images often finely carved writing others ancient egypt seals form signet-rings see including names kings found tend show names hieroglyphics recently seals come light south arabia datable himyarite age one example shows name written aramaic yitsαΈ₯aq bar αΈ₯anina engraved reverse read correctly impression beginning 3rd millennium bc middle ages seals various kinds production aegean islands mainland greece early minoan age formed soft stone ivory show particular characteristic forms middle minoan age new set seal forms motifs materials appear hard stone requires new rotary carving techniques late bronze age time par excellence lens-shaped seal seal ring continued archaic classical hellenistic periods form pictorial engraved gems major luxury art form became keenly collected king mithridates vi pontus first major collector according pliny elder collection fell booty pompey great deposited temple rome engraved gems continued produced collected 19th century pliny also explained significance signet ring time ring worn little finger known yinzhang china injang korea inshΕ japan αΊ₯n giΓ‘m αΊ₯n chΖ°Ζ‘ng vietnam seals used east asia form written identification since qin dynasty 221 bcβ seals han dynasty impressed soft clay tang dynasty red ink made cinnabar normally used even modern times seals often known chops local colloquial english still commonly used instead handwritten signatures authenticate official documents financial transactions individuals organizations official seals often multiple seals different sizes styles different situations east asian seals usually bear names people organizations represented also bear poems personal mottoes sometimes types seals large seals bear names mottoes used authenticate official documents seals important east asia foreigners frequently conduct business also commission engraving personal seals east asian seals carved variety hard materials including wood soapstone sea glass jade east asian seals traditionally used red oil-based paste consisting finely ground cinnabar contrasts black ink traditionally used ink brush red chemical inks commonly used modern times sealing documents seal engraving considered form calligraphy east asia like ink-brush calligraphy several styles engraving engraving styles emulate calligraphy styles many styles highly stylized characters represented seal difficult untrained readers identify seal engravers considered artists past several famous calligraphers also became famous engravers seals carved famous engravers owned famous artists political leaders become valuable historical works art seals commissioned individuals carved artists every seal unique engravers often personalize seals create materials seals styles engraving typically matched personalities owners seals traditional modern conservative expressive seals sometimes carved owners zodiac animals tops seals seals also sometimes carved images calligraphy sides although utilitarian instrument daily business east asia westerners non-asians seldom see asian seals except asian paintings calligraphic art traditional paintings taiwan china japan korea rest east asia watercolor paintings silk paper surface red ink seals adhere east asian paintings often bear multiple seals including one two seals artist seals owners paintings east asian seals predecessors block printing direct line descent seals used ancient world used medieval post-medieval europe used legal contexts western world present day seals historically often impressed sealing wax often simply described wax middle ages generally comprised compound two-thirds beeswax one-third kind resin post-medieval period resin ingredients came dominate early middle ages seals lead properly bullae latin common use east west notable exception documents bulls issued papal chancery leaden authentications fell favour western christendom byzantine emperors sometimes issued documents gold seals known golden bulls wax seals used fairly regular basis western royal chanceries end 10th century england wax seals survived earlier date norman conquest although earlier matrices known recovered archaeological contexts earliest gold double-sided matrix found near postwick norfolk dated late 7th century next oldest mid-9th-century matrix bishop ethilwald probably Γ¦thelwold bishop east anglia practice sealing wax gradually moved social hierarchy monarchs bishops great magnates petty knights end 12th century ordinary freemen middle 13th century also came used variety corporate bodies including cathedral chapters municipalities monasteries etc. validate acts executed name traditional wax seals continue used certain high-status ceremonial documents 20th century gradually superseded many contexts inked dry embossed seals rubber stamps many instruments formerly required seals validity e.g deeds covenants unusual countries west private citizens use seals central eastern europe however east asia signature alone considered insufficient authenticate document kind business managers well many book-keepers employees personal seals normally containing text name position applied letters invoices issued similar documents europe today plastic self-inking stamps notaries also still use seals daily basis least britain registered notary individual personal seal registered authorities includes name pictorial emblem often animalβthe combination found many seals ancient greece seals used primarily authenticate documents specifically carry legal import two main ways seal may attached document may applied directly face paper parchment applied seal may hang loose pendent seal pendent seal may attached cords ribbons sometimes owner livery colors two ends strip tag parchment threaded holes slots cut lower edge document document often folded double point plica provide extra strength alternatively seal may attached narrow strip material document case usually parchment sliced folded tail tongue detached object cases help ensure authenticity maintaining integrity relationship document seal prevent seal reuse forger tries remove applied seal document almost certainly break pendent seal easily detached cutting cords strips parchment forger would great difficulty attaching another document least cords parchment normally knotted inside seal would almost certainly break middle ages majority seals pendent attached legal instruments letters patent i.e open letters conferring rights privileges intended available view case important transactions agreements seals parties arrangement well witnesses might attached document executed would carry several seals governments still attach pendent seals letters patent applied seals contrast originally used seal document closed say document would folded seal applied way item could opened without seal broken applied seals used letters close letters intended recipient parcels indicate whether item opened tampered since left sender well providing evidence item actually sender forgery post-medieval period seals came commonly used way private letters letter writer would fold completed letter pour wax joint formed top page impress ring seal matrix governments sometimes sent letters citizens governmental seal eyes known letters secret wax seals might also used letterlocking techniques ensure intended recipient would read message general seals longer used ways except ceremonial purposes however applied seals also came used legal instruments applied directly face document need break use continues historically majority seals circular design although ovals triangles shield-shapes patterns also known design generally comprised graphic emblem sometimes always incorporating heraldic devices surrounded text legend running around perimeter legend often consisted merely words seal name owner either latin local vernacular language latin word sigillum frequently abbreviated simple occasionally legend took form motto middle ages became customary seals women ecclesiastics given vesica pointed oval shape central emblem often standing figure owner case ecclesiastical seals saint medieval townspeople used wide variety different emblems seals included image relating work sealing wax naturally yellowish pale brownish tone could also artificially colored red green many intermediary variations medieval royal chanceries different colours wax customarily used different functions departments state distinguish grants decrees made perpetuity ephemeral documents matrices pendent seals sometimes accompanied smaller counter-seal would used impress small emblem reverse impression cases seal counter-seal would kept two different individuals order provide element double-checking process authentication sometimes large official seal might custody chancery officials would need counter-sealed individual whose name applied monarch mayor town counter-seal might carried person perhaps secured chain cord later take form signet-ring would necessarily smaller pendent seals double-sided elaborate equally-sized obverses reverses impression would formed pressing sandwich matrices wax firmly together means rollers later lever-press screw press certain medieval seals complex still involving two levels impression side wax would used create scene three-dimensional depth death seal-holder sign continuity son heir might commission new seal employing symbols design-elements used father likely practice factor emergence hereditary heraldry western europe 12th century use seal men wealth position common christian era high functionaries church adopted habit incidental allusion one st. augustine letters 217 victorinus indicates used seal practice spread seems taken granted king clovis beginning merovingian dynasty later ecclesiastical synods require letters bishop seal given priests reason lawfully quit proper diocese ruling enacted chalon-sur-saΓ΄ne 813 pope nicholas century complained bishops dΓ΄le reims contra morem contrary custom sent letters unsealed custom bishops possessing seals may date assumed pretty general british museum collection earliest bishop seals preserved william de st-calais bishop durham 1081β96 st. anselm archbishop canterbury 1093β1109 seals also affixed architectural engineering construction documents land survey drawings certify identity licensed professional supervised development depending authority jurisdiction project seals may embossed signed stamped signed certain situations computer generated facsimile original seal validated digital certificate owned professional may attached security protected computer file identities professional seals determine legal responsibility errors omissions cases financial responsibility correction well territory responsibility e.g state minnesota jurisdictions especially canada legal requirement professional engineer seal documents accordance engineering profession act regulations professional engineers may also legally entitled seal document prepare seal identifies work performed direct supervision licensed professional engineer assures document recipient work meets standards expected experienced professionals take personal responsibility judgments decisions importance seal means authentication necessitated authority passed new hands old seal destroyed new one made pope dies first duty cardinal camerlengo obtain possession ring fisherman papal signet see broken similar practice prevailed middle ages often alluded historians seems matter ceremony example death robert holy island bishop durham 1283 chronicler robert greystones reports burial seal publicly broken presence master robert avenel matthew paris gives similar description breaking seal william trumpington abbot st albans 1235 practice less widely attested case medieval laypeople certainly occurred occasion particularly 13th 14th centuries silver seal matrices found graves 12th-century queens france probably deliberately buried means cancelling king james ii england dethroned glorious revolution 1688/9 supposed thrown great seal realm river thames flight france order ensure machinery government would cease function unclear much truth story certainly seal recovered james successors william iii mary used great seal matrix fairly crudely adapted β possibly quite deliberately order demonstrate continuity government related practice destruction found among blacksmiths touchmark stamp used hot metal show made destroyed upon death signet rings flat bezel usually wider rest hoop decorated normally intaglio leave raised relief impression design ring pressed onto soft sealing wax similar material used since ancient times personal seal individual recent times design generally crest made engraving either metal engraved gems generally semiprecious agate frequent material especially carnelian banded agate like sardonyx banding makes impression contrast ground smaller classical engraved gems probably originally worn signet rings seals necklace metal signet rings also cast may cheaper yields weaker material wearing signet rings latin signum meaning sign goes back ancient egypt distinctive personal signature developed antiquity documents needed seal seal pharaoh mentioned book genesis genesis 41:42 removing signet ring hand pharaoh put joseph hand arrayed garments fine linen put gold chain around neck although less common today rarely actually used intended purpose seals signet rings still worn especially among armigerous european cultures used attest authority bearer ring also seen symbol power one explanation inclusion regalia certain monarchies death pope destruction signet ring prescribed act clearing way sede vacante subsequent election new pope signet rings also used souvenir membership attribute e.g. class ring typically bear coat arms crest school alternative one stone one may also initials engraved sign personal stature less noble classes began wearing using signet rings early 13th century 17th century signet rings fell favor upper levels society replaced means mounting carrying signet 18th century though signet rings became popular 19th century men classes wore since least 16th century also pseudo-signet rings engraving reversed mirror image impression read correctly rings used since antiquity spy identification espionage world war ii us air force personnel would privately purchase signet rings hidden compartment would hold small compass hidden message mi9 purchased number signet rings regent street jewelers used conceal compasses expression seal approval refers formal approval regardless whether involves seal external marking authoritative person institute also part formal name certain quality marks | [
5823,
3329,
3473,
6672,
3794,
2287
] | Test |
1,267 | 9 | Evince:evince evince document viewer pdf postscript djvu tiff xps dvi formats designed gnome desktop environment developers evince intended replace multiple gnome document viewers single simple application evince motto sums project aim simply document viewer gnome releases included evince since gnome 2.12 september 2005 evince code consists mainly c small part code interfaces poppler written c++ large number linux distributions β including ubuntu fedora linux mint β include evince default document-viewer evince free open-source software subject requirements gnu general public license version 2 later evince faq highlights meaning word evince show express something clearly evince began rewrite gpdf support programmers started find unwieldy maintain evince quickly surpassed functionality gpdf replaced gpdf ggv september 2005 release gnome 2.12 one time windows version evince included valo-cd collection best windows programs evince incorporates integrated search displays number results found highlights results page users optionally display left sidebar viewer thumbnails pages assist page navigation within document documents support indices evince gives option showing document index quickly moving one section another evince show two pages time left right offers full-screen slide-show views evince allows selection text pdf files allows users highlight copy text documents made scanned images pdf includes ocr data evince used obey drm restrictions pdf files may prevent copying printing converting pdf files however made optional turned default gconf since version 3.18.2 evince allows text highlight annotations documents evince supports many different single multi-page document formats | [
7959,
2091,
893,
6883,
7159,
2728,
4685,
6011,
5571,
6015,
6016,
578,
1017,
2581,
499,
2131,
6557,
1769,
761,
5523,
3152,
7223,
2706,
2260,
1435
] | Test |
1,268 | 9 | Move_assignment_operator:move assignment operator c++ programming language move assignment operator codice_1 used transferring temporary object existing object move assignment operator like c++ operators overloaded like copy assignment operator special member function move assignment operator explicitly defined compiler generates implicit move assignment operator c++11 newer parameter move assignment operator rvalue reference type object defines move assignment operator move assignment operator different move constructor move assignment operator called existing object move constructor called object created operation thereafter object data longer valid overload move assignment operator signature function must operator= data successfully overload move assignment operator following conditions must met consider following move assignment operator simple string class class string | [
1361
] | Test |
1,269 | 6 | Semantic_file_system:semantic file system semantic file systems file systems used information persistence structure data according semantics intent rather location current file systems allows data addressed content associative access traditional hierarchical file-systems tend impose burden example sub-directory layout contradicting user perception files would stored tag-based interface alleviates hierarchy problem enables users query data intuitive fashion semantic file systems raise technical design challenges indexes words tags elementary signs sort created constantly updated maintained cached performance offer desired random multi-variate access files addition underlying mostly traditional block-based filesystem research specifications implementations | [
3599,
2547,
7161,
4672,
6431,
3626,
5049,
6117,
759,
6854,
5437,
4375,
6500,
6505,
5457,
460,
1534,
7976,
4406,
821,
7258,
5130,
1561,
836,
5843,
2313,
1209,
6558,
2683,
5859,
7290,
5865,
4444,
5518,
6231,
869,
2704,
1605,
174,
2710,
16... | Test |
1,270 | 9 | Von_Neumann_programming_languages:von neumann programming languages von neumann language programming languages high-level abstract isomorphic copies von neumann architectures current programming languages fit description likely consequence extensive domination von neumann computer architecture past 50 years differences fortran c even java although considerable ultimately constrained three based programming style von neumann computer example java objects executed parallel asynchronous message passing attribute-based declarative addressing java would group isomorphism von neumann programming languages architectures following manner john backus asserted assignment statements von neumann languages split programming two worlds first world consists expressions orderly mathematical space potentially useful algebraic properties computation takes place second world consists statements disorderly mathematical space useful mathematical properties structured programming seen limited heuristic apply space though backus claimed exists computer science vicious cycle long-standing emphasis von neumann languages continued primacy von neumann computer architecture dependency made non-von neumann languages uneconomical thus limited development lack widely available effective non-von neumann languages deprived computer designers motivation intellectual foundation needed develop new computer architectures examples non -von neumann languages apl fp fl j lucid ngl zpl mercury plankalkΓΌl many modern processors contain multiple processing cores multi-threaded programming usually efficient way use computational power single program modern processors highly optimized techniques including out-of-order execution complex logic detect done without violating von neumann semantics logical programming model separate instruction data caches widely used making hardware modified harvard architecture logic detect cases optimization fails able slowly execute self-modifying code specialized processors including gpus wide mimd devices general-purpose cpus commonly multiple cores one fast enough many programs fast enough without parallelizing single tasks threads commonly used deal asynchronous inputs outputs especially gui general-purpose cpus technically mimd devices usually hardware designed ground mimd programming referred mimd many widely used programming languages c c++ java ceased strictly von neumann adding support parallel processing form threads however categorically non -von neumann languages also functional languages achieved widespread use | [
6507,
3531,
2764,
4864,
1549,
1892,
4847,
3630,
2803,
1774,
1381,
1435
] | Test |
1,271 | 4 | Nitro_Zeus:nitro zeus nitro zeus project name well funded comprehensive cyber attack plan created mitigation strategy stuxnet malware campaign aftermath unlike stuxnet loaded onto system design phase affect proper operation nitro zeus objectives built system design phase unbeknownst system users built-in feature allows assured effective cyber attack system users information existence raised research interviews carried alex gibney zero days documentary film proposed long term widespread infiltration major iranian systems would disrupt degrade communications power grid vital systems desired cyber attackers achieved electronic implants iranian computer networks project seen one pathway alternatives full-scale war requirement type plan iran nuclear deal signed though functioning implants iran critical scada infrastructure systems likely removed | [
74
] | Test |
1,272 | 2 | Bruce_Ellis:bruce ellis bruce ellis born 1960 nicknamed brucee computer scientist bell labs 1980s 90s educated university sydney australia earned first class honours university medal worked basser branch unix 32v work continued bell labs involved development later research versions unix software blit terminal plan 9 bell labs inferno operating systems well ventures network processing froggie recreationally also dabbled computer go computational linguistics rob pike responsible infamous mark v shaney early 1980s leaving bell labs consulting lecturing around world working ozinferno operating system continuation work done research version inferno currently living sydney works include mash shell 64 bit support plan 9 crosscompilers suite various postscript interpreters currently used commercial printer manufacturers currently chief software architect rangboom working plan9 emulation environment 9ee disparate platforms | [
1314
] | Train |
1,273 | 4 | ObserveIT:observeit observeit insider threat management software company observeit provides insider threat security solutions including employee monitoring user activity monitoring behavioral analytics policy enforcement digital forensics 1,700 customers 87 countries company software deployed primarily financial services healthcare manufacturing tech services telco retail markets co-founders gaby friedlander avi amos founded observeit israel 2006 observeit initially focused remote vendor monitoring expanded monitor potential vendor contractor employee insider threats goal software help organizations streamline insider threat incident investigation process prevent data loss 2014 bain capital ventures invested 20 million observeit opened u.s. headquarters boston leadership ceo mike mckee observeit recently released version 7.5 software april 2006 observeit monitors β invisible component β infrastructure β people april 2010 lieberman software observeit partner monitor audit privileged access activity within enterprise january 2012 fujitsu partners observeit bring seamless security monitoring applications enterprises hong kong macau november 2013 observeit unveils observeit 5.6.8 april 2014 observeit appoints paul brady ceo september 2014 observeit releases v5.7 april 2015 observeit receives three awards 2015 security industry global excellence awards may 2015 observeit launches cloudthreat amazon web services security solution september 2015 network world new product week february 2016 observeit introduces first software prevent insider threat march 2018 observeit releases v7.5 | [
6920
] | Test |
1,274 | 9 | John_C._Mitchell:john c. mitchell john clifford mitchell professor computer science courtesy electrical engineer stanford university published area programming language theory computer security john c. mitchell vice provost teaching learning stanford university mary gordon crary family professor computer science electrical engineering stanford university co-director stanford computer security lab professor courtesy education member steering committee stanford university cyber initiative mitchell vice provost stanford university since 2012 first inaugural vice provost online learning broader role teaching learning mitchell direction office vice provost teaching learning vptl advancing teaching learning faculty-driven initiatives research transforming education stanford classrooms beyond mitchell first research project online learning started 2009 six undergraduate students built stanford courseware innovative platform expanded support interactive video discussion courseware served foundation initial flipped classroom experiments stanford helped inspire first massive open online courses moocs stanford captured worldwide attention 2011 office vice provost online learning established august 2012 mitchell served john l. hennessy β stanford university 10th president β special assistant educational technology chaired faculty committee established initial priorities stanford developed intellectual property guidelines publicly released online courses help build faculty experience catalogue online material vice provost mitchell launched faculty seed grant program summer 2012 program helped faculty across campus transform stanford campus courses release public courses world generating informed discussion debate among faculty process addition supporting delivery digital course content vptl engineering team working expand features lagunita stanford instance open-source release edx platform mitchell team partnership edx announced release open edx june 2013 open-source hosting platform providing customizable alternative colleges universities supporting open educational research innovation stanford online courses generating wealth course participant data collaboration stanford centers scholarship lytics lab jointly supervised mitchell mitchell stevens candace thille graduate school education vptl playing key role evaluating educational outcomes improving online learning based data-driven research iterative design may 2014 mitchell team issued comprehensive report share benchmark information institutions higher education mitchell holds b.s stanford university m.s ph.d. massachusetts institute technology mit served editorial board ten academic journals acted consultant advisor numerous companies spent sabbaticals newton institute mathematical science coverity inc. mitchell author two books 170 research papers among most-cited scholars computer science together gordon plotkin noted connection existential types abstract data types mitchell early computer science research focused programming analysis design played pivotal role developing type theory foundation programming languages view dominant field past 15 years research focused computer security developing analysis methods improving network protocol security authorization access control web security privacy mitchell forefront web network security research education decade helped train thousands students programming languages hundreds expert-level professionals area cyber-security efforts resulted development concepts used popular java programming language improved security widely used wireless networking protocols contributed security architecture chrome browser components modern web august 2012 mitchell appointed stanford president john l. hennessy vice provost online learning newly created position responsible overseeing stanford online learning initiatives | [
4405,
1243,
6995,
4302,
3895,
2662,
2577,
1805
] | Test |
1,275 | 7 | Talygen_Business_Intelligence:talygen business intelligence talygen business intelligence officially talygen inc. software development company palo alto known eponymous web based business automation software first gained publicity january 2014 pc magazine included list top ten tools small biz ces 2014 idea behind software product described charming frankfurter allgemeine talygen business intelligence company flagship product software tool draws cloud technology perform customer relationship management expense accounting manage leave sic many administrative issues enterprises | [
2961
] | Test |
1,276 | 5 | Lunascape:lunascape lunascape web browser developed lunascape corporation tokyo japan unusual contains three rendering engines gecko used mozilla firefox webkit used apple safari trident used microsoft internet explorer feature common avant web browser user switch layout engines seamlessly lunascape available windows android platforms well ipad iphone lunascape released october 2001 founders college browser became popular hidekazu kondo established lunascape corporation august 2004 pursuing phd hidekazu kondo became ceo lunascape corporation additionally lunascape selected exploratory software project commissioned japanese government company branched united states june 2008 based sunnyvale california lunascape introduced browser internationally december 2008 | [
4655,
6802,
5378,
7537,
6809,
393,
3291,
2574,
2577,
6452,
3655,
4352,
4725,
4357,
1136,
6858,
84,
445,
1152,
1525,
7975,
7628,
5821,
5127,
6540,
3383,
8006,
8009,
3043,
1970,
6221,
520,
3057,
6582,
7692,
5887,
6966,
5542,
5571,
7015,
7... | Test |
1,277 | 9 | ActivePerl:activeperl activeperl distribution perl activestate formerly part sophos windows macos linux solaris aix hp-ux main editions available including community free development use several paid tiers enterprise includes support oem licensing includes version perl package manager ppm installing packages cpan etc windows version includes active scripting component windows script host wsh called perlscript isapi module embedding within internet information services iis perlscript initially solely activex scripting engine produced company activestate use microsoft internet information services iis allows programmers use perl-based code addition place vbscript jscript context web servers running asp protocol subsequently apache :asp created apache web server allows coding perl neither vbscript jscript perlscript also used write windows script host-based programs similar vbscript standalone perlscripts executed created file extension .pls case require enclosing xml e.g .pls files gain access drag drop wsh functionality perlscripts extension wsf require xml tags specify job id script language e.g wsf perlscripts gain access wsh drag drop functionality similarly perl droplets now-obsolete macperl wsh objects available via implicitly created wscript object | [
3683,
5983,
4759,
900,
8183,
6991,
3106,
3290,
578,
3031,
5416,
3135,
422,
5248,
6305,
8029,
1598,
6233
] | Test |
1,278 | 4 | Director_of_the_National_Security_Agency:director national security agency director national security agency dirnsa highest-ranking official national security agency defense agency within u.s. department defense director nsa also concurrently serves chief central security service chcss commander u.s. cyber command uscybercom dirnsa/chcss officeholder reports secretary defense intelligence cdruscybercom secretary defense according united states code director nsa recommended secretary defense nominated appointment president nominee must confirmed via majority vote senate accordance department defense directive 5100.20 dated 23 december 1971 director nsa must always commissioned officer military services assignment currently part tri-hatted position director nsa appointed grade four-star general admiral period incumbency deputy director always technically experienced civilian armed forces security agency predecessor national security agency existed 1949 1952 | [
4210,
1344,
4666,
820,
6627,
3716,
4429,
7917,
5412,
5767,
5509,
4988,
1594,
2343,
4996,
1701,
4201
] | Test |
1,279 | 2 | Computer_Systems_Research_Group:computer systems research group computer systems research group csrg research group university california berkeley dedicated enhancing unix operating system funded defense advanced research projects agency professor bob fabry berkeley acquired unix source license 1974 group started modify unix distributed version berkeley software distribution bsd april 1980 fabry signed contract darpa develop unix even accommodate specific requirements arpanet funding fabry created computer systems research group berkeley sockets api berkeley fast file system group significant innovations sockets interface solved problem supporting multiple protocols e.g xns tcp/ip extended unix everything file notion network protocols fast file system increased block allocation size 512 bytes 4096 bytes larger improving disk transfer performance also allowing micro-blocks small 128 bytes improved disk utilization another noteworthy contribution job control signals allowed user suspend job key-press control-z continue running job background c shell noteworthy versions bsd 3.0 bsd first version bsd support virtual memory 4.0 bsd included job-control ctrl-z functionality suspend restart running job special 4.15 interim bsd version released using bbn tcp/ip 4.2 bsd included full tcp/ip stack ffs nfs support early 1980s csrg best-known non-commercial unix developer majority unix sites used least berkeley software included csrg work unix system v. 1970s 1980s t/usl raised commercial licensing fee unix 20,000 100,000β 200,000 became big problem small research labs companies used bsd csrg decided replace source code originated succeeded 1994 n't agree took berkeley court settlement 1994 csrg distributed last versions called 4.4bsd-lite bsd-licensed 4.4bsd-encumbered unix-licensed group disbanded 1995 leaving significant legacy freebsd openbsd netbsd dragonfly bsd based 4.4bsd-lite distribution continue play important role open-source unix community today including dictating style c programming used via knf style man page alongside free software foundation linux csrg laid foundations open source community former members include keith bostic bill joy marshall kirk mckusick samuel j leffler michael j. karels among others corporations sun microsystems berkeley software design sleepycat software later acquired oracle considered spin-off companies csrg berkeley software design led robert kolstad led development bsd unix supercomputers convex computer mach kernel | [
5268,
3838,
1341,
5275,
5101,
7514,
6794,
6085,
1824,
3856,
7894,
908,
481,
3457,
5571,
2117,
1193,
578,
738,
5933,
6367,
6369,
2583,
6918,
3986,
594,
4441,
6477,
2512,
424,
6489,
6583,
443,
1435
] | Test |
1,280 | 7 | Zettagrid:zettagrid zettagrid pty ltd australian based public cloud computing provider offer infrastructure service iaas backup baas disaster recovery draas services company management architecture applications development divisions operate perth western australia sales offices sydney jakarta zettagrid launched may 2010 offering vmware vsphere virtual private server hosting perth western australia july 2011 zettagrid launched virtual data centre service based upon vmware vcloud amazon web services rackspace microsoft azure macquarie telecom telstra optus | [
2961,
2700,
4692,
5064,
4554,
7756
] | Test |
1,281 | 6 | Hard_link:hard link computing hard link directory entry associates name file file system directory-based file systems must least one hard link giving original name file term β hard link β usually used file systems allow one hard link file creating additional hard link effect giving one file multiple names e.g different names different directories independently connect data disk none depends others causes alias effect e.g file opened one names changes made content changes also visible file opened alternative name contrast soft link β shortcut β file direct link data rather short file contains text file name location gives direct access yet another file name within directory name contained referred soft link may either hard link another soft link also creates aliasing different way every directory file special contains list file names maintained file system since directories files multiple hard links directories possible could create loops within structure directories rather branching structure like tree reason creation hard links directories sometimes forbidden multiple hard links β multiple directory entries file β supported posix-compliant partially posix-compliant operating systems linux android macos also windows nt4 later windows nt operating systems support also depends type file system used instance ntfs file system supports multiple hard links fat refs posix-compliant partially posix-compliant operating systems unix-like systems additional hard links existing files created system call ln link command-line utilities codice_1 command reveal many hard links point given file link count also included output codice_2 microsoft windows hard links created using codice_3 command windows nt 6.0 later systems windows vista earlier systems windows xp windows server 2003 using codice_4 windows api windows 2000 onwards includes createhardlink call create hard links deletefile used remove getfileinformationbyhandle used determine number hard links associated file hard links require ntfs partition starting windows vista hard links used windows component store winsxs keep track different versions dlls stored hard disk drive unix-like emulation compatibility software running windows cygwin subsystem unix-based applications allow use posix interfaces windows process unlinking dissociates name data volume without destroying associated data data still accessible long least one link points still exists last link removed space considered free process called undeleting allows recreation links data longer associated name however process available systems often reliable file deleted added free space map re-use portion deleted file space claimed new data undeletion unsuccessful previous data overwritten may result cross-linking new data leading filesystem corruption additionally deleted files solid state drives may erased time storage device reclamation free space file systems support hard links use reference counting integer value stored physical data section integer represents total number hard links created point data new link created value increased one link removed value decreased one link count becomes zero operating system usually automatically deallocates data space file process file opened access may choose immediately either performance enable undelete command maintenance value guarantees dangling hard links pointing nowhere happen symbolic links filesystem file associated inode preserved long single hard link directory reference points process keeps associated file open relieving burden accounting programmer user simple method file system track use given area storage zero values indicate free space nonzero values indicate used space posix-compliant operating systems many unix-variants reference count file directory returned stat fstat system calls codice_5 field codice_6 figure right two hard links named link a.txt link b.txt point physical data file link a.txt opened editor modified saved changes visible file link b.txt opened viewing since filenames point data opened posix systems associated file descriptor remains valid opening even original file moved true file opened link b.txt β name associated data editors however break hard link concept e.g emacs opening file link b.txt editing emacs first renames link b.txt link b.txt~ loads link b.txt~ editor saves modified contents newly created link b.txt using approach two hard links link a.txt link b.txt~ backup file link b.txt would one link longer shares data link a.txt behavior changed using emacs variable codice_7 number hard links physical data may created access data user needs specify name existing link operating system resolve location actual data one links removed posix unlink function example unix codice_8 command data still accessible link remains links removed process file open space occupied data freed allowing reused future semantic allows deleting open files without affecting process uses technique commonly used ensure temporary files deleted automatically program termination including case abnormal termination prevent loops filesystem keep interpretation parent directory consistent many modern operating systems allow hard links directories unix system v allowed superuser permission make links mac os x v10.5 leopard newer use hard links directories time machine backup mechanism symbolic links ntfs junction points generally used instead purpose hard links created files volume link file different volume needed may created symbolic link maximum number hard links single file limited size reference counter unix-like systems counter usually machine-word-sized 32- 64-bit 4,294,967,295 18,446,744,073,709,551,615 links respectively though filesystems number hard links limited strictly on-disk format linux 3.11 ext4 filesystem limits number hard links file 65,000 windows ntfs filesystem limit 1024 hard links file hard links criticized high-maintenance design neil brown linux weekly news since complicate design programs handle directory trees including archivers disk usage tools du must take care de-duplicate files linked multiple times hierarchy brown also calls attention fact plan 9 bell labs intended successor unix include concept hard link | [
3599,
1438,
362,
7879,
3937,
2547,
3263,
7161,
4672,
378,
2198,
6096,
3626,
1475,
7553,
405,
6117,
7195,
5410,
7199,
7564,
2953,
422,
6844,
2245,
5783,
6854,
5437,
435,
6857,
5442,
4375,
4377,
4017,
3340,
5090,
6500,
447,
6505,
7602,
43... | Test |
1,282 | 3 | ICLOAK:icloak icloak linux-based operating system designed security primary objective boots live usb device replaces main os default leaves trace user computer unless files explicitly saved persistent partition internet traffic routed tor icloak comes various utilities word-processor abiword spreadsheet application gnumeric originally icloak funded successful kickstarter campaign raised 100,000 | [
5232,
3751,
5571
] | Test |
1,283 | 4 | Time/memory/data_tradeoff_attack:time/memory/data tradeoff attack time/memory/data tradeoff attack type cryptographic attack attacker tries achieve situation similar spaceβtime tradeoff one parameter data amount data available attacker real time attacker balances reduces one two parameters favor one two type attack hard ciphers encryption schemes designed resist type attack attack special type general cryptanalytic time/memory tradeoff attack tradeoff attacks symmetric cryptosystems dates back 1980 hellman suggested time/memory tradeoff method break block ciphers formula_1 possible keys time formula_2 memory formula_3 related tradeoff curve formula_4 formula_5 later babbage golic devised different tradeoff attack stream ciphers new bound formula_6 formula_7 formula_8 output data available cryptanalyst real time attack special type general cryptanalytic time/memory tradeoff attack general time/memory tradeoff attack two main phases time/memory/data tradeoff attack following parameters block ciphers formula_1 total number possible keys also assume number possible plaintexts ciphertexts formula_1 also let given data single ciphertext block specific plaintext counterpart consider mapping key formula_16 ciphertext formula_17 random permutation function formula_18 formula_1 point space function formula_18 invertible need find inverse function formula_21 hellman technique invert function according hellman block cipher hand property mapping key cipher text random permutation function formula_18 formula_1 point space formula_18 invertible tradeoff relationship becomes ways better formula_6 stream ciphers formula_1 specified number internal states bit generator probably different number keys formula_8 count first pseudorandom bits produced generator finally attacker goal find one actual internal states bit generator able run generator point generate rest key associate possible formula_1 internal states bit generator corresponding string consists first formula_66 bits obtained running generator state mapping formula_67 states formula_16 output prefixes formula_17 previous mapping considered random function formula_1 points common space invert function attacker establishes following result birthday attack gives condition formula_85 attack time formula_86 preprocessing time formula_87 particular point tradeoff curve formula_6 generalize relation ignore available data real time able reduce formula_2 formula_86 formula_91 general tradeoff curve eventually becomes formula_6 formula_7 formula_87 novel idea introduced 2000 combines hellman tradeoff babbage-and-golic tradeoff attacks achieve new tradeoff curve better bounds stream ciphers cryptoanalysis hellman block cipher technique applied stream cipher using idea covering formula_1 points space matrices obtained multiple variants formula_54 function formula_18 mapping internal states output prefixes recall tradeoff attack stream cipher successful given formula_8 output prefixes found matrices covering formula_1 cuts number covered points matrices formula_1 formula_101 points done reducing number matrices formula_27 formula_103 keeping formula_25 large possible requires formula_105 least one table new attack formula_106 reduced number matrices formula_103 preprocessing time formula_108 realtime required attack formula_109 product number matrices length iteration number available data points attack time eventually use matrix stopping rule obtain tradeoff curve formula_110 formula_111 formula_112 attack invented biryukov shamir wagner idea relies following feature various stream ciphers bit generator undergoes changes internal state producing next output bit therefore enumerate special states generate formula_113 zero bits small values formula_113 low cost forcing large number output bits take specific values enumeration process become expensive difficult define sampling resistance stream cipher formula_115 formula_113 maximum value makes enumeration feasible let stream cipher formula_117 states full name formula_118 bits corresponding output name first formula_118 bits output sequence bits stream cipher sampling resistance formula_115 efficient enumeration use short name formula_121 bits define special states generator special state formula_121 short name corresponding short output name formula_121 bits output sequence special state removing first formula_113 leading bits able define new mapping reduced space formula_125 points mapping equivalent original mapping let formula_126 realtime data available attacker guaranteed least one output special states otherwise relax definition special states include points substitute formula_8 formula_128 formula_1 formula_130 new time/memory/data tradeoff attack shamir biryukov obtain tradeoff curve formula_131 formula_132 actually improvement since could relax lower bound formula_2 since formula_134 small formula_91 means attack made faster technique reduces number expensive disk access operations formula_27 formula_137 since accessing special formula_128 points makes attack faster reduced number expensive disk operations | [
1811,
4930,
464,
807,
1353,
119,
7548,
6637,
6647,
7200,
4805,
5765,
6657,
1587,
762,
5333,
6763,
433,
1320,
613,
1146,
4917
] | Test |
1,284 | 3 | Raspberry_Pi:raspberry pi raspberry pi series small single-board computers developed united kingdom raspberry pi foundation promote teaching basic computer science schools developing countries original model became far popular anticipated selling outside target market uses robotics include peripherals keyboards mice cases however accessories included several official unofficial bundles organisation behind raspberry pi consists two arms first two models developed raspberry pi foundation pi model b released foundation set raspberry pi trading eben upton ceo develop third model b+ raspberry pi trading responsible developing technology foundation educational charity promote teaching basic computer science schools developing countries according raspberry pi foundation 5 million raspberry pis sold february 2015 making best-selling british computer november 2016 sold 11 million units 12.5m march 2017 making third best-selling general purpose computer july 2017 sales reached nearly 15 million march 2018 sales reached 19 million pis made sony factory pencoed wales made china japan several generations raspberry pis released models feature broadcom system chip soc integrated arm-compatible central processing unit cpu on-chip graphics processing unit gpu processor speed ranges 700 mhz 1.4 ghz pi 3 model b+ 1.5ghz pi 4 on-board memory ranges 256 mb 1 gb 4 gb available pi 4 random-access memory ram secure digital sd cards microsdhc form factor sdhc early models used store operating system program memory boards one four usb ports video output hdmi composite video supported standard 3.5 mm tip-ring-sleeve jack audio output lower-level output provided number gpio pins support common protocols like iΒ²c b-models 8p8c ethernet port pi 3 pi zero w on-board wi-fi 802.11n bluetooth prices range us 5 55 first generation raspberry pi 1 model b released february 2012 followed simpler cheaper model 2014 foundation released board improved design raspberry pi 1 model b+ boards approximately credit-card sized represent standard mainline form-factor improved a+ b+ models released year later compute module released april 2014 embedded applications raspberry pi 2 added ram released february 2015 raspberry pi zero smaller size reduced input/output i/o general-purpose input/output gpio capabilities released november 2015 us 5 2017 became newest mainline raspberry pi 28 february 2017 raspberry pi zero w launched version zero wi-fi bluetooth capabilities us 10 12 january 2018 raspberry pi zero wh launched version zero w pre-soldered gpio headers raspberry pi 3 model b released february 2016 1.2 ghz 64-bit quad core processor on-board 802.11n wi-fi bluetooth usb boot capabilities pi day 2018 raspberry pi 3 model b+ launched faster 1.4 ghz processor three-times faster gigabit ethernet throughput limited ca 300 mbit/s internal usb 2.0 connection 2.4 5 ghz dual-band 802.11ac wi-fi 100 mbit/s features power ethernet poe usb boot network boot sd card longer required raspberry pi 4 model b released june 2019 1.5 ghz 64-bit quad core arm cortex-a72 processor on-board 802.11ac wi-fi bluetooth 5 full gigabit ethernet throughput limited two usb 2.0 ports two usb 3.0 ports dual monitor support 4k resolution pi 4 also powered via usb-c port enabling additional power provided downstream peripherals used appropriate psu three sizes onboard ram available 1 gb us 35 2 gb us 45 4 gb us 55 raspberry pi 4 design flaw third-party e-marked usb cables used apple macbooks incorrectly identify refuse provide power expected corrected future board revision tom hardware tested 14 different cables found 11 turned powered pi without issue raspberry pi hardware evolved several versions feature variations memory capacity peripheral-device support block diagram describes model b b+ model a+ pi zero similar lack ethernet usb hub components ethernet adapter internally connected additional usb port model a+ pi zero usb port connected directly system chip soc pi 1 model b+ later models usb/ethernet chip contains five-port usb hub four ports available pi 1 model b provides two pi zero usb port also connected directly soc uses micro usb otg port unlike pi models 40 pin gpio connector omitted pi zero solderable holes pin locations pi zero wh remedies broadcom bcm2835 soc used first generation raspberry pi includes 700 mhz arm1176jzf-s processor videocore iv graphics processing unit gpu ram level 1 l1 cache 16 kb level 2 l2 cache 128 kb level 2 cache used primarily gpu soc stacked underneath ram chip edge visible arm1176jz f -s cpu used original iphone although higher clock rate mated much faster gpu earlier v1.1 model raspberry pi 2 used broadcom bcm2836 soc 900 mhz 32-bit quad-core arm cortex-a7 processor 256 kb shared l2 cache raspberry pi 2 v1.2 upgraded broadcom bcm2837 soc 1.2 ghz 64-bit quad-core arm cortex-a53 processor soc used raspberry pi 3 underclocked default 900 mhz cpu clock speed v1.1 bcm2836 soc longer production late 2016 raspberry pi 3+ uses broadcom bcm2837b0 soc 1.4 ghz 64-bit quad-core arm cortex-a53 processor 512 kb shared l2 cache raspberry pi 4 uses broadcom bcm2711 soc 1.5 ghz 64-bit quad-core arm cortex-a72 processor raspberry pi zero zero w use broadcom bcm2835 soc first generation raspberry pi although running 1 ghz cpu clock speed operating 700 mhz default first generation raspberry pi provided real-world performance roughly equivalent 0.041 gflops cpu level performance similar 300 mhz pentium ii 1997β99 gpu provides 1 gpixel/s 1.5 gtexel/s graphics processing 24 gflops general purpose computing performance graphical capabilities raspberry pi roughly equivalent performance xbox 2001 raspberry pi 2 v1.1 included quad-core cortex-a7 cpu running 900 mhz 1 gb ram described 4β6 times powerful predecessor gpu identical original parallelised benchmarks raspberry pi 2 v1.1 could 14 times faster raspberry pi 1 model b+ raspberry pi 3 quad-core arm cortex-a53 processor described ten times performance raspberry pi 1 benchmarks showed raspberry pi 3 approximately 80 faster raspberry pi 2 parallelised tasks raspberry pi systems-on-chip could overclocked 800 mhz 1000 mhz reports raspberry pi 2 similarly overclocked extreme cases even 1500 mhz discarding safety features over-voltage limitations raspbian linux distro overclocking options boot done software command running sudo raspi-config without voiding warranty cases pi automatically shuts overclocking chip temperature reaches possible override automatic over-voltage overclocking settings voiding warranty appropriately sized heat sink needed protect chip serious overheating newer versions firmware contain option choose five overclock turbo presets used attempt maximise performance soc without impairing lifetime board done monitoring core temperature chip cpu load dynamically adjusting clock speeds core voltage demand low cpu running hot performance throttled cpu much chip temperature acceptable performance temporarily increased clock speeds 1 ghz depending board version turbo settings used seven overclock presets highest turbo preset sdram clock originally 500 mhz later changed 600 mhz 500 mhz sometimes causes sd card corruption simultaneously high mode core clock speed lowered 450 250 mhz medium mode 333 250 mhz cpu first second generation raspberry pi board require cooling heat sink fan even overclocked raspberry pi 3 may generate heat overclocked older beta model b boards 128 mb allocated default gpu leaving 128 mb cpu first 256 mb release model b model three different splits possible default split 192 mb ram cpu sufficient standalone 1080p video decoding simple 3d probably together 224 mb linux 1080p framebuffer likely fail video 3d 128 mb heavy 3d possibly also video decoding e.g kodi comparatively nokia 701 uses 128 mb broadcom videocore iv later model b 512 mb ram new standard memory split files arm256_start.elf arm384_start.elf arm496_start.elf initially released 256 mb 384 mb 496 mb cpu ram 256 mb 128 mb 16 mb video ram respectively week later rpf released new version start.elf could read new entry config.txt gpu_mem= xx could dynamically assign amount ram 16 256 mb 8 mb steps gpu older method memory splits became obsolete single start.elf worked 256 mb 512 mb raspberry pis raspberry pi 2 raspberry pi 3 1 gb ram raspberry pi zero zero w 512 mb ram raspberry pi 4 choice 1 2 4 gb ram set time manufacture raspberry pi 4 model b safety user guide mentions raspberry pi 4 model b 1 gb 2 gb 4 gb 8 gb variants 8gb model available 2019 launch model a+ pi zero ethernet circuitry commonly connected network using external user-supplied usb ethernet wi-fi adapter ethernet port provided built-in usb ethernet adapter using smsc lan9514 chip raspberry pi 3 pi zero w wireless equipped 2.4 ghz wifi 802.11n bluetooth 4.1 based broadcom bcm43438 fullmac chip official support monitor mode implemented unofficial firmware patching pi 3 also 10/100 mbit/s ethernet port raspberry pi 3b+ features dual-band ieee 802.11b/g/n/ac wifi bluetooth 4.2 gigabit ethernet limited approximately 300 mbit/s usb 2.0 bus soc raspberry pi 4 full gigabit ethernet throughput limited funnelled via usb chip pi zero used usb device usb gadget plugged another computer via usb port another machine configured multiple ways example show serial device ethernet device although originally requiring software patches added mainline raspbian distribution may 2016 pi 3 boot usb flash drive firmware limitations models pi 2b v1.2 3a+ 3b 3b+ 4b boards although often pre-configured operate headless computer raspberry pi may also optionally operated generic usb computer keyboard mouse may also used usb storage usb midi converters virtually device/component usb capabilities depending installed device drivers underlying operating system many included default peripherals attached various pins connectors surface raspberry pi video controller generate standard modern tv resolutions hd full hd higher lower monitor resolutions well older ntsc pal standard crt tv resolutions shipped i.e. without custom overclocking support following resolutions 640Γ350 ega 640Γ480 vga 800Γ600 svga 1024Γ768 xga 1280Γ720 720p hdtv 1280Γ768 wxga variant 1280Γ800 wxga variant 1280Γ1024 sxga 1366Γ768 wxga variant 1400Γ1050 sxga+ 1600Γ1200 uxga 1680Γ1050 wxga+ 1920Γ1080 1080p hdtv 1920Γ1200 wuxga higher resolutions 2048Γ1152 may work even 3840Γ2160 15 hz low frame rate convincing video note also allowing highest resolutions imply gpu decode video formats resolutions fact pis known work reliably h.265 high resolutions commonly used high resolutions however common formats full hd work although raspberry pi 3 h.265 decoding hardware cpu powerful predecessors potentially fast enough allow decoding h.265-encoded videos software gpu raspberry pi 3 runs higher clock frequencies 300 mhz 400 mhz compared previous versions ran 250 mhz raspberry pis also generate 576i 480i composite video signals used old-style crt tv screens less-expensive monitors standard connectorseither rca 3.5 mm phono connector depending model television signal standards supported pal-bghid pal-m pal-n ntsc ntsc-j none raspberry pi models built-in real-time clock booting time set either manually configured previously saved state shutdown provide relative consistency file system network time protocol used update system time connected network real-time hardware clock battery backup ds1307 may added interfaces via 200-pin ddr2 so-dimm connector raspberry pi 1 models a+ b+ pi 2 model b pi 3 models a+ b b+ pi 4 pi zero zero w zero wh gpio j8 40-pin pinout raspberry pi 1 models b first 26 pins pi zero zero w 40 gpio pins unpopulated through-holes exposed soldering instead zero wh wireless header header pins preinstalled model b rev 2 also pad called p5 board p6 schematics 8 pins offering access additional 4 gpio connections gpio pins freed four board version identification links present revision 1.0 removed models b provide gpio access act status led using gpio 16 models a+ b+ provide gpio access act status led using gpio 47 power status led using gpio 35 raspberry pi foundation provides raspbian debian-based linux distribution download well third-party ubuntu windows 10 iot core risc os specialised media centre distributions promotes python scratch main programming languages support many languages default firmware closed source unofficial open source available many operating systems also run raspberry pi including formally verified microkernel third-party operating systems available via official website include ubuntu mate windows 10 iot core risc os specialised distributions kodi media centre classroom management raspberry pi use videocore iv gpu via binary blob loaded gpu boot time sd-card additional software initially closed source part driver code later released however much actual driver work done using closed source gpu code application software makes calls closed source run-time libraries openmax opengl es openvg turn call open source driver inside linux kernel calls closed source videocore iv gpu driver code api kernel driver specific closed libraries video applications use openmax use opengl es use openvg turn use egl openmax egl use open source kernel driver turn official firmware freely redistributable binary blob closed-source minimal proof-of-concept open source firmware also available mainly aimed initializing starting arm cores well performing minimal startup required arm side also capable booting minimal linux kernel patches remove dependency mailbox interface responsive known work raspberry pi 1 2 3 well variants raspberry pi zero working state actively developed last significant commits made around mid-2017 technology writer glyn moody described project may 2011 potential replacing machines supplementing march 2012 stephen pritchard echoed bbc micro successor sentiment itpro alex hope co-author next gen report hopeful computer engage children excitement programming co-author ian livingstone suggested bbc could involved building support device possibly branding bbc nano centre computing history strongly supports raspberry pi project feeling could usher new era release board showcased arm ceo warren east event cambridge outlining google ideas improve uk science technology education harry fairhead however suggests emphasis put improving educational software available existing hardware using tools google app inventor return programming schools rather adding new hardware choices simon rockman writing zdnet blog opinion teens better things despite happened 1980s october 2012 raspberry pi t3 innovation year award futurist mark pesce cited borrowed raspberry pi inspiration ambient device project moorescloud october 2012 british computer society reacted announcement enhanced specifications stating definitely something 'll want sink teeth february 2015 switched-mode power supply chip designated u16 raspberry pi 2 model b version 1.1 initially released version found vulnerable flashes light particularly light xenon camera flashes green red laser pointers however bright lights particularly ones continuously found effect symptom raspberry pi 2 spontaneously rebooting turning lights flashed chip initially users commenters suspected electromagnetic pulse emp xenon flash tube causing problem interfering computer digital circuitry ruled tests light either blocked card aimed side raspberry pi 2 cause problem problem narrowed u16 chip covering first system chip main processor u16 blu-tack opaque poster mounting compound light sole culprit instead emp confirmed laser pointer tests also found less opaque covering needed shield laser pointers shield xenon flashes u16 chip seems bare silicon without plastic cover i.e chip-scale package wafer-level package would present block light unofficial workarounds include covering u16 opaque material electrical tape lacquer poster mounting compound even balled-up bread putting raspberry pi 2 case avoiding taking photos top side board xenon flash issue caught release raspberry pi 2 commercial electronic devices routinely subjected tests susceptibility radio interference standard common practice test susceptibility optical interference june 2017 raspberry pi royal academy engineering macrobert award citation award raspberry pi said inexpensive credit card-sized microcomputers redefining people engage computing inspiring students learn coding computer science providing innovative control solutions industry raspberry pi community described jamie ayre floss software company adacore one exciting parts project community blogger russell davis said community strength allows foundation concentrate documentation teaching community developed fanzine around platform called magpi 2015 handed raspberry pi foundation volunteers continued in-house series community raspberry jam events held across uk around world enquiries board united kingdom received schools state private sectors around five times much interest latter hoped businesses sponsor purchases less advantaged schools ceo premier farnell said government country middle east expressed interest providing board every schoolgirl enhance employment prospects 2014 raspberry pi foundation hired number community members including ex-teachers software developers launch set free learning resources website foundation also started teacher training course called picademy aim helping teachers prepare teaching new computing curriculum using raspberry pi classroom 2018 nasa launched jpl open source rover project scaled curiosity rover uses raspberry pi control module encourage students hobbyists get involved mechanical software electronics robotics engineering number developers applications leveraging raspberry pi home automation programmers making effort modify raspberry pi cost-affordable solution energy monitoring power consumption relatively low cost raspberry pi become popular economical alternative expensive commercial solutions june 2014 polish industrial automation manufacturer techbase released modberry industrial computer based raspberry pi compute module device number interfaces notably rs-485/232 serial ports digital analogue inputs/outputs economical 1-wire buses widely used automation industry design allows use compute module harsh industrial environments leading conclusion raspberry pi longer limited home science projects widely used industrial iot solution achieve goals industry 4.0 march 2018 suse announced commercial support suse linux enterprise raspberry pi 3 model b support number undisclosed customers implementing industrial monitoring raspberry pi otto digital camera created next thing co incorporates raspberry pi compute module successfully crowd-funded may 2014 kickstarter campaign slice digital media player also uses compute module heart crowd-funded august 2014 kickstarter campaign software running slice based kodi project launched december 2014 event held uk space agency astro pi competition officially opened january opened primary secondary school aged children residents united kingdom mission british esa astronaut tim peake deployed computers board international space station loaded winning code orbit collected data generated sent earth distributed winning teams covered themes competition included spacecraft sensors satellite imaging space measurements data fusion space radiation organisations involved astro pi competition include uk space agency ukspace raspberry pi esero-uk esa 2006 early concepts raspberry pi based atmel atmega644 microcontroller schematics pcb layout publicly available foundation trustee eben upton assembled group teachers academics computer enthusiasts devise computer inspire children computer inspired acorn bbc micro 1981 model model b model b+ names references original models british educational bbc micro computer developed acorn computers first arm prototype version computer mounted package size usb memory stick usb port one end hdmi port foundation goal offer two versions priced us 25 35 started accepting orders higher priced model b 29 february 2012 lower cost model 4 february 2013. even lower cost us 20 a+ 10 november 2014 26 november 2015 cheapest raspberry pi yet raspberry pi zero launched us 5 Β£4 | [
1066,
2538,
362,
3955,
4317,
2926,
1842,
5740,
395,
6443,
6815,
1101,
2933,
5750,
5752,
4705,
4336,
7554,
745,
5055,
3306,
7919,
5760,
1864,
6489,
7217,
1136,
7588,
451,
5803,
2630,
1167,
463,
6521,
469,
108,
5116,
3365,
3704,
6910,
584... | Test |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.