node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4 values |
|---|---|---|---|---|
1,585 | 0 | Voice_computing:voice computing voice computing discipline develops hardware software process voice inputs spans many fields including human-computer interaction conversational computing linguistics natural language processing automatic speech recognition speech synthesis audio engineering digital signal processing cloud computing data science ethics law information security voice computing become increasingly significant modern times especially advent smart speakers like amazon echo google assistant shift towards serverless computing improved accuracy speech recognition text-to-speech models voice computing rich history first scientists like wolfgang kempelen started build speech machines produce earliest synthetic speech sounds led work thomas edison record audio dictation machines play back corporate settings 1950s-1960s primitive attempts build automated speech recognition systems bell labs ibm others however 1980s hidden markov models used recognize 1,000 words speech recognition systems became relevant around 2011 siri emerged apple iphones first voice assistant accessible consumers innovation led dramatic shift building voice-first computing architectures ps4 released sony north america 2013 70+ million devices amazon released amazon echo 2014 30+ million devices microsoft released cortana 2015 400 million windows 10 users google released google assistant 2016 2 billion active monthly users android phones apple released homepod 2018 500,000 devices sold 1 billion devices active ios/siri shifts along advancements cloud infrastructure e.g amazon web services codecs solidified voice computing field made widely relevant public large voice computer assembled hardware software process voice inputs note voice computers necessarily need screen traditional amazon echo embodiments traditional laptop computers mobile phones could used voice computers moreover become increasingly interfaces voice computers advent iot-enabled devices within cars televisions september 2018 currently 20,000 types devices compatible amazon alexa voice computing software read/write record clean encrypt/decrypt playback transcode transcribe compress publish featurize model visualize voice files popular software packages related voice computing voice computing applications span many industries including voice assistants healthcare e-commerce finance supply chain agriculture text-to-speech security marketing customer support recruiting cloud computing microphones speakers podcasting voice technology projected grow cagr 19-25 2025 making attractive industry startups investors alike united states states varying telephone call recording laws states legal record conversation consent one party others consent parties required moreover coppa significant law protect minors using internet increasing number minors interacting voice computing devices e.g amazon alexa federal trade commission recently relaxed copaa rule children issue voice searches commands lastly gdpr new european law governs right forgotten many clauses eu citizens gdpr also clear companies need outline clear measures obtain consent audio recordings made define purpose scope recordings used e.g. training purposes bar valid consent raised gdpr consents must freely given specific informed unambiguous tacit consent longer sufficient many research conferences relate voice computing include google assistant roughly 2,000 actions january 2018 50,000 alexa skills worldwide september 2018 june 2017 google released audioset large-scale collection human-labeled 10-second sound clips drawn youtube videos contains 1,010,480 videos human speech files 2,793.5 hours total released part ieee icassp 2017 conference november 2017 mozilla foundation released common voice project collection speech files help contribute larger open source machine learning community voicebank currently 12gb size 500 hours english-language voice data collected 112 countries since project inception june 2017 dataset already resulted creative projects like deepspeech model open source transcription model | [
2961,
3507,
5429,
3263,
5064,
7372,
6219
] | Validation |
1,586 | 7 | Distributed_shared_memory:distributed shared memory computer science distributed shared memory dsm form memory architecture physically separated memories addressed one logically shared address space term shared mean single centralized memory address space shared physical address two processors refers location memory distributed global address space dgas similar term wide class software hardware implementations node cluster access shared memory addition node non-shared private memory distributed-memory system often called multicomputer consists multiple independent processing nodes local memory modules connected general interconnection network software dsm systems implemented operating system programming library thought extensions underlying virtual memory architecture implemented operating system systems transparent developer means underlying distributed memory completely hidden users contrast software dsm systems implemented library language level transparent developers usually program differently however systems offer portable approach dsm system implementations distributed shared memory system implements shared-memory model physically distributed memory system usually two methods achieving distributed shared memory three ways implementing software distributed shared memory software dsm systems also flexibility organize shared memory region different ways page based approach organizes shared memory pages fixed size contrast object based approach organizes shared memory region abstract space storing shareable objects variable sizes another commonly seen implementation uses tuple space unit sharing tuple shared memory architecture may involve separating memory shared parts distributed amongst nodes main memory distributing memory nodes coherence protocol chosen accordance consistency model maintains memory coherence memory coherence necessary system organizes dsm able track maintain state data blocks nodes across memories comprising system basic dsm track least three states among nodes given block directory state dictate block uncached u state dictate block exclusively owned modified owned em state dictate block shared blocks come directory organization transition u em ownership state initial node state transition nodes begin reading block two primary methods allowing system track blocks cached condition across node home-centric request-response uses home service requests drive states whereas requester-centric allows node drive manage requests home home-centric system dsm avoid handle request-response races nodes allowing one transaction occur time home node decided transaction finishedβusually home received responding processor response request example intel qpi home-source mode requester-centric system dsm allow nodes talk home means multiple nodes attempt start transaction requires additional considerations ensure coherence example one node processing block receives request block another node send nack negative acknowledgement tell initiator processing node ca n't fulfill request right away example intel qpi snoop-source mode dsm must follow certain rules maintain consistency read write order viewed among nodes called system consistency model suppose n processes mi memory operations process operations executed sequentially conclude m1 m2 β¦ mn m1 m2 β¦ mn possible interleaves operations issue conclusion determining correctness interleaved operations memory coherence dsm defines interleaves permitted two type replication algorithm read replication write replication read replication multiple nodes read time one node write write application multiple nodes read write time.the write requests handled sequencer replication shared data general tends however preserving coherence consistency may become challenging | [
5890,
5541,
553,
5371,
8066,
3692,
5559,
1546,
4049,
4318,
3458,
5571,
5042,
7453,
4154,
1481,
5939,
7010,
4159,
6205,
1023,
4839,
1295,
5947,
1670,
3041,
1405,
240,
1678,
515,
1586,
2688,
3816,
8024,
2961,
3578,
8130,
4993,
3667,
1786,
... | Test |
1,587 | 4 | Rotational_cryptanalysis:rotational cryptanalysis cryptography rotational cryptanalysis generic cryptanalytic attack algorithms rely three operations modular addition rotation xor β arx short algorithms relying operations popular relatively cheap hardware software run constant time making safe timing attacks common implementations basic idea rotational cryptanalysis bit rotation xor operations preserve correlations bit-rotated pairs inputs addition bit-rotated inputs also partially preserves bit rotation correlations rotational pairs inputs thus used see cipher cascaded arx operations greater degree might expected ability see correlations rounds processing exploited break cipher way similar differential cryptanalysis term rotational cryptanalysis coined dmitry khovratovich ivica nikoliΔ 2010 paper rotational cryptanalysis arx presented best cryptanalytic attacks time reduced-round threefish cipher β part skein hash function sha-3 competition candidate follow-up attack authors christian rechberger breaks collision resistance 53 72 rounds skein-256 57 72 rounds skein-512 also affects threefish cipher | [
1811,
4930,
464,
807,
1353,
2918,
907,
3100,
119,
7548,
1283,
6637,
1480,
6647,
7200,
4805,
5765,
5327,
6657,
7928,
5333,
6763,
6049,
161,
433,
1320,
613,
1146,
4917
] | Test |
1,588 | 2 | NewWave:newwave newwave discontinued object-oriented graphical desktop environment office productivity tool pcs running early versions microsoft windows beginning 2.0 developed hewlett-packard introduced commercially 1988 used hp vectras ibm compatible pcs running ms windows user perspective newwave ran top ms windows completely replaced standard windows desktop program manager user interface object-oriented desktop interface hp promoted newwave release windows 95 time development product ceased due incompatibility new operating system newwave gui together contemporaneous nextstep gui introduced shaded 3-d look feel later widely adopted hp encouraged independent software vendors produce versions applications took advantage newwave functionality allowing data handled objects instead files one early example samna corporation later acquired lotus produced edition microsoft windows word processor ami pro entitled β β ami pro newwave β β june 20 1988 microsoft corporation hewlett-packard issued press release announcing inclusion newwave support up-coming release microsoft excel newwave featured icons scheduled scripts form agents hot connects hp incorporated newwave multi-platform office automation offerings running proprietary mpe hp-ux unix minicomputer operating systems developed newwave versions key email database document management personal productivity communications network management tools branded related solutions β hp newwave office β banner prior integration hp newwave solution set known β business system plus β β newwave office β term used previously describe main newwave user desktop original november 1987 press release hewlett-packard described newwave β application environment designed provide personal computer users single method access data files multiple sources company β network β developed hp β personal software division psd santa clara california united states part distributed computing environment strategy three years work 100 employees original version newwave ran ibm compatible pcs required ms-dos 3.2 later ms-windows 2.0 later key features newwave included hp described omf means binding applications data together form β objects β compound documents addition ms-windows-style indexed help articles newwave introduced context-sensitive help facility allowed user click β help β menu option added query symbol mouse arrow switched β help mode β user could click part newwave environment menu command help item displayed pop-up window working conjunction newwave agent computer-based training functionality newwave allowed developers build interactive lessons desktop environment applications allowed users learn actual live applications non-destructive way feature dropped later versions newwave due increased disk requirements imposed limited hard disk space available pcs time newwave agent task-recording execution facility could work across multiple applications users could record sequence tasks performed within newwave environment recorded tasks generated basic-like source-code could repeated unmodified edited expanded create sophisticated automated interactive activities newwave included built-in applications fully integrated object management facility newwave agent online help computer based training features non-native newwave applications could integrated environment using β advanced bridges β allowing live data embedded compound documents standard end-user version hp newwave included bridges hp β pc applications hp graphics gallery ms windows tools calculator calendar notepad etc many common third-party applications users could also create bridges applications using included bridge builder tool bridges could exported use newwave-enabled systems often shared amongst newwave user community hp described newwave write basic-to-intermediate level β see get β wysiwig word processor support compound documents newwave mail available separate native newwave product could act client hp β proprietary deskmanager openmail email server solutions hp succeeded establishing third-party developer program following release newwave software developer β kit sdk february 1988 newwave enabled third-party applications included third-party application bridges shipped end-user release hp newwave included eight-year life hp newwave underwent several functional cosmetic changes including revision desktop interface dropping built-in computer based training facility alleged similarities macintosh gui newwave subject unsuccessful look feel lawsuit apple see apple v. microsoft praising hp serious sincere effort give windows complete object-oriented gui stewart alsop ii 1988 doubted software developers would create software newwave hp considered standard setter ibm microsoft desktop-metaphor plans existing applications needed substantial redesign rewrite effectively use hp newwave never adopted mainstream end-user environment although adopted number corporate clients basis office productivity projects including hp success licensing newwave hardware manufacturers january 1990 hp stated intention provide newwave capabilities unix motif os/2 presentation manager although versions never released hp contribute newwave technology projects run open software foundation hp member articles august 1989 issue hewlett-packard journal volume 40 number 4 | [
405,
3764,
4759,
5571,
4277
] | Test |
1,589 | 7 | CloudMe:cloudme cloudme file storage service operated cloudme ab offers cloud storage file synchronization client software features blue folder appears devices content files synchronized devices cloudme service offered freemium business model provides encrypted ssl connection ssl extended validation certificate cloudme provides client software microsoft windows macos linux android ios google tv samsung smart tv wd tv windows storage server nas web browsers cloud sync storage provider cloudme strong focus european market differentiates storage providers mobility media features like samsung smarttv support recently novell announced support cloudme service dynamic file services suite novosoft handy backup version 7.3 also announced support cloudme winzip also integrated cloudme many third party mobile apps software available cloudme many using webdav support cloudme cloudme founded daniel arthursson 2012 mainly owned xcerion company runs servers operates sweden european union 2012 cloudme received red herring top 100 global company alwayson global 250 award white bull 2012 yearling award white bull 2014 longhorn award previously cloudme.com called icloud.com service changed name apple acquired domain trademark rumoured 4.5 million dollars visitors icloud.com directed cloudme.com name change former icloud.com service split two companies services cloudme file sync storage cloudtop virtual cloud desktop previously main attraction icloud.com service included file storage xcerion major owner cloudme cloudtop initially gained investment 12 million build icloud service using saas model cloudme service provided free version 3 gb storage 19 gb referral program model often called freemium premium versions either 10 25 100 200 500 gb storage consumers 2 tb 5 tb business closest competitor cloudme dropbox cloudme features cloud storage sync solution allows users store access share content people outside service sharing done email text messaging facebook google files stored blue folder synchronized connected computers devices web desktop cloud os service called cloudtop.com available uses cloudme internet file system cloudme ab located drottninggatan 23 linkΓΆping sweden | [
3430,
1911,
3172,
4759,
3943,
4594,
5571,
7083,
6540,
578,
7013,
7102,
854,
518,
3328,
5889
] | Test |
1,590 | 3 | SPARC_T5:sparc t5 sparc t5 fifth generation multicore microprocessor oracle sparc t-series family first presented hot chips 24 august 2012 officially introduced oracle sparc t5 servers march 2013 processor designed offer high multithreaded performance 16 cores per chip 8 threads per core well high single threaded performance chip processor uses sparc s3 core design predecessor sparc t4 processor implemented 28 nm process runs 3.6 ghz s3 core dual-issue core uses dynamic threading out-of-order execution incorporates one floating point unit one dedicated cryptographic unit per core 64-bit sparc version 9 based processor 16 cores supporting 128 threads per processor scales 1,024 threads 8 socket system changes include support pcie version 3.0 new cache coherence protocol chart shows differences t5 t4 processor chips sparc t5 also introduces new power management feature consists hardware support processor software allows system administrator use feature users select policy system responds over-temperature over-current events dynamic voltage frequency scaling aka dvfs policy set maintain peak frequency trade performance power consumption sparc t5 processor used oracle entry mid-size sparc t5-2 t5-4 t5-8 servers servers use processor frequency number cores per chip cache configuration t5 processor includes crossbar network connects 16 cores l2 caches shared l3 cache multiprocessor cache coherence maintained using directory-based protocol design scales eight sockets without additional silicon glueless snoopy based protocol used sparc t4 systems replaced order reduce memory latency reduce coherency bandwidth consumption | [
3761,
6329,
1254,
4847,
1258,
2992,
1263,
6184,
1185,
1937,
7639,
2299,
4418,
6279,
6281,
7453,
3294,
7368,
1105,
3026,
4515,
4967,
4427,
6647,
418,
515,
1223,
7213,
8138,
866,
7499,
1237,
5882,
8145,
441,
971
] | Test |
1,591 | 1 | EUROCAT_(medicine):eurocat medicine eurocat european organization describes network population-based registries epidemiological surveillance congenital anomalies covering 1.5 million births 20 countries europe founded 1979 goal improving collection data congenital disorders standardization data published extensions helps provide unique codes individual conditions approximately quarter new births european union reported eurocat | [] | Test |
1,592 | 3 | Moore's_law:moore law moore law observation number transistors dense integrated circuit doubles every two years observation named gordon moore co-founder fairchild semiconductor ceo intel whose 1965 paper described doubling every year number components per integrated circuit projected rate growth would continue least another decade 1975 looking forward next decade revised forecast doubling every two years compound annual growth rate cagr 41.4 period often quoted 18 months prediction intel executive david house combination effect transistors transistors faster moore prediction proved accurate several decades used semiconductor industry guide long-term planning set targets research development r advancements digital electronics strongly linked moore law rapid scaling mosfet metal-oxide-semiconductor field-effect transistor devices quality-adjusted microprocessor prices memory capacity ram flash sensors even number size pixels digital cameras digital electronics contributed world economic growth late twentieth early twenty-first centuries moore law describes driving force technological social change productivity economic growth moore law observation projection historical trend physical natural law although rate held steady 1975 around 2012 rate faster first decade general logically sound extrapolate historical growth rate indefinite future example 2010 update international technology roadmap semiconductors predicted growth would slow around 2013 2015 gordon moore foresaw rate progress would reach saturation see moore law dying next decade intel stated 2015 pace advancement slowed starting 22 nm feature width around 2012 continuing 14 nm brian krzanich former ceo intel announced cadence today closer two half years two intel also stated 2017 hyperscaling would able continue trend moore law offset increased cadence aggressively scaling beyond typical doubling transistors krzanich cited moore 1975 revision precedent current deceleration results technical challenges natural part history moore law late 2010s two semiconductor manufacturers able produce semiconductor nodes keep pace moore law tsmc samsung electronics 10 nm 7 nm 5 nm nodes production plans 3 nm nodes whereas pace slowed intel semiconductor manufacturers 1959 douglas engelbart discussed projected downscaling integrated circuit size article microelectronics art similitude engelbart presented ideas 1960 international solid-state circuits conference moore present audience thirty-fifth anniversary issue electronics magazine published april 19 1965 gordon e. moore working director research development fairchild semiconductor time asked predict going happen semiconductor components industry next ten years response brief article entitled cramming components onto integrated circuits within editorial speculated 1975 would possible contain many 65,000 components single quarter-inch semiconductor complexity minimum component costs increased rate roughly factor two per year certainly short term rate expected continue increase longer term rate increase bit uncertain although reason believe remain nearly constant least 10 years reasoning log-linear relationship device complexity higher circuit density reduced cost time 1975 ieee international electron devices meeting moore revised forecast rate semiconductor complexity would continue double annually 1980 would decrease rate doubling approximately every two years outlined several contributing factors exponential behavior shortly 1975 caltech professor carver mead popularized term moore law despite popular misconception moore adamant predict doubling every 18 months rather david house intel colleague factored increasing performance transistors conclude integrated circuits would double performance every 18 months moore law came widely accepted goal industry cited competitive semiconductor manufacturers strove increase processing power moore viewed eponymous law surprising optimistic moore law violation murphy law everything gets better better observation even seen self-fulfilling prophecy however rate improvement physical dimensions known dennard scaling mosfet scaling slowed semiconductor manufacturers recent years much industry shifting circa 2016 using semiconductor scaling driver focus meeting needs major computing applications april 2005 intel offered us 10,000 purchase copy original electronics issue moore article appeared engineer living united kingdom first find copy offer intel late 2010s two semiconductor manufacturers able produce semiconductor nodes keep pace moore law tsmc samsung electronics 10 nm 7 nm 5 nm nodes production plans 3 nm nodes whereas pace slowed intel semiconductor manufacturers cost computer power consumer falls cost producers fulfill moore law follows opposite trend r manufacturing test costs increased steadily new generation chips rising manufacturing costs important consideration sustaining moore law led formulation moore second law also called rock law capital cost semiconductor fab also increases exponentially time numerous innovations scientists engineers sustained moore law since beginning integrated circuit ic era key innovations listed examples breakthroughs advanced integrated circuit semiconductor device fabrication technology allowing transistor counts grow seven orders magnitude less five decades computer industry technology road maps predicted 2001 moore law would continue several generations semiconductor chips depending doubling time used calculations could mean hundredfold increase transistor count per chip within decade semiconductor industry technology roadmap used three-year doubling time microprocessors leading tenfold increase decade intel reported 2005 stating downsizing silicon chips good economics could continue following decade 2008 predicting trend 2029 one key challenges engineering future nanoscale transistors design gates device dimension shrinks controlling current flow thin channel becomes difficult compared finfets gate dielectric three sides channel gate-all-around mosfet gaafet structure even better gate control new technology advances may help sustain moore law improved performance without reduced feature size physical limits transistor scaling source-to-drain leakage limited gate metals limited options channel material reached new avenues continued scaling open promising approaches rely using spin state electron spintronics tunnel junctions advanced confinement channel materials via nano-wire geometry comprehensive list available device choices shows wide range device options open continuing moore law next decades spin-based logic memory options developed actively industrial labs well academic labs vast majority current transistors ics composed principally doped silicon alloys silicon fabricated single nanometer transistors short-channel effects adversely change desired material properties silicon functional transistor several non-silicon substitutes fabrication small nanometer transistors one proposed material indium gallium arsenide ingaas compared silicon germanium counterparts ingaas transistors promising future high-speed low-power logic applications intrinsic characteristics iii-v compound semiconductors quantum well tunnel effect transistors based ingaas proposed alternatives traditional mosfet designs research also showing biological micro-cells capable impressive computational power energy efficient various forms graphene studied graphene electronics eg graphene nanoribbon transistors shown great promise since appearance publications 2008 bulk graphene band gap zero thus used transistors constant conductivity inability turn zigzag edges nanoribbons introduce localized energy states conduction valence bands thus bandgap enables switching fabricated transistor example typical gnr width 10 nm desirable bandgap energy 0.4ev research need performed however sub 50 nm graphene layers resistivity value increases thus electron mobility decreases semiconductor industry forecasters including gordon moore expect moore law end around 2025 april 2005 gordon moore stated interview projection sustained indefinitely ca n't continue forever nature exponentials push eventually disaster happens also noted transistors eventually would reach limits miniaturization atomic levels 2016 international technology roadmap semiconductors using moore law drive industry since 1998 produced final roadmap longer centered research development plan moore law instead outlined might called moore strategy needs applications drive chip development rather focus semiconductor scaling application drivers range smartphones ai data centers new initiative generalized roadmapping started ieee initiative rebooting computing named international roadmap devices systems irds technological change combination better technology 2011 study journal science showed peak rate change world capacity compute information 1998 world technological capacity compute information general-purpose computers grew 88 per year since technological change clearly slowed recent times every new year allowed humans carry roughly 60 computation possibly could executed existing general-purpose computers year still exponential shows rate technological change varies time primary driving force economic growth growth productivity moore law factors productivity moore 1995 expected rate technological progress going controlled financial realities reverse could occur around late-1990s however economists reporting productivity growth key economic indicator innovation acceleration rate semiconductor progress contributed surge u.s. productivity growth reached 3.4 per year 1997β2004 outpacing 1.6 per year 1972β1996 2005β2013 economist richard g. anderson notes numerous studies traced cause productivity acceleration technological innovations production semiconductors sharply reduced prices components products contain well expanding capabilities products alternative source improved performance microarchitecture techniques exploiting growth available transistor count out-of-order execution on-chip caching prefetching reduce memory latency bottleneck expense using transistors increasing processor complexity increases described empirically pollack rule states performance increases due microarchitecture techniques approximate square root complexity number transistors area processor years processor makers delivered increases clock rates instruction-level parallelism single-threaded code executed faster newer processors modification manage cpu power dissipation processor makers favor multi-core chip designs software written multi-threaded manner take full advantage hardware many multi-threaded development paradigms introduce overhead see linear increase speed vs number processors particularly true accessing shared dependent resources due lock contention effect becomes noticeable number processors increases cases roughly 45 increase processor transistors translated roughly 10β20 increase processing power hand processor manufacturers taking advantage 'extra space transistor shrinkage provides add specialized processing units deal features graphics video cryptography one example intel parallel javascript extension adds support multiple cores also non-general processing features chips part migration client side scripting toward html5 negative implication moore law obsolescence technologies continue rapidly improve improvements may significant enough render predecessor technologies obsolete rapidly situations security survivability hardware data paramount resources limited rapid obsolescence may pose obstacles smooth continued operations toxic materials used production modern computers obsolescence properly managed may lead harmful environmental impacts hand obsolescence may sometimes desirable company profit immensely regular purchase often expensive new equipment instead retaining one device longer period time industry well aware may utilize planned obsolescence method increasing profits moore law affected performance technologies significantly michael s. malone wrote moore war following apparent success shock awe early days iraq war progress development guided weapons depends electronic technology improvements circuit density low-power operation associated moore law also contributed development technologies including mobile telephones 3-d printing several measures digital technology improving exponential rates related moore law including size cost density speed components moore wrote density components component transistor resistor diode capacitor minimum cost transistors per integrated circuit β popular formulation doubling number transistors integrated circuits every two years end 1970s moore law became known limit number transistors complex chips graph top shows trend holds true today density minimum cost per transistor β formulation given moore 1965 paper density transistors achieved density transistors cost per transistor lowest transistors put chip cost make transistor decreases chance chip work due defect increases 1965 moore examined density transistors cost minimized observed transistors made smaller advances photolithography number would increase rate roughly factor two per year dennard scaling β suggests power requirements proportional area voltage current proportional length transistors combined moore law performance per watt would grow roughly rate transistor density doubling every 1β2 years according dennard scaling transistor dimensions scaled 30 0.7x every technology generation thus reducing area 50 reduces delay 30 0.7x therefore increases operating frequency 40 1.4x finally keep electric field constant voltage reduced 30 reducing energy 65 power 1.4x frequency 50 therefore every technology generation transistor density doubles circuit becomes 40 faster power consumption twice number transistors stays exponential processor transistor growth predicted moore always translate exponentially greater practical cpu performance since around 2005β2007 dennard scaling appears broken even though moore law continued several years yielded dividends improved performance primary reason cited breakdown small sizes current leakage poses greater challenges also causes chip heat creates threat thermal runaway therefore increases energy costs breakdown dennard scaling prompted switch among chip manufacturers greater focus multicore processors gains offered switching cores lower gains would achieved dennard scaling continued another departure dennard scaling intel microprocessors adopted non-planar tri-gate finfet 22 nm 2012 faster consumes less power conventional planar transistor quality adjusted price equipment β price information technology computers peripheral equipment adjusted quality inflation declined 16 per year average five decades 1959 2009 rate quality-adjusted microprocessor price improvement likewise varies linear log scale microprocessor price improvement accelerated late 1990s reaching 60 per year halving every nine months versus typical 30 improvement rate halving every two years years earlier later laptop microprocessors particular improved 25β35 per year 2004β2010 slowed 15β25 per year 2010β2013 number transistors per chip explain quality-adjusted microprocessor prices fully moore 1995 paper limit moore law strict linearity transistor count definition 'moore law come refer almost anything related semiconductor industry plotted semi-log paper approximates straight line hesitate review origins restrict definition hard disk drive areal density β similar observation sometimes called kryder law made 2005 hard disk drive areal density several decades rapid progress areal density advancement slowed significantly around 2010 noise related smaller grain size disk media thermal stability writability using available magnetic fields fiber-optic capacity β number bits per second sent optical fiber increases exponentially faster moore law keck law honor donald keck network capacity β according gerry/gerald butters former head lucent optical networking group bell labs another version called butters law photonics formulation deliberately parallels moore law butters law says amount data coming optical fiber doubling every nine months thus cost transmitting bit optical network decreases half every nine months availability wavelength-division multiplexing sometimes called wdm increased capacity could placed single fiber much factor 100 optical networking dense wavelength-division multiplexing dwdm rapidly bringing cost networking progress seems assured result wholesale price data traffic collapsed dot-com bubble nielsen law says bandwidth available users increases 50 annually pixels per dollar β similarly barry hendy kodak australia plotted pixels per dollar basic measure value digital camera demonstrating historical linearity log scale market opportunity predict future trend digital camera price lcd led screens resolution great moore law compensator tgmlc also known wirth law β generally referred software bloat principle successive generations computer software increase size complexity thereby offsetting performance gains predicted moore law 2008 article infoworld randall c. kennedy formerly intel introduces term using successive versions microsoft office year 2000 2007 premise despite gains computational performance time period according moore law office 2007 performed task half speed prototypical year 2007 computer compared office 2000 year 2000 computer library expansion β calculated 1945 fremont rider double capacity every 16 years sufficient space made available advocated replacing bulky decaying printed works miniaturized microform analog photographs could duplicated on-demand library patrons institutions foresee digital technology would follow decades later replace analog microform digital imaging storage transmission media automated potentially lossless digital technologies allowed vast increases rapidity information growth era sometimes called information age carlson curve β term coined economist describe biotechnological equivalent moore law named author rob carlson carlson accurately predicted doubling time dna sequencing technologies measured cost performance would least fast moore law carlson curves illustrate rapid cases hyperexponential decreases cost increases performance variety technologies including dna sequencing dna synthesis range physical computational tools used protein expression determining protein structures eroom law β pharmaceutical drug development observation deliberately written moore law spelled backwards order contrast exponential advancements forms technology transistors time states cost developing new drug roughly doubles every nine years experience curve effects says doubling cumulative production virtually product service accompanied approximate constant percentage reduction unit cost acknowledged first documented qualitative description dates 1885 power curve used describe phenomenon 1936 discussion cost airplanes | [
4654,
2983,
6788,
6874,
1346,
3845,
4760,
553,
463,
4847,
1353,
107,
3182,
4049,
2743,
4051,
5832,
2482,
1752,
6198,
740,
4154,
7372,
6825,
5939,
7280,
3724,
3391,
48,
1670,
7290,
1968,
4899,
5429,
7499,
1236,
1237,
1238,
2614,
3156,
19... | Validation |
1,593 | 4 | CRAM-MD5:cram-md5 cryptography cram-md5 challenge-response authentication mechanism cram based hmac-md5 algorithm one mechanisms supported simple authentication security layer sasl often used email software part smtp authentication authentication pop imap users well applications implementing ldap xmpp beep protocols software requires authentication unencrypted connections cram-md5 preferred mechanisms transmit passwords clear codice_1 codice_2 however ca n't prevent derivation password brute-force attack less effective alternative mechanisms avoid passwords use connections encrypted transport layer security tls cram-md5 protocol involves single challenge response cycle initiated server one-way hash fresh random challenge provide three types security cram-md5 defined ietf standards-track document rfc 2195 supersedes rfc 2095 earlier 1997 de facto standards define cram-md5 authentication method email mailbox-management protocols pop imap cram-md5 one authentication methods supported simple authentication security layer sasl defined 2006 rfc 4422 supersedes 1997 standard rfc 2222 internet assigned numbers authority iana maintains registry sasl mechanisms including cram-md5 limited use cram-md5 required on-demand mail relay odmr defined rfc 2645 | [
5194,
7148,
5272,
3,
626,
2993,
2101,
1460,
6717,
1464,
4237,
6908,
3293,
7088,
3794,
4261,
6045,
699,
3426
] | Train |
1,594 | 4 | Black_Hat_Briefings:black hat briefings black hat briefings commonly referred black hat computer security conference provides security consulting training briefings hackers corporations government agencies around world black hat brings together variety people interested information security ranging non-technical individuals executives hackers industry leading security professionals conference takes place regularly las vegas barcelona london abu dhabi conference also hosted amsterdam tokyo washington d.c. past black hat founded 1997 jeff moss also founded def con today moss conference chair black hat review board considered premier information security conferences world black hat started single annual conference las vegas nevada held multiple locations around world black hat acquired cmp media subsidiary u.k.-based united business media ubm 2005 black hat typically scheduled prior def con many attendees going conferences black hat perceived security industry corporate security conference whereas def con informal conference composed three major sections black hat briefings black hat trainings black hat arsenal briefings composed tracks covering various topics including reverse engineering identity privacy hacking briefings also contain keynote speeches leading voices information security field including robert lentz chief security officer united states department defense michael lynn amit yoran former director national cyber security division department homeland security general keith b. alexander former director national security agency former commander united states cyber command training offered various computer security vendors individual security professionals conference hosted national security agency information assurance manager course various courses cisco systems offensive security others arsenal portion conference dedicated giving researchers open source community place showcase latest open-source information security tools arsenal primarily consists live tool demonstrations setting attendees able ask questions tools sometimes use arsenal added 2010 toolswatch maintains archive black hat briefings arsenals black hat known antics hacker contingent disclosures brought talks conference attendees known hijack wireless connections hotels hack hotel television billing systems even hack automated teller machine hotel lobby 2009 web sites belonging handful security researchers groups hacked passwords private e-mails im chats sensitive documents exposed vandalized site dan kaminsky days conference black hat usa 2009 usb thumb drive passed around among attendees found infected conficker virus 2008 three men expelled packet sniffing press room local area network past companies attempted ban researchers disclosing vital information products black hat usa 2005 cisco systems tried stop michael lynn speaking vulnerability said could let hackers virtually shut internet however recent years researchers worked vendors resolve issues vendors challenged hackers attack products | [
3932,
2204,
5042,
3634,
5401,
2940,
6823,
1863,
5412,
74,
4371,
4009,
2618,
2620,
113,
3700,
1939,
5485,
4783,
5163,
2691,
2336,
1278,
3792,
2039,
4521,
5591,
6653,
3486,
3140,
954,
5613,
1698,
5616,
643,
651,
8191,
5305,
1376,
5308,
53... | Test |
1,595 | 3 | Pascal_(microarchitecture):pascal microarchitecture pascal codename gpu microarchitecture developed nvidia successor maxwell architecture architecture first introduced april 2016 release tesla p100 gp100 april 5 2016 primarily used geforce 10 series starting geforce gtx 1080 gtx 1070 using gp104 gpu released may 17 2016 june 10 2016 respectively pascal manufactured using tsmc 16nm finfet process later samsung 14nm finfet process architecture named 17th century french mathematician physicist blaise pascal march 18 2019 nvidia announced driver due april 2019 would enable directx raytracing pascal-based cards starting gtx 1060 6 gb 16 series cards feature reserved turing-based rtx series point march 2014 nvidia announced successor maxwell would pascal microarchitecture announced may 6 2016 released may 27 year tesla p100 gp100 chip different version pascal architecture compared gtx gpus gp104 chip shader units gp104 maxwell-like design architectural improvements gp100 architecture include following architectural improvements gp104 architecture include following chip partitioned graphics processor clusters gpcs gp104 chips gpc encompasses 5 sms streaming multiprocessor corresponds amd compute unit smp encompasses 128 single-precision alus cuda cores gp104 chips 64 single-precision alus gp100 chips amd calls cu compute unit compared nvidia calls sm streaming multiprocessor cu versions consist 64 shader processors i.e 4 simd vector units 16-lane wide 64 nvidia regularly calling shader processors cuda cores experimented different numbers polymorph engine version 4.0 unit responsible tessellation corresponds functionally amd geometric processor moved shader module tpc allow one polymorph engine feed multiple sms within tpc gp104 chip sm consists 128 single-precision alus cuda cores gp100 64 single-precision alus due different organization chips like number double precision alus theoretical double precision performance gp100 half theoretical one single precision ratio 1/32 gp104 chip theoretical single-precision processing power pascal gpu gflops computed 2 x operations per fma instruction per cuda core per cycle Γ number cuda cores Γ core clock speed ghz theoretical double-precision processing power pascal gpu 1/2 single precision performance nvidia gp100 1/32 nvidia gp102 gp104 gp106 gp107 gp108 theoretical half-precision processing power pascal gpu 2Γ single precision performance gp100 1/64 gp102 gp104 gp106 gp107 gp108 pascal next architecture preliminarily codenamed volta nvidia announced volta gpu would feature high bandwidth memory unified memory complete fp16 support two times fp32 nvlink still known volta part consumer lineup may replaced ampere turing microarchitectures | [
2538,
2270,
6610,
7442,
4954,
7912,
5939,
1864,
6307,
8141,
1237,
4833,
2080,
7782
] | Test |
1,596 | 3 | SLUB_(software):slub software slub unqueued slab allocator memory management mechanism intended efficient memory allocation kernel objects displays desirable property eliminating fragmentation caused allocations deallocations technique used retain allocated memory contains data object certain type reuse upon subsequent allocations objects type used linux became default allocator since 2.6.23 | [
3256,
2182,
3613,
7528,
7532,
5744,
6443,
2942,
6117,
4341,
5762,
412,
415,
3666,
2970,
7956,
5453,
5460,
7242,
1535,
1924,
6892,
1176,
1933,
5829,
1208,
6211,
4435,
5865,
7669,
3404,
1227,
165,
7312,
1607,
5884,
1991,
890,
3768,
3084,
... | Test |
1,597 | 2 | Windows_Ink:windows ink windows ink software suite windows 10 contains applications features oriented towards pen computing introduced windows 10 anniversary update suite includes sticky notes sketchpad screen sketch applications tablet pc supports pen input windows ink workspace icon taskbar enabled default otherwise enabled manually user windows ink workspace menu contains links top bottom described simple blank canvas quickly easily draw idea doodle create solve problems place user sketch whatever comes mind without launching full blown drawing program sketchbook clip studio paint includes small subset features full-blown drawing programs digital ruler pen options first run loads image unfinished landscape sketches saved images however possible open re-load previously saved sketch user opens windows ink workspace menu screenshot taken screen shown preview snip sketch item menu user taps draw screenshot using controls aforementioned sketchpad feature similar screen write feature samsung galaxy note devices | [
7879,
3937,
3263,
378,
2198,
6096,
1475,
7553,
7195,
5410,
7564,
2953,
422,
6844,
2245,
435,
5442,
4377,
5090,
3340,
7602,
6164,
4759,
1534,
6885,
7619,
2999,
5475,
6528,
2290,
4774,
1181,
3711,
5134,
7272,
1571,
5850,
140,
6558,
6575,
... | Test |
1,598 | 2 | CPAN:cpan comprehensive perl archive network cpan repository 250,000 software modules accompanying documentation 39,000 distributions written perl programming language 12,000 contributors cpan denote either archive network perl program acts interface network automated software installer somewhat like package manager software cpan free open source software cpan conceived 1993 active online since october 1995 based ctan model began place unify structure scattered perl archives like many programming languages perl mechanisms use external libraries code making one file contain common routines used several programs perl calls modules perl modules typically installed one several directories whose paths placed perl interpreter first compiled unix-like operating systems common paths include /usr/lib/perl5 /usr/local/lib/perl5 several subdirectories perl comes small set core modules perform bootstrapping tasks codice_1 used building installing extension modules others like cgi.pm merely commonly used cpan main purpose help programmers locate modules programs included perl standard distribution structure decentralized authors maintain improve modules forking creating competing modules task purpose common formal bug tracking system third-party bug tracking system cpan designated suggested official method reporting issues modules continuous development modules rare many abandoned authors go years new versions released sometimes maintainer appointed abandoned module release new versions module accept patches community module time permits cpan revision control system although source modules often stored github also complete history cpan modules available gitpan project allowing easily see complete history modules easy maintenance forks cpan also used distribute new versions perl well related projects parrot perl 6 files cpan referred distributions distribution may consist one modules documentation files programs packaged common archiving format gzipped tar archive zip file distributions often contain installation scripts usually called makefile.pl build.pl test scripts run verify contents distribution functioning properly new distributions uploaded perl authors upload server pause see section uploading distributions pause 2003 distributions started include metadata files called meta.yml indicating distribution name version dependencies useful information however distributions contain metadata metadata present distribution pause software usually try analyze code distribution look information necessarily reliable thousands distributions cpan needs structured useful distributions cpan divided 24 broad chapters based purpose internationalization locale archiving compression conversion mail usenet news distributions also browsed author finally natural hierarchy perl module names codice_2 codice_3 sometimes used browse modules cpan cpan module distributions usually names form cgi-application-3.1 used module name replaced dash version number appended name convention many prominent distributions break convention especially contain multiple modules security restrictions prevent distribution ever replaced virtually distribution names include version number distribution infrastructure cpan consists worldwide network 250 mirrors 60 countries full mirror hosts around 20 gigabytes data mirrors update hourly daily bidaily cpan master site sites major ftp servers mirror lots software others simply servers owned companies use perl heavily least two mirrors every continent except antarctica several search engines written help perl programmers sort cpan official includes textual search browsable index modules extracted copies distributions currently cpan may 16 2018 perl foundation announced search.cpan.org would shut june 29 2018 19 years operation due aging codebase maintenance burden users transitioned redirected third-party alternative metacpan cpan testers group volunteers download test distributions uploaded cpan enables authors modules tested many platforms environments would otherwise access thus helping promote portability well degree quality smoke testers send reports collated used variety presentation websites including main reports site statistics dependencies also perl core module named cpan usually differentiated repository using name cpan.pm cpan.pm mainly interactive shell used search download install distributions interactive shell called cpan also provided perl core usual way running cpan.pm short configuration process mirror selection uses tools available user computer automatically download unpack compile test install modules also capable updating recently effort replace cpan.pm something cleaner modern resulted cpanplus cpan++ set modules cpanplus separates back-end work downloading compiling installing modules interactive shell used issue commands also supports several advanced features cryptographic signature checking test result reporting finally cpanplus uninstall distribution cpanplus added perl core version 5.10.0 modules check distribution dependencies set recursively install prerequisites either automatically individual user approval support ftp http work firewalls proxies authors upload new distributions cpan perl authors upload server pause must request pause account registered may use web interface pause.perl.org ftp interface upload files directory delete pause warn administrator user uploads module already exists unless listed co-maintainer specified pause web interface experienced perl programmers often comment half perl power cpan called perl killer app roughly equivalent pecl pear php pypi python package index repository python rubygems ruby cran r npm node.js luarocks lua hackage haskell cpan use arbitrated name spaces testing regime well defined documentation style makes generally superior archive languages major languages java c++ nothing similar cpan though java central maven given importance perl developer community cpan shapes shaped perl culture self-appointed master librarian jarkko hietaniemi often takes part april fools day jokes 1 april 2002 site temporarily named cjan j stood java 2003 codice_4 domain name redirected matt script archive site infamous perl community badly written code distributions cpan distributed jokes codice_5 hierarchy reserved joke modules instance codice_6 adds codice_7 function n't run code given complement codice_8 built-in even outside codice_5 hierarchy modules still written largely amusement one example codice_10 used write perl programs subset latin 2005 group perl developers also interest javascript got together create jsan javascript archive network jsan near-direct port cpan infrastructure use javascript language lifespan cohesive community 2008 chance meeting cpan admin adam kennedy open source developers conference linux kernel developer rusty russell created ccan comprehensive c archive network ccan direct port cpan architecture use c language | [
5726,
6428,
4318,
2594,
5416,
5092,
3683,
7619,
5817,
3366,
3368,
4778,
4059,
3031,
4070,
3729,
4441,
8029,
523,
163,
6233,
1989,
2713,
6609,
1260,
2379,
5912,
2740,
5923,
1277,
3106,
5571,
2771,
8122,
5248,
1684,
952,
6312,
5965,
5629,
... | Test |
1,599 | 2 | Steve_Jobs:steve jobs steven paul jobs february 24 1955 β october 5 2011 american business magnate entrepreneur investor chairman chief executive officer ceo co-founder apple inc. chairman majority shareholder pixar member walt disney company board directors following acquisition pixar founder chairman ceo next jobs widely recognized pioneer microcomputer revolution 1970s 1980s along apple co-founder steve wozniak jobs born san francisco california put adoption raised san francisco bay area attended reed college 1972 dropping year traveled india 1974 seeking enlightenment studying zen buddhism declassified fbi report states used marijuana lsd college told reporter taking lsd one two three important things done life jobs wozniak co-founded apple 1976 sell wozniak apple personal computer together duo gained fame wealth year later apple ii one first highly successful mass-produced personal computers jobs saw commercial potential xerox alto 1979 mouse-driven graphical user interface gui led development unsuccessful apple lisa 1983 followed breakthrough macintosh 1984 first mass-produced computer gui macintosh introduced desktop publishing industry 1985 addition apple laserwriter first laser printer feature vector graphics jobs forced apple 1985 long power struggle company board then-ceo john sculley year jobs took apple members found next computer platform development company specialized computers higher-education business markets addition helped develop visual effects industry funded computer graphics division george lucas lucasfilm 1986 new company pixar produced first 3d computer animated film toy story 1995 apple merged next 1997 jobs became ceo former company within months largely responsible helping revive apple verge bankruptcy worked closely designer jony ive develop line products larger cultural ramifications beginning 1997 think different advertising campaign leading imac itunes itunes store apple store ipod iphone app store ipad 2001 original mac os replaced completely new mac os x based next nextstep platform giving os modern unix-based foundation first time jobs diagnosed pancreatic neuroendocrine tumor 2003 died respiratory arrest related tumor age 56 october 5 2011 steven paul jobs born february 24 1955 abdulfattah jandali joanne schieble adopted paul clara jobs nee hagopian biological father abdulfattah john al- jandali arabic ΨΉΨ¨Ψ― Ψ§ΩΩΨͺΨ§Ψ Ψ§ΩΨ¬ΩΨ―ΩΩ b 1931 grew homs syria born arab muslim household undergraduate american university beirut lebanon student activist spent time jail political activities pursued phd university wisconsin met joanne carole schieble catholic swiss german descent doctoral candidate jandali teaching assistant course schieble taking although age mona simpson jobs biological sister notes maternal grandparents happy daughter dating muslim walter isaacson steve jobs official biographer additionally states schieble father threatened cut joanne completely continued relationship jobs adoptive father paul reinhold jobs coast guard mechanic leaving coast guard paul jobs married clara hagopian 1946 clara daughter armenian immigrants grew san francisco paul jobs repo man repaired cars attempts start family halted clara ectopic pregnancy leading consider adoption 1955 schieble became pregnant jobs 1954 jandali spent summer family homs syria jandali stated much love joanne ... sadly father tyrant forbade marry syria told wanted give baby adoption according jandali schieble deliberately involve process without telling joanne upped left move san francisco baby without anyone knowing including ... want bring shame onto family thought best everyone schieble gave birth jobs february 24 1955 san francisco chose adoptive couple catholic well-educated wealthy couple changed mind however decided adopt girl instead baby boy placed paul clara jobs neither college education schieble refused sign adoption papers took matter court attempt baby placed different family consented releasing baby paul clara promised would attend college steve jobs high school mother clara admitted girlfriend 17-year-old chrisann brennan frightened love steve first six months life ... scared going take away even case steve difficult child time two felt made mistake wanted return chrisann shared mother comment steve stated already aware would later say deeply loved indulged paul clara many years later steve jobs wife laurene also noted felt really blessed two parents jobs would become upset paul clara referred adoptive parents regarded parents 1,000 regard biological parents jobs referred sperm egg bank harsh way sperm bank thing nothing paul clara adopted jobs sister patricia 1957 family moved mountain view california 1961 time paul built workbench garage son order pass along love mechanics jobs meanwhile admired father craftsmanship knew build anything needed cabinet would build built fence gave hammer could work ... n't fixing cars ... eager hang dad time ten jobs deeply involved electronics befriended many engineers lived neighborhood difficulty making friends children age however seen classmates loner jobs difficulty functioning traditional classroom tended resist authority figures frequently misbehaved suspended times clara taught read toddler jobs stated pretty bored school turned little terror ... seen us third grade basically destroyed teacher frequently played pranks others monta loma elementary school mountain view father paul abused child never reprimanded however instead blamed school placing enough challenge brilliant son jobs would later credit fourth grade teacher imogene teddy hill turning around taught advanced fourth grade class took month get hip situation bribed learning would say really want finish workbook 'll give five bucks finish really kindled passion learning things learned year think learned year school wanted skip next two years grade school go straight junior high learn foreign language parents wisely would n't let happen jobs skipped fifth grade transferred sixth grade crittenden middle school mountain view became socially awkward loner jobs often bullied gave parents ultimatum either take crittenden would drop school though jobs family well used savings 1967 buy new home would allow jobs change schools new house three-bedroom home crist drive los altos california better cupertino school district cupertino california embedded environment even heavily populated engineering families mountain view home house declared historic site 2013 first site apple computer owned patty occupied jobs step-mother marilyn 13 1968 jobs given summer job bill hewlett hewlett-packard jobs cold-called ask parts electronics project n't know ended giving parts got job summer working hewlett-packard line assembling frequency counters ... well assembling may strong putting screws n't matter heaven bill fernandez fellow electronics hobbyist jobs grade cupertino junior high first friend 1967 move fernandez later commented reason kids eighth grade n't like jobs thought odd one friends fernandez eventually introduced jobs 18-year-old electronics whiz homestead high alum steve wozniak lived across street fernandez location los altos home meant jobs would able attend nearby homestead high school strong ties silicon valley began first year late 1968 along fernandez neither jobs fernandez whose father lawyer came engineering households thus decided enroll john mccollum electronics 1 mccollum rebellious jobs grown hair long become involved growing counterculture would eventually clash jobs began lose interest class also interest sports would later say n't took jock always loner underwent change mid-1970 got stoned first time discovered shakespeare dylan thomas classic stuff read moby dick went back junior taking creative writing classes jobs also later noted official biographer started listen music whole lot started read outside science technologyβshakespeare plato loved king lear ... senior phenomenal ap english class teacher guy looked like ernest hemingway took bunch us snowshoeing yosemite point jobs developed two different circles friends involved electronics engineering interested art literature dual interests particularly reflected jobs senior year best friends wozniak first girlfriend artistic homestead junior chrisann brennan 1971 wozniak began attending university california berkeley jobs would visit times week experience led study nearby stanford university student union jobs also decided rather join electronics club would put light shows friend homestead avant-garde jazz program described homestead classmate kind brain kind hippie ... never fit either group smart enough nerd n't nerdy intellectual hippies wanted get wasted time kind outsider high school everything revolved around group n't carefully defined group n't anybody individual world individuality suspect senior year late 1971 taking freshman english class stanford working homestead underground film project chrisann brennan mid-1972 graduation leaving reed college jobs brennan rented house roommate al summer brennan jobs steve wozniak found advertisement posted de anza college bulletin board job required people dress characters alice wonderland brennan portrayed alice wozniak jobs al portrayed white rabbit mad hatter later year jobs enrolled reed college portland oregon reed expensive school paul clara could ill afford spending much life savings son higher education brennan remained involved jobs reed also met friend reed daniel kottke first time jobs also became friends reed student body president robert friedland brennan senior homestead plans attend college supportive jobs told planned drop reed want spend parents money neither father jobs adoptive parents gone college jobs continued attend auditing classes included course calligraphy taught robert palladino jobs longer official student brennan stopped visiting jobs later asked come live house rented near reed campus refused started seeing women interested someone met art class brennan speculated house jobs attempt make relationship monogamous 2005 commencement speech stanford university jobs stated period slept floor friends dorm rooms returned coke bottles food money got weekly free meals local hare krishna temple speech jobs said never dropped single calligraphy course college mac would never multiple typefaces proportionally spaced fonts mid-1973 jobs moved back san francisco bay area renting apartment brennan states point relationship complicated could n't break connection could n't commit steve could n't either jobs hitchhiked worked around west coast brennan would occasionally join time brennan notes little little steve separated never able fully let go never talked breaking going separate ways n't conversation one person says continued grow apart jobs would still seek visit working health food store live-in babysitter remained involved continuing see people 1973 steve wozniak designed version classic video game pong finishing wozniak gave board jobs took game atari inc. los gatos california atari thought jobs built gave job technician atari cofounder nolan bushnell later described difficult valuable pointing often smartest guy room would let people know early 1974 jobs living brennan describes simple life los gatos cabin working atari saving money impending trip india brennan visited twice cabin states memoir memories cabin consist jobs reading giving copy listening south indian music using japanese meditation pillow brennan believed distant negative toward brennan states memoir met jobs right left india tried give 100 bill earned atari initially refused accept eventually accepted money jobs traveled india mid-1974 visit neem karoli baba kainchi ashram reed friend eventual apple employee daniel kottke search spiritual enlightenment got neem karoli ashram almost deserted neem karoli baba died september 1973 made long trek dry riverbed ashram haidakhan babaji india spent lot time bus rides delhi uttar pradesh himachal pradesh staying seven months jobs left india returned us ahead daniel kottke jobs changed appearance head shaved wore traditional indian clothing time jobs experimented psychedelics later calling lsd experiences one two three important things done life spent period one farm commune oregon owned robert friedland brennan joined period time period jobs brennan became practitioners zen buddhism zen master kΕbun chino otogawa jobs living parents backyard toolshed converted bedroom sleeping bag mat books candle meditation pillow jobs engaged lengthy meditation retreats tassajara zen mountain center oldest sΕtΕ zen monastery us considered taking monastic residence eihei-ji japan maintained lifelong appreciation zen jobs would later say people around share countercultural roots could fully relate thinking jobs returned atari assigned create circuit board arcade video game breakout according bushnell atari offered ttl chip eliminated machine jobs little specialized knowledge circuit board design made deal wozniak split fee evenly wozniak could minimize number chips much amazement atari engineers wozniak reduced ttl count 46 design tight impossible reproduce assembly line according wozniak jobs told atari gave 700 instead 5,000 paid wozniak share thus 350 wozniak learn actual bonus ten years later said jobs told explained needed money wozniak would given wozniak designed low-cost digital blue box generate necessary tones manipulate telephone network allowing free long-distance calls jobs decided could make money selling clandestine sales illegal blue boxes went well perhaps planted seed jobs mind electronics could fun profitable jobs 1994 interview recalled took six months wozniak figure build blue boxes jobs said blue boxes would apple states showed could take large companies beat jobs wozniak attended meetings homebrew computer club 1975 stepping stone development marketing first apple computer 1976 wozniak designed developed apple computer showed jobs suggested sell jobs wozniak ronald wayne founded apple computer called apple inc. garage jobs los altos home crist drive wayne stayed short time leaving jobs wozniak active primary cofounders company two decided name apple jobs returned one farm commune oregon told wozniak time spent farm apple orchard neighbor crist drive recalled jobs odd individual would greet clients underwear hanging barefoot hippie-like another neighbor larry waterland earned phd chemical engineering stanford recalled dismissing jobs budding business 'you punched cards put big deck said mainframe machines time 'steve took garage circuit board chip dumont tv set panasonic cassette tape deck keyboard said 'this apple computer said 'you 've got joking dismissed whole idea jobs friend reed college india daniel kottke recalled early apple employee person worked garage ... woz would show week latest code steve jobs n't get hands dirty sense kottke also stated much early work took place jobs kitchen spent hours phone trying find investors company received funding then-semi-retired intel product marketing manager engineer mike markkula scott mcnealy one cofounders sun microsystems said jobs broke glass age ceiling silicon valley 'd created successful company young age markkula brought apple attention arthur rock looking crowded apple booth home brew computer show started 60,000 investment went apple board returned journey india brennan visited jobs parents home still living period jobs brennan fell love brennan noted changes attributes kobun also still following also time jobs displayed prototype apple computer brennan parents living room brennan notes shift time period two main influences jobs apple kobun early 1977 jobs would spend time together home duveneck ranch los altos served hostel environmental education center brennan also worked teacher inner city children came learn farm 1977 jobs wozniak introduced apple ii west coast computer faire first consumer product sold apple computer one first highly successful mass-produced microcomputer products world designed primarily steve wozniak jobs oversaw development apple ii unusual case rod holt developed unique power supply jobs usually went work wearing black long-sleeved mock turtleneck made issey miyake sometimes reported st. croix brand levi 501 blue jeans new balance 991 sneakers said choice inspired stuart geman noted applied mathematics professor brown university jobs told biographer walter isaacson ... came like idea uniform daily convenience rationale claimed ability convey signature style jobs became successful new company relationship brennan grew complex 1977 success apple part relationship brennan daniel kottke jobs moved house near apple office cupertino brennan eventually took position shipping department apple brennan relationship jobs deteriorating position apple grew began consider ending relationship small changes october 1977 brennan approached rod holt asked take paid apprenticeship designing blueprints apples holt jobs believed would good position given artistic abilities holt particularly eager take position puzzled ambivalence toward brennan decision however overshadowed fact realized pregnant jobs father took days tell jobs whose face according brennan turned ugly news time according brennan beginning third trimester jobs said never wanted ask get abortion n't want also refused discuss pregnancy brennan confused estranged mother afraid discuss matter father also feel comfortable idea abortion chose instead discuss matter kobun encouraged keep baby pledged support meanwhile holt waiting decision internship brennan stated jobs continued encourage take internship stating could pregnant work apple take job n't get problem brennan however notes felt ashamed thought growing belly professional environment apple child unpredictable turn punishing sentimentally ridiculous could endured brennan turned internship decided leave apple stated jobs told give baby adoption sorry never going help alone brennan welfare cleaning houses earn money would sometimes ask jobs money always refused brennan hid pregnancy long could living variety homes continuing work zen meditation time according brennan jobs started seed people notion slept around infertile meant could child weeks due give birth brennan invited deliver baby one farm accepted offer jobs 23 age biological parents brennan gave birth baby lisa brennan may 17 1978 jobs went birth contacted robert friedland mutual friend farm owner distant jobs worked name baby discussed sitting fields blanket brennan suggested name lisa jobs also liked notes jobs attached name lisa also publicly denying paternity would discover later time jobs preparing unveil new kind computer wanted give female name first choice claire st. clare also stated never gave permission use baby name computer hid plans jobs also worked team come phrase local integrated software architecture alternative explanation apple lisa decades later however jobs admitted biographer walter isaacson obviously named daughter brennan would come intense criticism jobs claimed n't want money wants according brennan apple mike scott wanted jobs give money apple executives advised ignore fight tried go paternity settlement jobs denied paternity dna test established lisa father required give brennan 385 month addition returning welfare money received jobs gave 500 month time apple went public jobs became millionaire brennan worked waitress palo alto later brennan agreed give interview michael moritz time magazine time person year special released january 3 1983 discussed relationship jobs rather name jobs person year magazine named computer machine year issue jobs questioned reliability paternity test stated probability paternity jobs steven ... 94.1 jobs responded arguing 28 male population united states could father time also noted baby girl machine apple placed much hope future share name lisa jobs worth 1 million 1978 23 years old grew 250 million time 25 according estimates also one youngest people ever make forbes list nation richest peopleβand one handful done without inherited wealth 1978 apple recruited mike scott national semiconductor serve ceo turned several turbulent years 1983 jobs lured john sculley away pepsi-cola serve apple ceo asking want spend rest life selling sugared water want chance change world 1982 jobs bought apartment two top floors san remo manhattan building politically progressive reputation although never lived spent years renovating help i. m. pei 2003 sold u2 singer bono 1984 jobs bought jackling house estate resided decade leased several years 2000 stopped maintaining house allowing exposure weather degrade 2004 jobs received permission town woodside demolish house order build smaller contemporary styled one years court house finally demolished 2011 months died early 1984 apple introduced macintosh based lisa xerox parc mouse-driven graphical user interface conceived early apple employee jef raskin following year apple aired super bowl television commercial titled 1984 apple annual shareholders meeting january 24 1984 emotional jobs introduced macintosh wildly enthusiastic audience andy hertzfeld described scene pandemonium though marketed received fanfare expensive macintosh hard sell shortly release 1985 bill gates then-developing company microsoft threatened stop developing mac applications unless granted license mac operating system software microsoft developing graphical user interface ... dos calling windows n't want apple sue similarities windows gui mac interface sculley granted microsoft license later led problems apple addition cheap ibm pc clones ran microsoft software graphical user interface began appear although macintosh preceded clones far expensive late 1980s windows user interface getting better better thus taking increasingly share apple windows-based ibm-pc clones also led development additional guis ibm topview digital research gem thus graphical user interface beginning taken granted undermining apparent advantage mac ... seemed clear 1980s wound apple could n't go alone indefinitely whole ibm-clone market sculley jobs respective visions company greatly differed former favored open architecture computers like apple ii sold education small business home markets less vulnerable ibm jobs wanted company focus closed architecture macintosh business alternative ibm pc president ceo sculley little control chairman board jobs macintosh division apple ii division operated like separate companies duplicating services although products provided 85 percent apple sales early 1985 company january 1985 annual meeting mention apple ii division employees many left including wozniak stated company going wrong direction last five years sold stock macintosh failure defeat pc strengthened sculley position company may 1985 sculleyβencouraged arthur rockβdecided reorganize apple proposed plan board would remove jobs macintosh group put charge new product development move would effectively render jobs powerless within apple response jobs developed plan get rid sculley take apple however jobs confronted plan leaked said would leave apple board declined resignation asked reconsider sculley also told jobs votes needed go ahead reorganization months later september 17 1985 jobs submitted letter resignation apple board five additional senior apple employees also resigned joined jobs new venture next following resignation apple 1985 jobs founded next inc. 7 million year later running money sought venture capital product horizon eventually jobs attracted attention billionaire ross perot invested heavily company next computer shown world considered jobs comeback event lavish invitation gala launch event described multimedia extravaganza celebration held louise m. davies symphony hall san francisco california wednesday october 12 1988 steve wozniak said 2013 interview jobs next really getting head together next workstations first released 1990 priced like apple lisa next workstation technologically advanced designed education sector largely dismissed cost-prohibitive educational institutions next workstation known technical strengths chief among object-oriented software development system jobs marketed next products financial scientific academic community highlighting innovative experimental new technologies mach kernel digital signal processor chip built-in ethernet port making use next computer english computer scientist tim berners-lee invented world wide web 1990 cern switzerland revised second generation nextcube released 1990 jobs touted first interpersonal computer would replace personal computer innovative nextmail multimedia email system nextcube could share voice image graphics video email first time interpersonal computing going revolutionize human communications groupwork jobs told reporters jobs ran next obsession aesthetic perfection evidenced development attention nextcube magnesium case put considerable strain next hardware division 1993 sold 50,000 machines next transitioned fully software development release nextstep/intel company reported first profit 1.03 million 1994 1996 next software inc. released webobjects framework web application development next acquired apple inc. 1997 webobjects used build run apple store mobileme services itunes store 1986 jobs funded spinout graphics group later renamed pixar lucasfilm computer graphics division price 10 million 5 million given company capital 5 million paid lucasfilm technology rights first film produced pixar disney partnership toy story 1995 jobs credited executive producer brought fame critical acclaim studio released next 15 years pixar creative chief john lasseter company produced box-office hits bug life 1998 toy story 2 1999 monsters inc. 2001 finding nemo 2003 incredibles 2004 cars 2006 ratatouille 2007 wall-e 2008 2009 toy story 3 2010 finding nemo incredibles ratatouille wall-e toy story 3 received academy award best animated feature award introduced 2001 2003 2004 pixar contract disney running jobs disney chief executive michael eisner tried failed negotiate new partnership early 2004 jobs announced pixar would seek new partner distribute films contract disney expired october 2005 bob iger replaced eisner disney iger quickly worked mend relations jobs pixar january 24 2006 jobs iger announced disney agreed purchase pixar all-stock transaction worth 7.4 billion deal closed jobs became walt disney company largest single shareholder approximately seven percent company stock jobs holdings disney far exceeded eisner holds 1.7 disney family member roy e. disney 2009 death held 1 company stock whose criticisms eisnerβespecially soured disney relationship pixarβaccelerated eisner ousting upon completion merger jobs received 7 disney shares joined board directors largest individual shareholder upon jobs death shares disney transferred steven p. jobs trust led laurene jobs floyd norman pixar described jobs mature mellow individual never interfered creative process filmmakers early june 2014 pixar cofounder walt disney animation studios president ed catmull revealed jobs advised explain understand disagreements catmull released book creativity inc. 2014 recounts numerous experiences working jobs regarding manner dealing jobs catmull writes chrisann brennan notes jobs forced apple apologized many times behavior towards lisa also states jobs said never took responsibility sorry time jobs developed strong relationship lisa nine jobs name birth certificate changed lisa brennan lisa brennan-jobs addition jobs brennan developed working relationship co-parent lisa change brennan credits influence newly found biological sister mona simpson worked repair relationship lisa jobs jobs found mona first finding birth mother joanne schieble simpson shortly left apple jobs contact birth family adoptive mother clara lifetime however would later tell official biographer walter isaacson never wanted paul clara feel like n't consider parents totally parents ... loved much never wanted know search even reporters keep quiet found however 1986 31 clara diagnosed lung cancer began spend great deal time learned details background adoption information motivated find biological mother jobs found birth certificate name san francisco doctor schieble turned pregnant although doctor help jobs alive left letter jobs opened upon death died soon afterwards jobs given letter stated mother unmarried graduate student wisconsin named joanne schieble jobs contacted schieble clara died received permission father paul addition respect paul asked media report search jobs stated motivated find birth mother curiosity need see okay thank 'm glad n't end abortion twenty-three went lot schieble emotional first meeting though n't familiar history apple jobs role told pressured signing adoption papers said regretted giving repeatedly apologized jobs schieble would develop friendly relationship throughout rest life would spend christmas together first visit schieble told jobs sister mona aware brother schieble arranged meet new york mona worked first impression jobs totally straightforward lovely normal sweet guy simpson jobs went long walk get know jobs later told biographer mona completely thrilled first life mother emotionally affectionate toward got know became really good friends family n't know 'd without ca n't imagine better sister adopted sister patty never close jobs learned family history six months given adoption schieble father died wed jandali daughter mona jandali states finishing phd returned syria work period schieble left divorced 1962 also states divorce lost contact mona period time also bear responsibility away daughter four years old mother divorced went syria got back touch 10 years lost touch mother moved n't know since 10 years ago 've constant contact see three times year organized trip last year visit syria lebanon went relative florida years later schieble married ice skating teacher george simpson mona jandali took stepfather last name thus became mona simpson 1970 divorced schieble took mona los angeles raised jobs told official biographer meeting simpson wanted become involved ongoing search father found working sacramento decided simpson would meet jandali simpson spoke several hours point told left teaching restaurant business also said schieble given another child away adoption 'll never see baby baby gone simpson mention met jobs jandali told simpson managed mediterranean restaurant near san jose successful technology people used come even steve jobs ... oh yeah used come sweet guy big tipper hearing visit jobs recalled amazing ... restaurant times remember meeting owner syrian balding shook hands however jobs want meet jandali wealthy man n't trust try blackmail go press ... asked mona tell jandali later discovered relationship jobs online blog contacted simpson asked thing steve jobs simpson told true later commented father thoughtful beautiful storyteller passive ... never contacted steve simpson researched syrian roots began meet members family assumed jobs would eventually want meet father never jobs also never showed interest syrian heritage middle east simpson fictionalized search father 1992 novel lost father malek jandali cousin 1989 jobs first met future wife laurene powell gave lecture stanford graduate school business student soon event stated laurene right front row lecture hall could n't take eyes ... kept losing train thought started feeling little giddy lecture jobs met parking lot invited dinner point forward together minor exceptions rest life powell father died young mother raised middle class new jersey home similar one jobs grew received ba university pennsylvania spent short period high finance found n't interest decided pursue mba stanford instead addition unlike jobs athletic followed professional sports also brought much self-sufficiency relationship private public person jobs proposed new year day 1990 fistful freshly picked wildflowers married march 18 1991 buddhist ceremony ahwahnee hotel yosemite national park fifty people including father paul sister mona attended ceremony conducted jobs guru kobun chino otogawa vegan wedding cake shape yosemite half dome wedding ended hike laurene brothers snowball fight jobs reported said mona see mona ... laurene descended joe namath 're descended john muir jobs powell first child reed born september 1991 jobs father paul died year half later march 5 1993 jobs powell two children erin born august 1995 eve born 1998 family lived palo alto california journalist grew locally remembered owning house scariest halloween decorations palo alto ... n't remember seeing busy terrified 1996 apple announced would buy next 427 million deal finalized february 1997 bringing jobs back company cofounded jobs became de facto chief then-ceo gil amelio ousted july 1997 formally named interim chief executive september march 1998 concentrate apple efforts returning profitability jobs terminated number projects newton cyberdog opendoc coming months many employees developed fear encountering jobs riding elevator afraid might job doors opened reality jobs summary executions rare handful victims enough terrorize whole company jobs changed licensing program macintosh clones making costly manufacturers continue making machines purchase next much company technology found way apple products notably nextstep evolved mac os x jobs guidance company increased sales significantly introduction imac new products since appealing designs powerful branding worked well apple 2000 macworld expo jobs officially dropped interim modifier title apple became permanent ceo jobs quipped time would using title iceo company subsequently branched introducing improving upon digital appliances introduction ipod portable music player itunes digital music software itunes store company made forays consumer electronics music distribution june 29 2007 apple entered cellular phone business introduction iphone multi-touch display cell phone also included features ipod mobile browser revolutionized mobile browsing scene nurturing open-ended innovation jobs also reminded employees real artists ship jobs public war words dell computer ceo michael dell starting 1987 jobs first criticized dell making un-innovative beige boxes october 6 1997 gartner symposium dell asked would ran then-troubled apple computer company said 'd shut give money back shareholders 2006 jobs sent email employees apple market capitalization rose dell jobs admired criticized consummate skill persuasion salesmanship dubbed reality distortion field particularly evident keynote speeches colloquially known stevenotes macworld expos apple worldwide developers conferences jobs board member gap inc. 1999 2002 2001 jobs granted stock options amount 7.5 million shares apple exercise price 18.30 alleged options backdated exercise price 21.10 alleged jobs thereby incurred taxable income 20,000,000 report apple overstated earnings amount result jobs potentially faced number criminal charges civil penalties case subject active criminal civil government investigations though independent internal apple investigation completed december 29 2006 found jobs unaware issues options granted returned without exercised 2003 2005 jobs responded criticism apple poor recycling programs e-waste us lashing environmental advocates apple annual meeting cupertino april weeks later apple announced would take back ipods free retail stores computer takeback campaign responded flying banner plane stanford university graduation jobs commencement speaker banner read steve n't mini-playerβrecycle e-waste 2006 expanded apple recycling programs us customer buys new mac program includes shipping environmentally friendly disposal old systems success apple unique products services provided several years stable financial returns propelling apple become world valuable publicly traded company 2011 jobs perceived demanding perfectionist always aspired position businesses products forefront information technology industry foreseeing setting innovation style trends summed self-concept end keynote speech macworld conference expo january 2007 quoting ice hockey player wayne gretzky july 1 2008 billion class action suit filed several members apple board directors revenue lost alleged securities fraud 2011 interview biographer walter isaacson jobs revealed met us president barack obama complained nation shortage software engineers told obama headed one-term presidency jobs proposed foreign student got engineering degree us university automatically offered green card meeting jobs commented president smart kept explaining us reasons things ca n't get done infuriates october 2003 jobs diagnosed cancer mid-2004 announced employees cancerous tumor pancreas prognosis pancreatic cancer usually poor jobs stated rare much less aggressive type known islet cell neuroendocrine tumor despite diagnosis jobs resisted doctors recommendations medical intervention nine months instead relying alternative medicine thwart disease according harvard researcher ramzi amri choice alternative treatment led unnecessarily early death doctors agree jobs diet insufficient address disease however cancer researcher alternative medicine critic david gorski wrote impossible know whether much might decreased chances surviving cancer flirtation woo best guess jobs probably modestly decreased chances survival barrie r. cassileth chief memorial sloan kettering cancer center integrative medicine department said jobs faith alternative medicine likely cost life ... kind pancreatic cancer treatable curable ... essentially committed suicide according jobs biographer walter isaacson nine months refused undergo surgery pancreatic cancer β decision later regretted health declined instead tried vegan diet acupuncture herbal remedies treatments found online even consulted psychic also influenced doctor ran clinic advised juice fasts bowel cleansings unproven approaches finally surgery july 2004 eventually underwent pancreaticoduodenectomy whipple procedure july 2004 appeared remove tumor successfully jobs receive chemotherapy radiation therapy jobs absence tim cook head worldwide sales operations apple ran company early august 2006 jobs delivered keynote apple annual worldwide developers conference thin almost gaunt appearance unusually listless delivery together choice delegate significant portions keynote presenters inspired flurry media internet speculation state health contrast according ars technica journal report worldwide developers conference wwdc attendees saw jobs person said looked fine following keynote apple spokesperson said steve health robust two years later similar concerns followed jobs 2008 wwdc keynote address apple officials stated jobs victim common bug taking antibiotics others surmised cachectic appearance due whipple procedure july conference call discussing apple earnings participants responded repeated questions jobs health insisting private matter others said shareholders right know given jobs hands-on approach running company based off-the-record phone conversation jobs new york times reported health problems amounted good deal common bug n't life-threatening n't recurrence cancer august 28 2008 bloomberg mistakenly published 2500-word obituary jobs corporate news service containing blank spaces age cause death news carriers customarily stockpile up-to-date obituaries facilitate news delivery event well-known figure death although error promptly rectified many news carriers blogs reported intensifying rumors concerning jobs health jobs responded apple september 2008 let rock keynote paraphrasing mark twain reports death greatly exaggerated subsequent media event jobs concluded presentation slide reading 110/70 referring blood pressure stating would address questions health december 16 2008 apple announced marketing vice-president phil schiller would deliver company final keynote address macworld conference expo 2009 reviving questions jobs health statement given january 5 2009 apple.com jobs said suffering hormone imbalance several months january 14 2009 jobs wrote internal apple memo previous week learned health-related issues complex originally thought announced six-month leave absence end june 2009 allow better focus health tim cook previously acted ceo jobs 2004 absence became acting ceo apple jobs still involved major strategic decisions 2009 tim cook offered portion liver jobs since share rare blood type donor liver regenerate tissue operation jobs yelled 'll never let 'll never april 2009 jobs underwent liver transplant methodist university hospital transplant institute memphis tennessee jobs prognosis described excellent january 17 2011 year half jobs returned work following liver transplant apple announced granted medical leave absence jobs announced leave letter employees stating decision made could focus health time 2009 medical leave apple announced tim cook would run day-to-day operations jobs would continue involved major strategic decisions company leave jobs appeared ipad 2 launch event march 2 wwdc keynote introducing icloud june 6 cupertino city council june 7 august 24 2011 jobs announced resignation apple ceo writing board always said ever came day could longer meet duties expectations apple ceo would first let know unfortunately day come jobs became chairman board named tim cook successor ceo jobs continued work apple day death six weeks later jobs died palo alto california home around 3 p.m. pdt october 5 2011 due complications relapse previously treated islet-cell pancreatic neuroendocrine tumor resulted respiratory arrest lost consciousness day died wife children sisters side sister mona simpson described death thus steve final words hours earlier monosyllables repeated three times embarking 'd looked sister patty long time children life partner laurene shoulders past steve final words 'oh wow oh wow oh wow lost consciousness died several hours later small private funeral held october 7 2011 details respect jobs family made public apple pixar issued announcements death apple announced day plans public service encouraging well-wishers send remembrance messages email address created receive messages apple microsoft flew flags half-staff throughout respective headquarters campuses bob iger ordered disney properties including walt disney world disneyland fly flags half-staff october 6 12 2011 two weeks following death apple displayed corporate web site simple page showed jobs name lifespan next grayscale portrait october 19 2011 apple employees held private memorial service jobs apple campus cupertino jobs widow laurene attendance well cook bill campbell norah jones al gore coldplay apple retail stores closed briefly employees could attend memorial video service uploaded apple website california governor jerry brown declared sunday october 16 2011 steve jobs day day invitation-only memorial held stanford university attendance included apple tech company executives members media celebrities close friends jobs politicians along jobs family bono yo yo joan baez performed service lasted longer hour service highly secured guards university gates helicopter flying overhead area news station attendee given small brown box farewell gift jobs box contained copy autobiography yogi paramahansa yogananda apple co-founder steve wozniak former owner would become pixar george lucas ref name= http //postcards.blogs.fortune.cnn.com/2011/10/06/george-lucas-steve-jobs/ /ref former rival microsoft co-founder bill gates president barack obama offered statements response death jobs buried unmarked grave alta mesa memorial park nonsectarian cemetery palo alto steve jobs subject number books films lisa brennan-jobs jobs eldest daughter described jobs memoir sexually inappropriate described patterns cruel behavior adolescent years jobs design aesthetic influenced philosophies zen buddhism india experienced buddhism seven-month spiritual journey sense intuition influenced spiritual people studied also learned many references sources modernist architectural style joseph eichler industrial designs richard sapper dieter rams according apple cofounder steve wozniak steve n't ever code n't engineer n't original design ... daniel kottke one apple earliest employees college friend jobs stated woz jobs woz innovator inventor steve jobs marketing person listed either primary inventor co-inventor 346 united states patents patent applications related range technologies actual computer portable devices user interfaces including touch-based speakers keyboards power adapters staircases clasps sleeves lanyards packages jobs contributions patents look feel product industrial design chief jonathan ive name along 200 patents design patents specific product designs example jobs listed primary inventor patents original lamp-style imacs well powerbook g4 titanium opposed utility patents inventions 43 issued us patents inventions patent mac os x dock user interface magnification feature issued day died although jobs little involvement engineering technical side original apple computers jobs later used ceo position directly involve product design involved many projects throughout career long-time marketing executive confidant joanna hoffman known one employees apple next could successfully stand jobs also engaging even terminally ill hospital jobs sketched new devices would hold ipad hospital bed also despised oxygen monitor finger suggested ways revise design simplicity since death former apple ceo 141 patents inventors win lifetimes currently jobs holds 450 patents apple ii 8-bit home computer one world first highly successful mass-produced microcomputer products designed primarily steve wozniak jobs oversaw development apple ii unusual case rod holt developed unique power supply introduced 1977 west coast computer faire jobs wozniak first consumer product sold apple computer lisa personal computer designed apple early 1980s first personal computer offer graphical user interface machine aimed individual business users development lisa began 1978 lisa sold poorly 100,000 units sold 1982 jobs forced lisa project joined macintosh project macintosh direct descendant lisa although obvious similarities systems final revision lisa 2/10 modified sold macintosh xl joined original macintosh team jobs took project wozniak experienced traumatic airplane accident temporarily left company jobs introduced macintosh computer january 24 1984 first mass-market personal computer featuring integral graphical user interface mouse first model later renamed macintosh 128k uniqueness amongst populous family subsequently updated models also based apple proprietary architecture since 1998 apple largely phased macintosh name favor mac though product family nicknamed mac mac since development first model macintosh introduced us 1.5 million ridley scott television commercial 1984 notably aired third quarter super bowl xviii january 22 1984 people consider ad watershed event masterpiece regis mckenna called ad successful mac 1984 uses unnamed heroine represent coming macintosh indicated picasso-style picture computer white tank top means saving humanity conformity ibm attempts dominate computer industry ad alludes george orwell novel nineteen eighty-four describes dystopian future ruled televised big brother macintosh however expensive hindered ability competitive market already dominated commodore 64 consumers well ibm personal computer accompanying clone market businesses macintosh systems still found success education desktop publishing kept apple second-largest pc manufacturer next decade jobs forced apple 1985 started company built workstation computers next computer introduced 1988 lavish launch event tim berners-lee created world first web browser worldwideweb using next computer next computer operating system named nextstep basis darwin kernel operating system apple products namely macos ios watchos audioos apple imac introduced 1998 innovative design directly result jobs return apple apple boasted back computer looks better front anyone else described cartoonlike first imac clad bondi blue plastic unlike personal computer came 1999 apple introduced graphite gray apple imac since varied shape colour size considerably maintaining all-in-one design design ideas intended create connection user handle breathing light effect computer went sleep apple imac sold 1,299 time imac also featured forward-thinking changes eschewing floppy disk drive moving exclusively usb connecting peripherals latter change resulted imac success interface popularised among third-party peripheral makersβas evidenced fact many early usb peripherals made translucent plastic match imac design itunes media player media library online radio broadcaster mobile device management application developed apple used play download organize digital audio video well types media available itunes store personal computers running macos microsoft windows operating systems itunes store also available ipod touch iphone ipad itunes store users purchase download music music videos television shows audiobooks podcasts movies movie rentals countries ringtones available iphone ipod touch fourth generation onward application software iphone ipad ipod touch downloaded app store first generation ipod released october 23 2001 major innovation ipod small size achieved using 1.8 hard drive compared 2.5 drives common players time capacity first generation ipod ranged 5 gb 10 gb ipod sold us 399 100,000 ipods sold end 2001 introduction ipod resulted apple becoming major player music industry also ipod success prepared way itunes music store iphone 1st generation ipod apple released hard drive-based ipod classic touchscreen ipod touch video-capable ipod nano screenless ipod shuffle following years apple began work first iphone 2005 first iphone released june 29 2007 iphone created sensation survey indicated six ten americans aware release time declared invention year 2007 completed iphone multimedia capabilities functioned quad-band touch screen smartphone year later iphone 3g released july 2008 three key features support gps 3g data tri-band umts/hsdpa june 2009 iphone 3gs whose improvements included voice control better camera faster processor introduced phil schiller iphone 4 thinner previous models five megapixel camera capable recording video 720p hd adds secondary front-facing camera video calls major feature iphone 4s introduced october 2011 siri virtual assistant capable voice recognition ipad ios-based line tablet computers designed marketed apple first ipad released april 3 2010 recent ipad models ipad 2017 ipad pro ipad mini 4 released september 9 2015 march 24 2017 user interface built around device multi-touch screen including virtual keyboard ipad includes built-in wi-fi cellular connectivity select models 250 million ipads sold | [
6788,
1069,
7890,
1094,
4320,
4690,
734,
6814,
3299,
5752,
405,
6119,
6125,
2954,
4355,
6847,
4003,
6142,
2609,
5786,
1897,
84,
4376,
4749,
5450,
7601,
1154,
3346,
6165,
5101,
4759,
100,
7245,
3001,
7259,
120,
1940,
2300,
3025,
4067,
50... | Test |
1,600 | 9 | Tony_Hoare:tony hoare sir charles antony richard hoare born 11 january 1934 british computer scientist developed sorting algorithm quicksort 1959/1960 also developed hoare logic verifying program correctness formal language communicating sequential processes csp specify interactions concurrent processes including dining philosophers problem inspiration occam programming language born colombo ceylon sri lanka british parents tony hoare father colonial civil servant mother daughter tea planter hoare educated england dragon school oxford king school canterbury studied classics philosophy greats merton college oxford graduating 1956 18 months national service royal navy learned russian returned university oxford 1958 study postgraduate certificate statistics began computer programming taught autocode ferranti mercury leslie fox went moscow state university british council exchange student studied machine translation andrey kolmogorov 1960 hoare left soviet union began working elliott brothers ltd small computer manufacturing firm located london implemented algol 60 began developing major algorithms became professor computing science queen university belfast 1968 1977 returned oxford professor computing lead programming research group oxford university computing laboratory department computer science university oxford following death christopher strachey emeritus professor also principal researcher microsoft research cambridge england hoare significant work following areas sorting selection algorithm quicksort quickselect hoare logic formal language communicating sequential processes csp used specify interactions concurrent processes structuring computer operating systems using monitor concept axiomatic specification programming languages speaking software conference called qcon london 2009 apologised inventing null reference many years leadership oxford department worked formal specification languages csp z achieve expected take-up industry 1995 hoare led reflect upon original assumptions 1962 hoare married jill pym member research team | [
6507,
3166,
6511,
7707,
993,
1180,
304,
5571,
1746,
5931,
4508,
1381,
3115,
4651,
7009,
3470,
5353,
7999,
43,
7382,
1114,
5008,
5948,
7017,
7921,
3810,
3895,
3990,
1308,
1408,
5424,
6485,
7303,
7863,
6774,
7870,
1243,
2265,
360
] | Test |
1,601 | 7 | Yottabyte_LLC:yottabyte llc yottabyte llc software-defined data center sddc company founded 2010 headquartered bloomfield township oakland county michigan yottabyte also operates three physical data centers throughout united states yottabyte software enables companies build virtual data centers industry standard server storage networking gear software yottabyte founded 2010 founders include greg campbell vice president technology paul e. hodges iii president ceo duane tursi yottabyte concept originated campbell hodges sitting conference room tossing around ideas campbell cto developed yottabyte software architecture yottabyte llc named cool vendor compute platform gartner 2016 runner virtualization trailblazers 2015 tech trailblazers september 2016 yottabyte partnered university michigan accelerate data-intensive research project known yottabyte research cloud gives scientists access high-performance secure flexible computing environments enables analysis sensitive data sets restricted federal privacy laws proprietary access agreements confidentiality requirements may 2017 yottabyte brought michael j. aloe board senior vice president sales operations aloe announced chief operations officer coo may 2018 | [
1254,
5889,
4692
] | Test |
1,602 | 8 | Thttpd:thttpd thttpd tiny/turbo/throttling http server open source software web server acme laboratories designed simplicity small execution footprint speed thttpd single-threaded portable compiles cleanly unix-like operating systems including freebsd sunos 4 solaris 2 bsd/os linux osf/1 executable memory size 50 kb used simplified replacement feature-rich servers uniquely suited service high volume requests static dataβfor example image hosting server first thttpd stands variously tiny turbo throttling thttpd bandwidth throttling feature enables server administrator limit maximum bit rate certain types files may transferred example administrator may choose restrict transfer jpeg image files 20 kilobytes per second prevents connection becoming saturated server still responsive heavy load tradeoff file transfer speed reduced thttpd support x-forwarded-for header least 2 public forks thttpd | [
3838,
3168,
1349,
5206,
5820,
5214,
2646,
6270,
8182,
2291,
6536,
26,
5571,
7544,
7988,
7828,
578,
4701,
1392,
7786,
417,
2506,
1686,
3408,
6489,
6061,
7411,
7952,
1435,
2807
] | Test |
1,603 | 3 | Hostages_(video_game):hostages video game hostages tactical shooter video game developed published infogrames released acorn electron archimedes atari st amiga apple iigs amstrad cpc bbc micro commodore 64 ms-dos msx nes zx spectrum platforms 1988 game released hostage rescue mission united states operation jupiter france nes port titled rescue embassy mission hostages terrorist group overrun embassy paris player takes control six-man gign team mission free hostages game split two three depending platform distinct sections hostages well received critics game received 5 5 stars dragon computer gaming world gave pc version positive review noting poor joystick keyboard response significant problem otherwise great game compute called hostages one better amiga combat games noting involve aliens swords sequel hostages titled alcatraz released infogrames amiga atari st dos platforms 1992 | [
7588,
6380
] | Test |
1,604 | 2 | Atari_TOS:atari tos tos operating system also tramiel operating system jack tramiel owner atari corp. time operating system atari st range computers range includes 520st 1040st stf/m/fm ste variants mega st/ste later 32-bit machines tt falcon030 developed using new version tos called multitos allowed multitasking recently users developed tos freemint atari tos operating system debuted atari 520st 1985 tos combines digital research gem gui running top dos-like gemdos features include flat memory model ms-dos-compatible disk format starting tos 1.04 support midi variant scsi called acsi later versions atari tos usually run rom chips contained computer thus local hard drives available home computers almost instant-running os tos booted floppy disks first sts half year st introduced st models started shipping latest version tos rom tos consisted following following extensions tos loaded separately true multitasking directly supported tos allowed six desk accessories loaded system similar tsrs terminate stay resident pcs multitos developed allow tos preemptively multitask tos desktop uses icons represent files devices windows dialog boxes display info desktop file desktop.inf read determine window settings icon placements drive icons otherwise standard default desktop two floppy icons trash icon used later versions use newdesk.inf saving reading desktop configuration executable files identified extensions tos programs gem programs auto boot placing folder named auto tos 1.4 allows gem programs set load automatically install application dialog programs *.ttp extensions environments used auto boot desktop accessories placed root directory default drive loaded automatically atari tos based gemdos uses modified fat12 hard disks fat16 file system major differences fact boot sector need contain ibm compatible jump sequence beginning typically 0xe9 0x 0x 0xeb 0x 0x90 lack tos 1.04 oem identifier compatible pc-based systems fact checksum used mark boot sector executable pc format uses signature word 0x55 0xaa instead executable boot sectors atari platform typically start mc68k jump opcode e.g 0x603c last two byte word must sum rest boot sector big-endian word form 0x1234 order bootable unlike ms-dos gemdos would typically allow disks unusual sector track counts disks 10 even 11 sectors per track 80 formatted tracks uncommon atari community typically safe combination 10 sectors per track 80 tracks used yielding unformatted capacity 800kb many users pushed capacity double density disks 900kb using custom formats gemdos disc file systems read using dos windows 9x tos 4.92 version multitos multitasking version tos format .img designed written rom chip tos 4 rom contains five user-selectable language versions | [
1522,
1524,
5639,
4670,
7161,
6891,
3955,
5571,
7990,
6380,
3042,
4264,
5079,
3915,
3748,
7223,
7775,
1992
] | Test |
1,605 | 6 | NetWare_File_System:netware file system computing netware file system nwfs file system based heavily modified version fat used novell netware operating system default file system volumes versions 2.x 4.x default file system sys volume continuing version 5.x novell developed two varieties nwfs novell storage services nss released 1998 superseded nwfs format nwfs on-disk format never publicly documented novell published specifications 32-bit nwfs larger files file system utilized performance feature named turbo fat transparent file compression also supported although significant impact performance file serving every name space requires separate directory entry file maximum number directory entries 16,000,000 two resident name spaces would reduce usable maximum number directory entries 8,000,000 three 5,333,333 16-bit nwfs could handle volumes 256 mib however name-space support dedicated api handle macintosh clients | [
3599,
2547,
7161,
4672,
6431,
3626,
5049,
6117,
759,
6854,
5437,
4375,
6500,
6505,
5457,
4759,
460,
1534,
7976,
4406,
821,
7258,
5130,
1561,
836,
5843,
2313,
6558,
2683,
5859,
5865,
4444,
5518,
6231,
869,
2704,
174,
2710,
1624,
5900,
44... | Test |
1,606 | 3 | PhyreEngine:phyreengine phyreengine free use game engine sony interactive entertainment despite origins sony compatible playstation platforms support playstation 4 playstation 3 playstation vr playstation vita playstation portable microsoft windows opengl directx 11 google android apple ios phyreengine adopted several game studios used 200 published titles phyreengine distributed installable package includes full source code microsoft windows tools provided flexible use license allows playstation 3 game developer publisher tools middleware company create software based partly fully phyreengine platform engine uses sophisticated parallel processing techniques optimized synergistic processor unit spu cell broadband engine ps3 easily ported multi-core architectures phyreengine supports opengl direct3d addition low level ps3 libgcm library provides fully functional β game templates β source code including support havok complete xs nvidia physx bullet physics development phyreengine started 2003 create graphics engine playstation 3 first public demonstration occurred 2006 phyreengine launched gdc 2008 phyreengine finalist european develop industry excellence awards 2008 technical innovation category 2009 game engine category new features including deferred rendering showcased gdc 2009 version 2.40 released march 2009 included new β foliage rendering β system provides tools technology render ultra-realistic trees plants easily integrated games psp version engine announced sony gdc 2010 version 3.0 released 2011 new powerful asset pipeline combining enhanced versions already robust exporters powerful processing tool generate optimized assets platform also new rewritten level editor permits far data-driven approach authoring games using phyreengine version 3.0 phyreengine adds support playstation vita | [
6597,
450,
5897,
5632,
2002,
2275,
4759,
4130,
4408,
7898,
481,
5571,
8195,
4242,
5666,
1388,
2139,
4718,
3571,
602,
6759,
3234,
4200,
4833,
1244,
4839
] | Validation |
1,607 | 2 | Network_scheduler:network scheduler network scheduler also called packet scheduler queueing discipline qdisc queueing algorithm arbiter node packet switching communication network manages sequence network packets transmit receive queues network interface controller several network schedulers available different operating systems implement many existing network scheduling algorithms network scheduler logic decides network packet forward next network scheduler associated queuing system storing network packets temporarily transmitted systems may single multiple queues case may hold packets one flow classification priority cases may possible schedule transmissions within constraints system cases network scheduler responsible deciding traffic forward gets dropped course time many network queueing disciplines developed provides specific reordering dropping network packets inside various transmit receive buffers queuing disciplines commonly used attempts compensate various networking conditions like reducing latency certain classes network packets generally used part quality service qos measures examples algorithms suitable managing network traffic include several implemented linux kernel modules freely available bufferbloat phenomenon packet-switched networks excess buffering packets causes high latency packet delay variation bufferbloat addressed network scheduler strategically discards packets avoid unnecessarily high buffering backlog examples include codel random early detection network scheduler may responsibility implementation specific network traffic control initiatives network traffic control umbrella term measures aimed reducing congest latency packet loss specifically active queue management aqm selective dropping queued network packets achieve larger goal preventing excessive network congestion scheduler must choose packets drop traffic shaping smooths bandwidth requirements traffic flows delaying transmission packets queued bursts scheduler decides timing transmitted packets quality service prioritization traffic based service class differentiated services reserved connection integrated services linux kernel packet scheduler integral part linux kernel network stack manages transmit receive ring buffers nics working layer 2 osi model handling ethernet frames example packet scheduler configured using utility called codice_1 short traffic control default queuing discipline packet scheduler uses fifo implementation called pfifo_fast although systemd since version 217 changes default queuing discipline fq_codel codice_2 codice_3 utilities enable system administrators configure buffer sizes codice_4 codice_5 device separately terms number ethernet frames regardless size linux kernel network stack contains several buffers managed network scheduler berkeley packet filter filters attached packet scheduler classifiers ebpf functionality brought version 4.1 linux kernel 2015 extends classic bpf programmable classifiers ebpf compiled using llvm ebpf backend loaded running kernel using codice_1 utility altq implementation network scheduler bsds openbsd version 5.5 altq replaced hfsc scheduler | [
1068,
3256,
2182,
7532,
5744,
2942,
6117,
4341,
5762,
412,
415,
5429,
3666,
2970,
2614,
84,
3680,
7956,
6507,
5460,
7242,
1924,
6892,
7627,
1176,
1933,
5829,
5492,
1208,
6922,
4435,
8013,
515,
3404,
8024,
1596,
165,
1985,
7312,
1989,
58... | Test |
1,608 | 1 | Standard_database_management_analysis:standard database management analysis standard database management analysis | [
2054
] | Test |
1,609 | 9 | XProc:xproc xproc w3c recommendation define xml transformation language define xml pipelines example abbreviated xproc file pipeline consists two atomic steps xinclude validate pipeline three inputs β source β source document β schemas β list w3c xml schemas β parameters β passing parameters xinclude step reads pipeline input β source β produces result document validate step reads pipeline input β schemas β output xinclude step produces result document result validation β result β result pipeline equivalent less abbreviated xproc pipeline | [
8154,
5631,
5542,
4126,
7628,
3363,
7537,
7291,
6221,
4635,
87,
7411,
2973,
4743,
7315,
357
] | Test |
1,610 | 9 | JLab:jlab jlab numerical computational environment implemented java main scripting engine jlab groovysci extension groovy additionally interpreted j-scripts similar matlab dynamic linking java class code supported jlab environment aims provide matlab/scilab like scientific computing platform supported scripting engines implemented java language current implementation jlab coexist two scripting engines | [
5117
] | Test |
1,611 | 8 | Web_annotation:web annotation web annotation online annotation associated web resource typically web page web annotation system user add modify remove information web resource without modifying resource annotations thought layer top existing resource annotation layer usually visible users share annotation system cases web annotation tool type social software tool web-based text annotation systems see text annotation web annotation used following purposes annotations considered additional layer respect comments comments published publisher hosts original document annotations added top may eventually become comments turn may integrated version document web annotations first standardised february 23 2017 release three official recommendations w3c web annotation working group w3c also previous web annotation standardisation effort annotea see conceived part semantic web many systems require software installed enable features fact noted footnotes software required additional software provided third party | [
6015,
5640,
2451
] | Validation |
1,612 | 4 | SYN_flood:syn flood syn flood form denial-of-service attack attacker sends succession codice_1 requests target system attempt consume enough server resources make system unresponsive legitimate traffic normally client attempts start tcp connection server client server exchange series messages normally runs like called tcp three-way handshake foundation every connection established using tcp protocol syn flood attack works responding server expected codice_4 code malicious client either simply send expected codice_4 spoofing source ip address codice_1 causing server send codice_3 falsified ip address β send codice_4 knows never sent codice_1 server wait acknowledgement time simple network congestion could also cause missing codice_4 however attack half-open connections created malicious client bind resources server may eventually exceed resources available server point server connect clients whether legitimate otherwise effectively denies service legitimate clients systems may also malfunction crash operating system functions starved resources way number well-known countermeasures listed rfc 4987 including | [
3172,
3175,
3775,
7637,
4966,
4247,
6115,
6459,
2325,
1691,
2885,
3338
] | Test |
1,613 | 4 | Lucideus:lucideus lucideus enterprise cyber security platforms company incubated iit bombay backed cisco former chairman ceo john chambers protects multiple fortune 500 companies governments around world name lucideus derived lucifer satan deus god business hacking good company offers safe security assessment framework enterprise artificial intelligence machine learning platform used cyber-security risk analysis mitigation lucideus worked university delhi year-long postgraduate diploma course cyber security also signed r partnership agreements ground research cyber security technion university mit 2012 saket modi computer science engineer founded lucideus along co-founders vidit baxi rahul tyagi gathered together team security professionals started company objective providing cyber security training beginning 2013 lucideus launched range enterprise cyber security services company today works actively areas 2017 lucideus launched cyber risk assessment platform safe safe security assessment framework enterprises integrates existing technology stack enterprise provide real-time cyber risk assessment score number 0-5 macro level across organisation broken micro-level scoring safe score individually asset safe security assessment framework enterprise de-jargonizes cyber security understanding providing β one β number standard 0 5 estimates overall cyber health organisation takes account controls across people process technology lucideus aims make cyber risk informed business decision allow security team communicate non tech specialists cxos business unit leaders board cyber security posture enterprise lucideus pure-play cyber security services platforms provider builds delivers information security services generic customised pro actively secure continuously monitor re-actively respond cyber threats technology stack one companies 100 oscp offensive security certified professional certified delivery team enterprise cyber security services follows proactive continuous reactive approach security lucideus responsible security assessment applications built national payments corporation india bharat interface money bhim payment app november 2018 lucideus announced series funding 5m led john chambers | [
2789,
5242,
2891,
4783,
2875,
404
] | Validation |
1,614 | 2 | COSIX:cosix cosix chinese unix operating system developed since 1989 china national computer software technology service corporation cs jointly developed 64-bit version compaq released 1999 early version cosix kernel developed based unix system v 64-bit version based tru64 unix linux distribution named cosix linux developed cs released 1999 technical relationship cosix | [
4751,
4478,
900,
2467,
2294,
5571,
2300,
2118,
6360,
578,
6367,
4447,
4733,
443
] | Test |
1,615 | 2 | EOS_(operating_system):eos operating system eos discontinued operating system developed eta systems spin-off division control data corporation use eta10 line supercomputers 1980s eos preceded binary executable compatible cdc vsos operating system cyber 205 like vsos eos demand paged virtual memory vs part 2 pages sizes improved virtual memory performance eta faster hardware pipelines though roots interactive livermore time sharing system ltss vsos focused batch-oriented operating system vsos run many institutions application-oriented performance historic focus supercomputing set features behind times limited user base address feature deficiency make operating system normal use vsos characteristics married unix characteristics hybrid os os intended effective batch work drove hardware maximum interactive use development unix workstation eos written mainly cybil pascal-like programming language created control data later cyber operating systems new effort vsos implemented impl fortran-like language created ltss implementation command line appearance systems similar lineage going back univac exec*8 eos released early hardware deliveries typical problems early os releases customers delayed payment supercomputer installations eta later released port unix eta-10 line quickly accepted customer base however port started single-processor kernel transparently exploit hardware architecture 8 large application cpus applications | [
474,
1522,
5012,
7840,
1023,
5948,
5571,
1237,
3751,
4670,
8066,
2803,
8047,
1435
] | Validation |
1,616 | 2 | Garbage_collection_(computer_science):garbage collection computer science computer science garbage collection gc form automatic memory management garbage collector collector attempts reclaim garbage memory occupied objects longer use program garbage collection invented john mccarthy around 1959 simplify manual memory management lisp garbage collection essentially opposite manual memory management requires programmer specify objects deallocate return memory system however many systems use combination approaches including techniques stack allocation region inference like memory management techniques garbage collection may take significant proportion total processing time program result significant influence performance good implementations enough memory depending application garbage collection faster manual memory management opposite also true often case past sub-optimal gc algorithms resources memory network sockets database handles user interaction windows file device descriptors typically handled garbage collection methods used manage resources particularly destructors may suffice manage memory well leaving need gc gc systems allow resources associated region memory collected causes resource reclaimed called finalization finalization may introduce complications limiting usability intolerable latency disuse reclaim especially limited resources lack control thread performs work reclaiming basic principles garbage collection find data objects program accessed future reclaim resources used objects many programming languages require garbage collection either part language specification example java c go scripting languages effectively practical implementation example formal languages like lambda calculus said garbage collected languages languages designed use manual memory management garbage-collected implementations available example c c++ languages like ada modula-3 c++/cli allow garbage collection manual memory management co-exist application using separate heaps collected manually managed objects others like garbage-collected allow user manually delete objects also entirely disable garbage collection speed required integrating garbage collection language compiler runtime system enables much wider choice methods post-hoc gc systems exist automatic reference counting arc including require recompilation post-hoc gc sometimes distinguished litter collection garbage collector almost always closely integrated memory allocator garbage collection frees programmer manually dealing memory deallocation result certain categories bugs eliminated substantially reduced bugs addressed garbage collection security implications typically garbage collection certain disadvantages including consuming additional resources performance impacts possible stalls program execution incompatibility manual resource management garbage collection consumes computing resources deciding memory free even though programmer may already known information penalty convenience annotating object lifetime manually source code overhead lead decreased uneven performance peer-reviewed paper came conclusion gc needs five times memory compensate overhead perform fast explicit memory management interaction memory hierarchy effects make overhead intolerable circumstances hard predict detect routine testing impact performance also given apple reason adopting garbage collection ios despite desired feature moment garbage actually collected unpredictable resulting stalls pauses shift/free memory scattered throughout session unpredictable stalls unacceptable real-time environments transaction processing interactive programs incremental concurrent real-time garbage collectors address problems varying trade-offs modern gc implementations try minimize blocking stop-the-world stalls much work possible background i.e separate thread example marking unreachable garbage instances application process continues run spite advancements example .net clr paradigm still difficult maintain large heaps millions objects resident objects get promoted older generations without incurring noticeable delays sometimes seconds need explicit manual resource management release/close non-gced resources object oriented language becomes transitive composition non-deterministic gc system resource resource-like object requires manual resource management release/close object used part another object composed object also become resource-like object requires manual resource management release/close tracing garbage collection common type garbage collection much garbage collection often refers tracing garbage collection rather methods reference counting overall strategy consists determining objects garbage collected tracing objects reachable chain references certain root objects considering rest garbage collecting however large number algorithms used implementation widely varying complexity performance characteristics reference counting garbage collection object count number references garbage identified reference count zero object reference count incremented reference created decremented reference destroyed count reaches zero object memory reclaimed manual memory management unlike tracing garbage collection reference counting guarantees objects destroyed soon last reference destroyed usually accesses memory either cpu caches objects freed directly pointed thus tends significant negative side effects cpu cache virtual memory operation number disadvantages reference counting generally solved mitigated sophisticated algorithms escape analysis compile-time technique convert heap allocations stack allocations thereby reducing amount garbage collection done analysis determines whether object allocated inside function accessible outside function-local allocation found accessible another function thread allocation said β escape β done stack otherwise object may allocated directly stack released function returns bypassing heap associated memory management costs generally speaking higher-level programming languages likely garbage collection standard feature languages built garbage collection added library boehm garbage collector c c++ functional programming languages ml haskell apl garbage collection built lisp especially notable first functional programming language first language introduce garbage collection dynamic languages ruby julia perl 5 php version 5.3 use reference counting javascript ecmascript also tend use gc object-oriented programming languages smalltalk java usually provide integrated garbage collection notable exceptions c++ delphi destructors historically languages intended beginners basic logo often used garbage collection heap-allocated variable-length data types strings lists burden programmers manual memory management early microcomputers limited memory slow processors basic garbage collection could often cause apparently random inexplicable pauses midst program operation basic interpreters applesoft basic apple ii family repeatedly scanned string descriptors string highest address order compact toward high memory resulting n performance could introduce minutes-long pauses execution string-intensive programs replacement garbage collector applesoft basic published call-a.p.p.l.e january 1981 pages 40β45 randy wigginton identified group strings every pass heap cut collection time dramatically basic.system released prodos 1983 provided windowing garbage collector basic reduced collections fraction second objective-c traditionally garbage collection release os x 10.5 2007 apple introduced garbage collection objective-c 2.0 using in-house developed runtime collector however 2012 release os x 10.8 garbage collection deprecated favor llvm automatic reference counter arc introduced os x 10.7 furthermore since may 2015 apple even forbids usage garbage collection new os x applications app store ios garbage collection never introduced due problems application responsivity performance instead ios uses arc garbage collection rarely used embedded real-time systems perceived need tight control use limited resources however garbage collectors compatible limited environments developed microsoft .net micro framework .net nanoframework java platform micro edition embedded software platforms like larger cousins include garbage collection among popular garbage collectors jdk could named commonly people compare garbage collectors terms ram consumption optimization receive different results compile-time garbage collection form static analysis allowing memory reused reclaimed based invariants known compilation form garbage collection studied mercury programming language saw greater usage introduction llvm automatic reference counter arc apple ecosystem ios os x 2011 incremental concurrent real-time garbage collectors developed baker algorithm lieberman algorithm baker algorithm allocation done either half single region memory becomes half full garbage collection performed moves live objects half remaining objects implicitly deallocated running program 'mutator check object references correct half move across background task finding objects generational garbage collection schemes based empirical observation objects die young generational garbage collection two allocation regions generations kept kept separate based object age new objects created young generation regularly collected generation full objects still referenced older regions copied next oldest generation occasionally full scan performed high-level language computer architectures include hardware support real-time garbage collection implementations real-time garbage collectors use tracing real-time garbage collectors meet hard real-time constraints used real-time operating system | [
7878,
1445,
6796,
6087,
3951,
379,
2198,
16,
6428,
5378,
5734,
7530,
7908,
399,
1478,
6452,
4704,
4705,
6113,
1855,
6116,
5056,
1116,
4347,
6471,
56,
5771,
2600,
4361,
5077,
1885,
1889,
2614,
6497,
6500,
2619,
5455,
3351,
2277,
2633,
68... | Test |
1,617 | 4 | Honeytoken:honeytoken field computer security honeytokens honeypots computer systems value lies use abuse generalization ideas honeypot canary values often used stack protection schemes honeytokens necessarily prevent tampering data instead give administrator measure confidence data integrity honeytokens fictitious words records added legitimate databases allow administrators track data situations would n't normally able track cloud based networks data stolen honey tokens allow administrators identify stolen leaked three locations medical records different honey tokens form fake medical records could added location different honeytoken would set records chosen unique unlikely ever appear legitimate traffic also detected network intrusion-detection system ids alerting system administrator things would otherwise go unnoticed one case go beyond merely ensuring integrity reactive security mechanisms may actually prevent malicious activity e.g dropping packets containing honeytoken router however mechanisms pitfalls might cause serious problems honeytoken poorly chosen appeared otherwise legitimate network traffic dropped term first coined augusto paes de barros 2003 honeytokens exist many forms dead fake account database entry would selected malicious queries making concept ideally suited ensuring data integrity particular example honeytoken fake email address used track mailing list stolen | [
1071,
3680,
1805
] | Validation |
1,618 | 5 | AX.25:ax.25 ax.25 amateur x.25 data link layer protocol originally derived layer 2 x.25 protocol suite designed use amateur radio operators used extensively amateur packet radio networks ax.25 v2.0 later occupies data link layer second layer osi model responsible establishing link-layer connections transferring data encapsulated frames nodes detecting errors introduced communications channel ax.25 pre-osi-model protocol original specification written cleanly separate osi layers rectified version 2.0 1984 assumes compliance osi level 2 ax.25 commonly used data link layer network layer ipv4 tcp used top ax.25 supports limited form source routing although possible build ax.25 switches similar way ethernet switches work yet accomplished ax.25 define physical layer implementation practice 1200 baud bell 202 tones 9600 baud g3ruh dfsk almost exclusively used vhf uhf hf standard transmission mode 300 baud bell 103 tones although little use ax.25 hf exists today physical layer ax.25 defines physical layer state machine timers related transmitter receiver switching delays link layer ax.25 uses hdlc frame syntax procedures iso 3309 frames transmitted nrzi encoding hdlc specifies syntax semantics variable-length address field frame ax.25 specifies field subdivided multiple addresses source address zero repeater addresses destination address embedded control fields use repeaters simplify compliance amateur radio rules addresses derive station call signs source destination repeater stations media access control follows carrier sense multiple access approach collision recovery csma/cr ax.25 supports virtual-circuit connected datagram-style connectionless modes operation latter used great effect automatic packet reporting system aprs simple source routing mechanism using digipeaters available datalink level digipeaters act simplex repeaters receiving decoding retransmitting packets local stations allow multi-hop connections established two stations unable communicate directly digipeaters use modify information frame address field perform function ax.25 specification defines complete albeit point point network layer protocol seen little use outside keyboard-to-keyboard keyboard-to-bbs connections net/rom rose texnet exist provide routing nodes principle variety layer 3 protocols used ax.25 including ubiquitous internet protocol approach used amprnet amateur radio tcp/ip network using ax.25 ui-frames datalink layer traditionally amateur radio operators connected ax.25 networks use terminal node controller contains microprocessor implementation protocol firmware devices allow network resources accessed using dumb terminal transceiver ax.25 also implemented personal computers example linux kernel includes native support ax.25 computer connects tranceiver via audio interface via simple modem computers also interconnect computers bridged routed tncs tranceivers located elsewhere using bpq ethernet framing also natively supported linux kernel facilitate modern setups actual tranceivers directly placed antenna mast creating 'low loss shorter rf wiring need replacing expensive long thick coax cables amplifiers cheap fiber rfi ways /emp/lightning resistant copper ethernet wiring bpq ethernet framing allows connect entire stacks tnc+tranceiver pairs existing network computers access radio links offered simulaniously transparently bridged communicate internally ax.25 filtered routing select specific tncs/radio frequencies note linux kernel ax.25 implementation contain bugs mainly disconnecting sessions bug appears slipped time due maintenance people using exclusively aprs virtual channel connected mode example tap interfaces supporting full 7 bytes call sign string length interface drivers expect 6 byte hw address mac up-to-7 byte one like ax.25 use requires ax.25 often used tnc implements kiss framing low-cost alternative using expensive uncommon hdlc controller cards kiss framing part ax.25 protocol sent air merely serves encapsulate protocol frames way successfully pass serial link tnc kiss framing derived slip makes many assumptions two endpoints involved conversation slip two slip-connected hosts kiss assumed kiss framing link serial host computer pc involved among things makes awkward address multiple tncs without multiple serial data channels alternatives kiss exist address limitations 6pack ax.25 frequently used establish direct point-to-point links packet radio stations without additional network layers sufficient keyboard-to-keyboard contacts stations accessing local bulletin board systems dx clusters recent years aprs become popular application tunneling ax.25 packets ip axip axudp used encapsulate ax.25 ip udp packets speeds commonly used transmit packet radio data rarely higher 9,600 bit/s typically 1,200 bit/s use additional network layers ax.25 impractical due data overhead involved limitation ax.25 per se places constraints sophistication applications designed use hdlc protocols identify frame address ax.25 implementation hdlc includes sender destination station call-sign plus ssid value range 0 15 frame address itu warc2003 radio amateur station callsign specification amended earlier maximum length six characters raised seven characters however ax.25 built-in hard limit six characters means seven-character callsign used ax.25 network ax.25 lacks explicit port sap ssid often assumes role thus one service per ax.25 station ssid address often kludged around varying degrees success amateurs notably phil karn ka9q argued ax.25 well-suited operation noisy limited-bandwidth radio links citing lack forward error correction fec automatic data compression however viable widely adopted successor ax.25 yet emerge likely reasons may include despite limitations extension ax.25 protocol supporting forward error correction created tapr extension called fx.25 small gadget transmitters need know transmitted need monitor channel occupation radio receiver rssi received signal strength indication know send transmitting interleaved reed-solomon fec signal smart modulation needs lot fewer resources reception signal thus sufficient microprocessor might cost usd 5 instead usd 30 system cost might stay us 50 transmitter included however recent years ability receive well send using cheap microcontrollers atmel avr motorola 68hc08 families demonstrated seems however new system compatible current bell 202 modulation unlikely widely adopted current modulation seems fulfill sufficient need little motivation exists move superior design especially new design requires significant hardware purchases | [
7052,
6071,
4294,
6879,
1916,
2099,
823,
2208,
5387,
7824,
5492,
3207,
3724,
2061,
2062,
1974,
3821,
4093,
3064,
1988
] | Test |
1,619 | 9 | ECLR-attributed_grammar:eclr-attributed grammar eclr-attributed grammars special type attribute grammars variant lr-attributed grammars equivalence relation inherited attributes used optimize attribute evaluation ec stands equivalence class rie based eclr-attributed grammars superset lr-attributed grammars | [
1580,
5326
] | Test |
1,620 | 4 | RootkitRevealer:rootkitrevealer rootkitrevealer proprietary freeware tool rootkit detection microsoft windows bryce cogswell mark russinovich runs windows xp windows server 2003 32-bit-versions output lists windows registry file system api discrepancies may indicate presence rootkit tool triggered sony bmg copy protection rootkit scandal rootkitrevealer longer developed | [
1721,
4759,
3962,
5571,
5227,
6823,
3551,
7564,
7287,
6762,
2784,
2885,
7867
] | Test |
1,621 | 2 | Rpmdrake:rpmdrake rpmdrake graphical interface urpmi permits installation software packages provided part mandriva linux mageia rosa package installation application written gtk2-perl allows rpmdrake free software available gnu general public license version 2. urpmi developed guillaume cottenceau rafael garcia-suarez thierry vignaud first mandriva mageia see | [
8055,
2091,
5200,
5017,
5545,
1723,
1260,
4675,
5912,
3366,
5480,
4778,
1007,
5571,
578,
2034,
4603,
7092,
2581,
7555,
6743,
3559,
3042,
1406,
6663,
4991,
5530,
1699,
781,
7042
] | Test |
1,622 | 1 | Watercraft:watercraft watercraft also known marine vessels waterborne vessels vehicles used water including ships boats hovercraft submarines watercraft usually propulsive capability whether sail oar paddle engine hence distinct simple device merely floats log raft watercraft would described either ship boat however numerous craft many people would consider neither ship boat surfboards used paddle board underwater robots seaplanes torpedoes although ships typically larger boats distinction two categories one size per se term watercraft unlike terms aircraft spacecraft rarely used describe individual object rather term serves unify category ranges jet skis aircraft carriers vessel may used saltwater freshwater pleasure recreation physical exercise commerce transport military missions usually purposes behind watercraft designs skills seafaring education leisure activities fishing resource extraction transportation cargo passengers conducting combat salvage operations general purpose water vehicle identifies utility maritime industry sub-sector design water vehicle created usually seeks achieve balance internal capacity tonnage speed seaworthiness tonnage predominantly consideration transport operations speed important warships safety primary consideration less experienced often smaller less stable training leisure vehicles due great level regulatory compliance required larger watercraft ensures infrequent instances foundering sea application extensive computer modeling ship model basin testing shipyard construction begins historically water vehicles propelled people poles paddles oars manipulation sails propel wind pressure and/or lift variety engineered machinery create subsurface thrust process internal combustion electricity technological history watercraft european history divided reference marine propulsion simple paddle craft oared galleys 8th century bce 15th century lateen sail age discovery early 15th century early 17th century full rigged ships age sail 16th mid 19th century age steam reciprocating marine steam engine roughly 1770 1914 steam turbine later gas turbine internal combustion engines using diesel fuel petrol lng fuels turn 20th century supplemented degree nuclear marine propulsion since 1950s naval watercraft current technological development seeks identify cheaper renewable less polluting sources propulsion watercraft shapes sizes secondary applications technology watercraft used structural materials navigation aids case warships weapon systems purpose usage physical environment define materials used construction historically included grasses leather timbers metals combined timber without silicate plastic derivatives others watercraft registration registration watercraft government authority united states consists alphanumeric string called vessel registration number issued state department motor vehicles navigation aids varied time astronomical observation mechanical mechanisms recently analogue digital computer devices rely gps systems naval weapon systems closely followed development land weapons developing development steam propulsion coupled rapid-firing breech-loading guns naval combat often concluded boarding combat opposing crews since early 20th century substantial development technologies allow force projection naval task force land objective using marine infantry | [
477
] | Test |
1,623 | 2 | Strsafe.h:strsafe.h strsafe.h non-standard c header file provided windows sdk starting windows xp service pack 2 provides safer buffer handling provided standard c string functions widely known security issues involving buffer overruns used correctly functions included strsafe.h replace standard c string handling i/o functions including codice_1 codice_2 codice_3 codice_4 strsafe functions require length string either characters bytes parameter operation would exceed length destination buffer operation fails string still terminated null final valid index using library functions result undefined behavior independent security researchers noted security issues still possible functions strsafe.h passed correct buffer length use library recommended united states department homeland security | [
2621
] | Test |
1,624 | 6 | Clustered_file_system:clustered file system clustered file system file system shared simultaneously mounted multiple servers several approaches clustering employ clustered file system direct attached storage node clustered file systems provide features like location-independent addressing redundancy improve reliability reduce complexity parts cluster parallel file systems type clustered file system spread data across multiple storage nodes usually redundancy performance shared-disk file system uses storage area network san allow multiple computers gain direct disk access block level access control translation file-level operations applications use block-level operations used san must take place client node common type clustered file system shared-disk file system βby adding mechanisms concurrency controlβprovides consistent serializable view file system avoiding corruption unintended data loss even multiple clients try access files time shared-disk file-systems commonly employ sort fencing mechanism prevent data corruption case node failures unfenced device cause data corruption loses communication sister nodes tries access information nodes accessing underlying storage area network may use number block-level protocols including scsi iscsi hyperscsi ata ethernet aoe fibre channel network block device infiniband different architectural approaches shared-disk filesystem distribute file information across servers cluster fully distributed others utilize centralized metadata server achieve result enabling servers access data shared storage device distributed file systems share block level access storage use network protocol commonly known network file systems even though file systems use network send data distributed file systems restrict access file system depending access lists capabilities servers clients depending protocol designed difference distributed file system distributed data store distributed file system allows files accessed using interfaces semantics local files example mounting/unmounting listing directories read/write byte boundaries system native permission model distributed data stores contrast require using different api library different semantics often database distributed file system may also created software implementing ibm distributed data management architecture ddm programs running one computer use local interfaces semantics create manage access files located networked computers client requests trapped converted equivalent messages defined ddm using protocols also defined ddm messages transmitted specified remote computer ddm server program interprets messages uses file system interfaces computer locate interact specified file distributed file systems may aim transparency number aspects aim invisible client programs see system similar local file system behind scenes distributed file system handles locating files transporting data potentially providing features listed incompatible timesharing system used virtual devices transparent inter-machine file system access 1960s file servers developed 1970s 1976 digital equipment corporation created file access listener fal implementation data access protocol part decnet phase ii became first widely used network file system 1985 sun microsystems created file system called network file system nfs became first widely used internet protocol based network file system notable network file systems andrew file system afs apple filing protocol afp netware core protocol ncp server message block smb also known common internet file system cifs 1986 ibm announced client server support distributed data management architecture ddm system/36 system/38 ibm mainframe computers running cics followed support ibm personal computer as/400 ibm mainframe computers mvs vse operating systems flexos ddm also became foundation distributed relational database architecture also known drda many peer-to-peer network protocols open-source distributed file systems cloud closed-source clustered file systems e. g. 9p afs coda cifs/smb dce/dfs lustre panfs google file system mnet chord project network-attached storage nas provides storage file system like shared disk file system top storage area network san nas typically uses file-based protocols opposed block-based protocols san would use nfs popular unix systems smb/cifs server message block/common internet file system used ms windows systems afp used apple macintosh computers ncp used oes novell netware failure disk hardware given storage node cluster create single point failure result data loss unavailability fault tolerance high availability provided data replication one sort another data remains intact available despite failure single piece equipment examples see lists distributed fault-tolerant file systems distributed parallel fault-tolerant file systems common performance measurement clustered file system amount time needed satisfy service requests conventional systems time consists disk-access time small amount cpu-processing time clustered file system remote access additional overhead due distributed structure includes time deliver request server time deliver response client direction cpu overhead running communication protocol software concurrency control becomes issue one person client accessing file block want update hence updates file one client interfere access updates clients problem complex file systems due concurrent overlapping writes different writers write overlapping regions file concurrently problem usually handled concurrency control locking may either built file system provided add-on protocol ibm mainframes 1970s could share physical disks file systems machine channel connection drives control units 1980s digital equipment corporation tops-20 openvms clusters vax/alpha/ia64 included shared disk file systems | [
3599,
2547,
7161,
4672,
6431,
3626,
2565,
5049,
5401,
6454,
6117,
6461,
759,
3664,
6854,
5437,
7949,
4375,
6500,
785,
6505,
5457,
460,
1534,
4393,
7976,
1933,
4406,
821,
7258,
5130,
1561,
7267,
836,
5843,
2313,
4800,
6558,
2683,
5859,
5... | Test |
1,625 | 4 | Keycloak:keycloak keycloak open source software product allow single sign-on identity management access management aimed modern applications services jboss community project stewardship red hat use upstream project rh-sso product conceptual perspective tool intent make easy secure applications services little coding first production release keycloak september 2014 development started year earlier 2016 red hat switched rh sso product based picketlink framework based keycloak upstream project followed merging picketlink codebase keycloak extent keycloak also considered replacement red hat jboss sso open source product previously superseded picketlink jboss.org redirecting old jbosssso subsite keycloak website jboss name registered trade mark red hat moved upstream open source projects names avoid using jboss jboss wildfly commonly recognized example among many features keycloak include 2 main components keycloak | [
2489,
7865,
6586,
4261
] | Test |
1,626 | 9 | Stata:stata stata general-purpose statistical software package created 1985 statacorp users work research especially fields economics sociology political science biomedicine epidemiology stata capabilities include data management statistical analysis graphics simulations regression custom programming also system disseminate user-written programs lets grow continuously name stata syllabic abbreviation words statistics data faq official forum stata insists correct english pronunciation stata must remain mystery stay-ta sta-ta stah-ta considered acceptable four major builds version stata small stata smaller student version educational purchase longer available stata always emphasized command-line interface facilitates replicable analyses starting version 8.0 however stata included graphical user interface based qt framework uses menus dialog boxes give access nearly built-in commands generates code always displayed easing transition command line interface flexible scripting language dataset viewed edited spreadsheet format version 11 commands executed data browser editor opened stata open single dataset one time stata holds entire dataset random-access virtual memory limits use extremely large datasets mitigated extent efficient internal storage integer storage types occupy one two bytes rather four single-precision 4 bytes rather double-precision 8 bytes default floating-point numbers dataset always rectangular format variables hold number observations mathematical terms vectors length although entries may missing values stata import data variety formats includes ascii data formats csv databank formats spreadsheet formats including various excel formats stata proprietary file formats changed time although every stata release includes new dataset format every version stata read older dataset formats write current recent previous dataset format using saveold command thus current stata release always open datasets created older versions older versions read newer format datasets stata read write sas xport format datasets natively using fdause fdasave commands econometric applications including gretl directly import stata file formats stata allows user-written commands distributed so-called ado-files straightforwardly downloaded internet indistinguishable user built-in commands respect stata combines extensibility often associated open-source packages features usually associated commercial packages software verification technical support professional documentation user-written commands later adopted statacorp become part subsequent official release appropriate checking certification documentation stata active email list august 1994 statalist 1000 messages per month turned web forum march 2014 still called statalist statacorp employees regularly contribute statalist maintained marcello pagano harvard school public health statacorp articles use stata new user-written commands published quarterly peer-reviewed stata journal stata journal quarterly publication containing articles statistics data analysis teaching methods effective use stata language user group meetings held annually united states stata conference uk germany italy less frequently several countries annual stata conference held united states hosted statacorp lp local stata distributors host user group meetings countries however stata developers frequently travel present meetings established societies act 10 may 2008 singapore stata users group world first government-approved users group registration 2048/2008 unique entity t08ss0091a slogan shaping data meaningfully non-profit organisation stataugs organise regular meetings provides programming statistical advice users singapore informal means active members stataugs mostly engaged biomedical research perform linear ols regression x optional part allows restrict sample used command subset example command applied females sample one could specify female == 1. br perform logistic regression x display scatter plot x restricted values x 10 perform ols regression x white heteroscedasticity-consistent standard errors calculate akaike information criterion aic bayesian information criterion bic regression code fizzbuzz since 2000 statacorp released new major release stata incrementing integer part version number roughly every two years users must pay fee wish upgrade latest major release minor releases incrementing decimal part version number sometimes made available major releases available free downloadable updates licence previous major release dates releases available stata website stata 16 released june 26 2019 stata versioning system designed give high degree backward compatibility ensuring code written previous releases continues work however users careful save open data among different versions | [
3606,
2820,
4759,
5548,
8066,
1731,
5288,
5117,
5571,
4872,
578,
4705,
4067,
3981,
3388,
4070,
2866,
3807,
1670,
1398,
6934,
1879,
7579,
3410,
256,
3915,
1435
] | Test |
1,627 | 2 | TextEdit_(API):textedit api textedit name collection application programming interfaces apis classic mac os performing text editing apis originally designed provide common text handling system support text entry fields dialog boxes simple text editing within macintosh gui time extended provide advanced text editing features limited original scope led fundamental limitations apple repeatedly stated textedit word processor therefore providing rich text editing always left third-party developers basic limitations textedit include first incarnation textedit provided support single style text applied text block adequate intended use supporting text entry fields later support added styled text textedit could used complex text editing tasks text editing areas web browsers etc textedit remains part carbon api macos superseded numerous solutions including atsui carbon third party waste text engine well nstext related classes within cocoa | [
405,
6765
] | Test |
1,628 | 1 | Relational_data_stream_management_system:relational data stream management system relational data stream management system rdsms distributed in-memory data stream management system dsms designed use standards-compliant sql queries process unstructured structured data streams real-time unlike sql queries executed traditional rdbms return result exit sql queries executed rdsms exit generating results continuously new data become available continuous sql queries rdsms use sql window function analyze join aggregate data streams fixed sliding windows windows specified time-based row-based continuous sql queries rdsms conform ansi sql standards common rdsms sql query performed declarative codice_1 statement continuous sql codice_1 operates data across one data streams optional keywords clauses include codice_3 optional codice_4 subclause specify rules joining multiple data streams codice_5 clause comparison predicate restrict records returned query codice_6 project streams common values smaller set codice_7 filter records resulting codice_6 codice_9 sort results following example continuous data stream aggregation using codice_1 query aggregates sensor stream weather monitoring station codice_1query aggregates minimum maximum average temperature values one-second time period returning continuous stream aggregated results one second intervals rdsms sql queries also operate data streams time row-based windows following example shows second continuous sql query using codice_12 clause one-second duration codice_12 clause changes behavior query output result new record arrives hence output stream incrementally updated results zero result latency | [] | Test |
1,629 | 2 | DeLi_Linux:deli linux desktop light linux deli linux short desktop linux distribution old pcs version 0.6.1 deli linux based slackware 7 using linux 2.2 deli linux version 0.7 development scratch linux 2.4.33.3 longer based slackware os still used slackware package management additionally new port system based crux deli linux based uclibc instead gnu c library port openbsd korn shell used default shell version 0.8 introduced pacman package manager 0.8 series focus internationalisation version 0.8.0 also switched web browser netsurf skipstone previously konqueror embedded dillo deli linux pre-packaged abiword siag office office suites web browser netsurf skipstone included email clients mutt sylpheed window managers icewm fluxbox included editing deli linux offers e3 elvis beaver since deli linux ships lightweight software many popular open source packages included gnome kde emacs mozilla thunderbird deli linux needs 386 32 mb ram minimum however linux swap partition needs selected setup run deli less 48 mb ram work smoothly 486 full installation packages requires nearly 750 mb hard disk space august 2010 developers announced deli linux discontinued instead two successor projects connochaetos deli cate connochaetos created 2010 arch linux derivative targeting i586 pentium 1 later processors time arch required least i686 trying follow gnu free system distribution guidelines fsdg discontinued july 2013 due maintainer lack time project financial situation project failure get endorsement free software foundation fsdg-compliant however june 2015 development connochaetos resumed longer derivative arch linux derivative slackware salix os another project deli cate runs 386 486 pentium-class machines | [
2179,
2187,
2909,
5724,
6086,
7894,
2935,
6453,
2585,
2228,
1487,
58,
3996,
7587,
4008,
1893,
7954,
1909,
6884,
7969,
6175,
7251,
7975,
4400,
7253,
3696,
474,
1179,
7635,
6902,
2297,
1941,
3023,
6549,
1960,
6209,
2680,
4435,
5163,
8019,
... | Test |
1,630 | 6 | File_locking:file locking file locking mechanism restricts access computer file allowing one user process access specific time systems implement locking prevent classic interceding update scenario typical example race condition enforcing serialization update processes given file following example illustrates interceding update problem operating systems support concept record locking means individual records within given file may locked thereby increasing number concurrent update processes database maintenance uses file locking whereby serialize access entire physical file underlying database although prevent process accessing file efficient individually locking large number regions file removing overhead acquiring releasing lock poor use file locks like computer lock result poor performance deadlocks file locking may also refer additional security applied computer user either using windows security ntfs permissions installing third party file locking software ibm pioneered file locking 1963 use mainframe computers using os/360 termed exclusive control microsoft windows uses three distinct mechanisms manage access shared files windows inherits semantics share-access controls ms-dos system sharing introduced ms-dos 3.3 thus application must explicitly allow sharing opens file otherwise exclusive read write delete access file closed types access retrieve attributes file allowed file opened shared access applications may use byte-range locking control access specific regions file byte-range locks specify region file offset length type lock shared exclusive note region file locked required data within file applications sometimes exploit ability implement functionality applications use file read/write apis windows byte-range locks enforced also referred mandatory locks file systems execute within windows applications use file mapping apis windows byte-range locks enforced also referred advisory locks byte-range locking may also side-effects windows system example windows file-sharing mechanism typically disable client side caching file clients byte-range locks used client control file access client observe slower access read write operations must sent server file stored improper error-handling application program lead scenario file locked either using share access byte-range file locking accessed applications user may able restore file access manually terminating malfunctioning program typically done task manager utility sharing mode dwsharemode parameter createfile function used open files determines file-sharing sharing mode specified allow sharing file read write delete access combination subsequent attempts open file must compatible previously granted sharing-access file file closed sharing-access restrictions adjusted remove restrictions imposed specific file open byte-range locking type determined dwflags parameter lockfileex function used lock region file windows api function lockfile also used acquires exclusive lock region file file containing executable program file currently running computer system program e.g exe com dll cpl binary program file format normally locked operating system preventing application modifying deleting attempt denied sharing violation error despite fact program file opened application however access still allowed example running application file renamed copied read even executing files accessed applications windows using file handles file handles explored process explorer utility utility also used force-close handles without needing terminate application holding cause undefined behavior since program receive unexpected error using force-closed handle may even operate unexpected file since handle number may recycled microsoft windows xp server 2003 editions introduced volume snapshot vss capability ntfs allowing open files accessed backup software despite exclusive locks however unless software rewritten specifically support feature snapshot crash consistent properly supported applications assist operating system creating transactionally consistent snapshots commercial software accessing locked files windows include file access manager open file manager work installing drivers access files kernel mode unix-like operating systems including linux apple macos normally automatically lock open files several kinds file-locking mechanisms available different flavors unix many operating systems support one kind compatibility common mechanism two mechanisms may separate may implemented atop although types locks configured mandatory file locks unix default advisory means cooperating processes may use locks coordinate access file among uncooperative processes also free ignore locks access file way choose words file locks lock file lockers i/o two kinds locks offered shared locks exclusive locks case codice_1 different kinds locks may applied different sections byte ranges file else whole file shared locks held multiple processes time exclusive lock held one process coexist shared lock acquire shared lock process must wait processes hold exclusive locks acquire exclusive lock process must wait processes hold either kind lock unlike locks created codice_1 created codice_3 preserved across codice_4s making useful forking servers therefore possible one process hold exclusive lock file provided processes share filial relationship exclusive lock initially created single process duplicated across codice_4 shared locks sometimes called read locks exclusive locks sometimes called write locks however locks unix advisory n't enforced thus possible database concept shared writes vs. exclusive writes example changing field place may permitted shared access whereas garbage-collecting rewriting database may require exclusive access file locks apply actual file rather file name important since unix allows multiple names refer file together non-mandatory locking leads great flexibility accessing files multiple processes hand cooperative locking approach lead problems process writes file without obeying file locks set processes reason unix-like operating systems also offer limited support mandatory locking systems file whose setgid bit whose group execution bit file opened subject automatic mandatory locking underlying filesystem supports however non-local nfs partitions tend disregard bit file subject mandatory locking attempts read region locked exclusive lock write region locked shared exclusive lock block lock released strategy first originated system v seen today solaris hp-ux linux operating systems part posix however bsd-derived operating systems freebsd openbsd netbsd apple macos support linux also supports mandatory locking special -o mand parameter filesystem mounting rarely used unix-like operating systems prevent attempts open executable file running program writing third form locking separate provided codice_1 codice_3 one process hold exclusive codice_3 given file exclusive lock duplicated across later codice_4 simplifies coding network servers helps prevent race conditions confusing unaware mandatory locks effect codice_10 system call consequently certain programs may effectively circumvent mandatory locking authors advanced programming unix environment second edition observed codice_11 editor indeed page 456 whether codice_3 locks work network filesystems nfs implementation dependent bsd systems codice_3 calls file descriptor open file nfs-mounted partition successful no-ops linux prior 2.6.12 codice_3 calls nfs files would act locally kernel 2.6.12 implement codice_3 calls nfs files using posix byte-range locks locks visible nfs clients implement codice_1-style posix locks invisible lock upgrades downgrades release old lock applying new lock application downgrades exclusive lock shared lock another application blocked waiting exclusive lock latter application may get exclusive lock lock first application means lock downgrades block may counterintuitive codice_1 locks associated file given process removed file descriptor file closed process even lock never requested file descriptor also codice_1 locks inherited child process codice_1 close semantics particularly troublesome applications call subroutine libraries may access files neither bugs occurs using real codice_3-style locks preservation lock status open file descriptors passed another process using unix domain socket implementation dependent one source lock failure occurs buffered i/o buffers assigned user local workspace rather operating system buffer pool fread fwrite commonly used buffered i/o section file read another attempt read section likely obtain data local buffer problem another user attached file local buffers thing happening fwrite data obtained buffer fread obtaining data file user could changed could use flock exclusive access prevents simultaneous writes since reads reading buffer file data changed user 1 lost user 2 overwritten best solution problem use unbuffered i/o read write flock also means using lseek instead fseek ftell course 'll make adjustments function parameters results returned generally speaking buffered i/o unsafe used shared files amiga os lock file directory acquired using codice_21 function codice_22 lock shared processes read file/directory ca n't modify delete exclusive process successfully acquires lock access modify object lock whole object part lock must released codice_23 function unlike unix operating system implicitly unlock object process terminates shell scripts programs often use strategy similar use file locking creation lock files files whose contents irrelevant although often one find process identifier holder lock file whose sole purpose signal presence resource locked lock file often best approach resource controlled regular file using methods locking files apply example lock file might govern access set related resources several different files directories group disk partitions selected access higher level protocols like servers database connections using lock files care must taken ensure operations atomic obtain lock process must verify lock file exist create whilst preventing another process creating meantime various methods include lock files often named tilde codice_27 prefixed name file locking locking resource file may named arbitrarily certain mozilla products firefox thunderbird sunbird use type file resource lock mechanism using temporary file named parent.lock unlocker utility used determine process locking file displays list processes well choices process kill task unlock etc along list file options delete rename unix-like systems utilities used inspect state file locks process filename windows systems file locked possible schedule moving deletion performed next reboot approach typically used installers replace locked system files version control systems file locking used prevent two users changing file version parallel saving second user overwrite first user changed implemented marking locked files read-only file system user wanting change file performs unlock also called checkout operation check-in store operation done lock reverted nobody else allowed unlock file | [
1710,
4751,
4843,
5637,
1534,
7246,
900,
4771,
2104,
473,
6267,
7533,
4318,
5571,
2118,
3463,
578,
3638,
6289,
2767,
6380,
5859,
7667,
2885,
6242,
5784,
2704,
4017,
2359
] | Test |
1,631 | 4 | Deception_technology:deception technology deception technology emerging category cyber security defense deception technology products detect analyze defend zero-day advanced attacks often real time automated accurate provide insight malicious activity within internal networks may unseen types cyber defense deception technology enables proactive security posture seeking deceive attackers detect defeat allowing enterprise return normal operations existing defense-in-depth cyber technologies struggled increasing wave sophisticated persistent human attackers technologies seek primarily defend perimeter firewalls end-point security defend perimeter 100 certainty cyber-attackers penetrate networks move unimpeded months stealing data intellectual property heuristics may find attacker within network often generate many alerts critical alerts missed since 2014 attacks accelerated evidence cyber-attackers penetrating traditional defenses rapidly increasing rate deception technology considers human attacker point view method exploiting navigating networks identify exfiltrate data integrates existing technologies provide new visibility internal networks share high probability alerts threat intelligence existing infrastructure deception technology automates creation traps decoys and/or lures mixed among within existing resources provide layer protection stop attackers penetrated network traps decoys assets either use real licensed operating system software emulations devices traps decoys use emulations also imitate medical devices automated teller machines atms retail point sale systems switches routers much lures generally real information technology resources files varying kinds placed actual assets upon penetrating network attackers seek establish backdoor use identify exfiltrate data intellectual property begin moving laterally internal vlans almost immediately look one traps decoys interacting one decoys trigger alert alerts high probability almost always coincide ongoing attack deception designed lure attacker β attacker may consider worthy asset continue injecting malware deception technology generally allows automated static dynamic analysis injected malware provides reports automation security operations personnel deception technology may also identify indicators compromise ioc suspect end-points part compromise cycle automation also allows automated memory analysis suspect end-point automatically isolating suspect end-point many partner integrations allow variety implementation paths existing enterprise government customers internet things iot devices usually scanned legacy defense depth cyber defense remain prime targets attackers within network deception technology identify attackers moving laterally network within devices integrated turnkey devices utilize embedded operating systems allow operating systems scanned closely protected embedded end-point intrusion detection software also well protected deception technology deployment network examples include process control systems scada used many manufacturing applications global basis deception technology associated discovery zombie zero attack vector wherein deception technology identified attacker utilizing malware embedded barcode readers manufactured overseas medical devices particular vulnerable cyber attacks within healthcare networks fda-certified devices closed systems accessible standard cyber defense software deception technology surround protect devices identify attackers using backdoor placement data exfiltration recent documented cyber attacks medical devices include x-ray machines ct scanners mri scanners blood gas analyzers pacs systems many networks utilizing devices protected deception technology attack vector called medical device hijack medjack estimated penetrated many hospitals worldwide specialized deception technology products capable addressing rise ransomware select products deceive ransomware engaging attack decoy resource isolating infection points alerting cyber defense software team honeypots perhaps first simple form deception honeypot appeared simply unprotected information technology resource presented attractive way prospective attacker already within network notion honeypots deceiving attackers perhaps delaying identifying ultimately supporting efforts shut attack good one potential benefits aside early honeypots exhibit challenges functionality integrity overall efficacy meeting goals key lack automation enabled broad scale deployment deployment strategy would seek cover enterprise tens thousands vlans must protected wo n't economically efficient using manual processes manual configuration gap legacy honeypots modern deception technology diminished time continue modern honeypots constitute low end deception technology space today traditional cyber defense technologies firewalls end-point security generate many alerts large enterprise alert volume may reach cases millions alerts per day security operations personnel process activity easily yet takes one successful penetration compromise entire network deception technology produces alerts end product binary process probability essentially reduced two values 0 100 party seeks identify ping enter view trap decoy utilizes lure immediately identified behavior anyone touching traps lures advantage heuristics probability-based approaches many thousands extraneous alerts techniques generate best practice shows deception technology stand-alone strategy deception technology additional compatible layer existing defense-in-depth cyber defense partner integrations make useful goal add protection advanced sophisticated human attackers successfully penetrate perimeter technical innovation deception technology received market industry analyst identified ten top technologies information security 2016 one deception technology industry analyst predicted august 2016 deception technology market currently 2016 approximately 50 100 million globally predicted 100 million 200 million revenue 2018 analyst earlier noted 2018 ... 10 percent enterprises use deception tools tactics actively participate deception operations attackers gartner also noted deception technology far underutilized technology provide serious advantages attackers cyber attackers two important analysts recently predicted market size exceeding 1 billion 2020 adoption fueled part continued highly visible targeted attacks large enterprise government institutions globally market research media estimates cumulative deception technology market value 12 billion 2017β2022 growing 19 cagr | [
7282,
74,
651,
8109,
5571,
2844,
3480,
1376,
6062,
5444,
7139
] | Test |
1,632 | 4 | Mega-D_botnet:mega-d botnet mega-d also known alias ozdok botnet peak responsible sending 32 spam worldwide october 14 2008 u.s federal trade commission cooperation marshal software tracked owners botnet froze assets november 6 2009 security company fireeye inc. disabled mega-d botnet disabling command control structure akin srizbi botnet takedown late 2008 mega-d/ozdok takedown involved coordination dozens internet service providers domain name registrars non-profit organizations like shadowserver m86 security researchers estimated take immediate effect spam botnet november 9 2009 spam stopped altogether although small trickle weekend directed couple small uk-based domains monitored since botnet bounced back exceeding pre-takedown levels nov. 22 constituting 17 worldwide spam dec. 13 july 2010 researchers university california berkeley published model mega-d protocol state-machine revealing internals proprietary protocol first time protocol obtained automatic reverse engineering technique developed berkeley researchers among contributions research paper reveals flaw mega-d protocol allowing template milking i.e. unauthorized spam template downloading flaw could used acquire spam templates train spam filters spam hits network november 2010 oleg nikolaenko arrested las vegas nevada federal bureau investigation charged violations can-spam act 2003 nikolaenko suspected operating mega-d botnet create zombie network many 500,000 infected computers | [
2173,
3170,
2632,
2376,
6715,
7441,
3281,
651,
7186,
3875,
2577,
5401,
6740,
6370,
5675,
7657,
51,
7294,
2693,
2789,
7307,
3154,
7600,
2535,
4110,
6328
] | Test |
1,633 | 0 | Eva_HajiΔovΓ‘:eva hajiΔovΓ‘ eva hajiΔovΓ‘ born 23 august 1935 czech linguist specializing topicβfocus articulation corpus linguistics 2006 awarded association computational linguistics acl lifetime achievement award named fellow acl 2011 | [
2595,
5388
] | Test |
1,634 | 7 | Zoho_Corporation:zoho corporation zoho corporation indian software development company focus zoho corporation lies web-based business tools information technology including office tools suite internet things management platform suite management software company founded 1996 sridhar vembu tony thomas pleasanton california offices seven countries global headquarters chennai 1996 2009 company known adventnet inc. adventnet expanded operations japan june 2001 zoho crm released 2005 followed releases projects creator sheet 2006 zoho expanded collaboration space release zoho docs zoho meeting 2007 2008 company added invoicing mail applications claims reached 10 lakh 1 million users august year 2009 company renamed zoho corporation online office suite name company launched grew without outside funding privately owned interview 2016 founder ceo sridhar vembu said one reasons zoho shunning outside funding financialisation associated investments would often put immense pressure funded company focus excessively return investments company would lose sight human objectives whereas beyond money also mission purpose life first zoho user conference zoholics launched 2012 year since 2005 zoho released additional applications 2017 released zoho one comprehensive suite zoho applications zoho headquartered chennai tamil nadu 2019 12 offices around world us headquarters currently pleasanton california plans move austin texas 2021 research development campus estancia park chennai zoho office tenkasi tirunelveli district tamil nadu product zoho desk built launched company operates china also offices singapore japan bulk support operations carried office chennai.zoho also office renigunta andhra pradesh operating office since 2018 | [
370,
7165,
3954,
3958,
6806,
22,
3627,
7177,
2212,
3309,
754,
5064,
6476,
2961,
2608,
1514,
2988,
7613,
1550,
6906,
5135,
3028,
2317,
842,
511,
1982,
2700,
5889,
5894,
189,
3091,
6262,
7722,
5927,
7741,
5940,
2430,
7037,
4211,
4217,
632... | Test |
1,635 | 4 | Fully_undetectable:fully undetectable fully undetectable usually shortened fud stand data encrypted making appear random noise also stand software detected anti-viruses scan performed term used hacker circles refer something appears clean many anti-viruses even though hacking tool | [
3486,
2566,
7194
] | Test |
1,636 | 3 | BioCompute_Object:biocompute object biocompute object bco project community-driven initiative build framework standardizing sharing computations analyses generated high-throughput sequencing hts also referred next-generation sequencing ngs massively parallel sequencing mps originally started collaborative contract george washington university food drug administration project grown include 20 universities biotechnology companies public-private partnerships pharmaceutical companies including seven bridges harvard medical school bco aims ease exchange hts workflows various organizations fda pharmaceutical companies contract research organizations bioinformatic platform providers academic researchers one biggest challenges bioinformatics documenting sharing scientific workflows way computation results peer-reviewed reliably reproduced bioinformatic pipelines typically use multiple pieces software typically multiple versions available multiple input parameters multiple outputs possibly platform-specific configurations experimental parameters laboratory protocol small changes computational parameters may large impact scientific validity results biocompute framework provides object oriented design bco contains details pipeline used constructed digitally signed shared biocompute concept originally developed satisfy fda regulatory research review needs evaluation validation verification genomics data however biocompute framework follows fair data principles used broadly provide communication interoperability different platforms industries scientists regulators standardization genomic data biocompute objects mostly useful three groups users 1 academic researchers carrying new genetic experiments 2 pharma/biotech companies wish submit work fda regulatory review 3 clinical settings hospitals labs offer genetic tests personalized medicine utility academic researchers ability reproduce experimental data accurately less uncertainty utility entities wishing submit work fda streamlined approach less uncertainty ability accurately reproduce work clinical settings critical hts data clinical metadata transmitted accurate way ideally standardized way readable stakeholder including regulatory partners biocompute object json format minimum contains software versions parameters necessary evaluate verify computational pipeline may also contain input data files links reference genomes executable docker components biocompute object integrated hl7 fhir provenance resource common workflow language research object biocompute object working group facilitates means different stakeholders provide input current practices bco working group formed preparation 2017 hts computational standards regulatory sciences workshop initially made workshop participants continual growth bco working group direct result interaction variety stakeholders interested communities standardization computational hts data processing public-private partnerships formed universities private genomic data companies software platforms government regulatory institutions easy point entry new individuals institutions bco project participate discussion best practices objects | [
6489,
2087
] | Test |
1,637 | 2 | Geoffrey_Knauth:geoffrey knauth geoffrey s. knauth board directors free software foundation teaches computer science lycoming college contributed gnu objective-c collection library degree economics harvard university | [
1523,
8158,
3174,
1351,
2559,
3868,
6365,
7463,
7559,
3981,
4070,
2599,
1406,
6674,
5787,
966
] | Test |
1,638 | 3 | Popek_and_Goldberg_virtualization_requirements:popek goldberg virtualization requirements popek goldberg virtualization requirements set conditions sufficient computer architecture support system virtualization efficiently introduced gerald j. popek robert p. goldberg 1974 article formal requirements virtualizable third generation architectures even though requirements derived simplifying assumptions still represent convenient way determining whether computer architecture supports efficient virtualization provide guidelines design virtualized computer architectures system virtual machines capable virtualizing full set hardware resources including processor processors memory storage resources peripheral devices virtual machine monitor vmm also called hypervisor piece software provides abstraction virtual machine three properties interest analyzing environment created vmm terminology popek goldberg vmm must present three properties terminology used reference book smith nair 2005 vmms typically assumed satisfy equivalence resource control properties additionally meeting performance property called efficient vmms popek goldberg describe characteristics instruction set architecture isa physical machine must possess order run vmms possess properties analysis derives characteristics using model third generation architectures e.g. ibm 360 honeywell 6000 dec pdp-10 nevertheless general enough extended modern machines model includes processor operates either system user mode access linear uniformly addressable memory assumed subset instruction set available system mode memory addressed relative relocation register i/o interrupts modelled derive virtualization theorems give sufficient necessary conditions virtualization popek goldberg introduce classification instructions isa 3 different groups main result popek goldberg analysis expressed follows theorem 1 conventional third-generation computer effective vmm may constructed set sensitive instructions computer subset set privileged instructions intuitively theorem states build vmm sufficient instructions could affect correct functioning vmm sensitive instructions always trap pass control vmm guarantees resource control property non-privileged instructions must instead executed natively i.e. efficiently holding equivalence property also follows theorem also provides simple technique implementing vmm called trap-and-emulate virtualization recently called classic virtualization sensitive instructions behave nicely vmm trap emulate every one related problem deriving sufficient conditions recursive virtualization conditions vmm run copy built popek goldberg present following sufficient conditions theorem 2 conventional third-generation computer recursively virtualizable architectures like non-hardware-assisted x86 meet conditions virtualized classic way architectures still fully virtualized x86 case meaning cpu mmu level using different techniques like binary translation replaces sensitive instructions generate traps sometimes called critical instructions additional processing however makes vmm less efficient theory hardware traps non-negligible performance cost well well-tuned caching binary translation system may achieve comparable performance case x86 binary translation relative first generation x86 hardware assist merely made sensitive instructions trappable effectively gives theorem different sufficiency conditions theorem 3 hybrid vmm may constructed third generation machine set user sensitive instructions subset set privileged instructions conditions isa virtualization expressed theorem 1 may relaxed expense efficiency property vmms non-virtualizable isas popek goldberg sense routinely built virtualization architectures requires correct handling critical instructions i.e. sensitive unprivileged instructions one approach known patching adopts techniques commonly used dynamic recompilation critical instructions discovered run-time replaced trap vmm various mechanisms caching emulation code hardware assists proposed make patching process efficient different approach paravirtualization requires guest operating systems modified ported running virtual environment section presents relevant architectures relate virtualization requirements pdp-10 architecture instructions sensitive alter query processor mode privileged instructions save restore condition codes containing user iot bits sensitive instructions system/370 privileged satisfies virtualization requirements motorola mc68000 single unprivileged sensitive instruction instruction sensitive allows access entire status register includes condition codes also user/supervisor bit interrupt level trace control later family members starting mc68010 move sr instruction made privileged new move ccr instruction provided allow access condition code register ia-32 instruction set pentium processor contains 18 sensitive unprivileged instructions categorized two groups introduction amd-v intel vt-x instruction sets 2005 allows x86 processors meet popek goldberg virtualization requirements effort needed support virtualization ia-64 architecture described 2000 article magenheimer christian hyperprivileged mode ultrasparc architecture specified ultrasparc architecture 2005 defines sun4v platform super-set sun4u platform still compliant sparc v9 level-1 specification sensitive instructions powerpc instruction set privileged efficiency requirement popek goldberg definition vmm concerns execution non-privileged instructions must execute natively distinguishes vmm general class hardware emulation software unfortunately even architecture meets popek goldberg requirements performance virtual machine differ significantly actual hardware early experiments performed system/370 meets formal requirements theorem 1 showed performance virtual machine could low 21 native machine benchmarks cost trapping emulating privileged instructions vmm significant led ibm engineers introduce number hardware assists roughly doubled performance system/370 virtual machines assists added several stages end 100 assists late models system/370 one main driving factors development hardware assists system/370 virtual memory guest operating system implemented virtual memory even non-privileged instructions could experience longer execution times penalty imposed requirement access translation tables used native execution see shadow page tables | [
3761,
4845,
1454,
5911,
6984,
2567,
5571,
1880,
4985,
5079,
3747,
352,
8145
] | Test |
1,639 | 3 | Wide-issue:wide-issue wide-issue architecture computer processor issues one instruction per clock cycle considered three broad types | [
7449,
4847
] | Test |
1,640 | 3 | Cache_(computing):cache computing computing cache aue hardware software component stores data future requests data served faster data stored cache might result earlier computation copy data stored elsewhere cache hit occurs requested data found cache cache miss occurs cache hits served reading data cache faster recomputing result reading slower data store thus requests served cache faster system performs cost-effective enable efficient use data caches must relatively small nevertheless caches proven many areas computing typical computer applications access data high degree locality reference access patterns exhibit temporal locality data requested recently requested already spatial locality data requested stored physically close data already requested inherent trade-off size speed given larger resource implies greater physical distances also tradeoff expensive premium technologies sram vs cheaper easily mass-produced commodities dram hard disks buffering provided cache benefits bandwidth latency larger resource incurs significant latency access e.g take hundreds clock cycles modern 4 ghz processor reach dram mitigated reading large chunks hope subsequent reads nearby locations prediction explicit prefetching might also guess future reads come make requests ahead time done correctly latency bypassed altogether use cache also allows higher throughput underlying resource assembling multiple fine grain transfers larger efficient requests case dram circuits might served wider data bus example consider program accessing bytes 32-bit address space served 128-bit off-chip data bus individual uncached byte accesses would allow 1/16th total bandwidth used 80 data movement would memory addresses instead data reading larger chunks reduces fraction bandwidth required transmitting address information hardware implements cache block memory temporary storage data likely used central processing units cpus hard disk drives hdds frequently use cache web browsers web servers cache made pool entries entry associated data copy data backing store entry also tag specifies identity data backing store entry copy cache client cpu web browser operating system needs access data presumed exist backing store first checks cache entry found tag matching desired data data entry used instead situation known cache hit example web browser program might check local cache disk see local copy contents web page particular url example url tag content web page data percentage accesses result cache hits known hit rate hit ratio cache alternative situation cache checked found contain entry desired tag known cache miss requires expensive access data backing store requested data retrieved typically copied cache ready next access cache miss previously existing cache entry removed order make room newly retrieved data heuristic used select entry replace known replacement policy one popular replacement policy least recently used lru replaces oldest entry entry accessed less recently entry see cache algorithm efficient caching algorithms compute use-hit frequency size stored contents well latencies throughputs cache backing store works well larger amounts data longer latencies slower throughputs experienced hard drives networks efficient use within cpu cache system writes data cache must point write data backing store well timing write controlled known write policy two basic writing approaches write-back cache complex implement since needs track locations written mark dirty later writing backing store data locations written back backing store evicted cache effect referred lazy write reason read miss write-back cache requires block replaced another often require two memory accesses service one write replaced data cache back store one retrieve needed data policies may also trigger data write-back client may make many changes data cache explicitly notify cache write back data since data returned requester write operations decision needs made write misses whether data would loaded cache defined two approaches write-through write-back policies use either write-miss policies usually paired way entities cache may change data backing store case copy cache may become out-of-date stale alternatively client updates data cache copies data caches become stale communication protocols cache managers keep data consistent known coherency protocols small memories close cpu operate faster much larger main memory cpus since 1980s used one caches sometimes cascaded levels modern high-end embedded desktop server microprocessors may many six types cache levels functions examples caches specific function d-cache i-cache translation lookaside buffer mmu earlier graphics processing units gpus often limited read-only texture caches introduced morton order swizzled textures improve 2d cache coherency cache misses would drastically affect performance e.g mipmapping used caching important leverage 32-bit wider transfers texture data often little 4 bits per pixel indexed complex patterns arbitrary uv coordinates perspective transformations inverse texture mapping gpus advanced especially gpgpu compute shaders developed progressively larger increasingly general caches including instruction caches shaders exhibiting increasingly common functionality cpu caches example gt200 architecture gpus feature l2 cache fermi gpu 768 kb last-level cache kepler gpu 1536 kb last-level cache maxwell gpu 2048 kb last-level cache caches grown handle synchronisation primitives threads atomic operations interface cpu-style mmu digital signal processors similarly generalised years earlier designs used scratchpad memory fed dma modern dsps qualcomm hexagon often include similar set caches cpu e.g modified harvard architecture shared l2 split l1 i-cache d-cache memory management unit mmu fetches page table entries main memory specialized cache used recording results virtual address physical address translations specialized cache called translation lookaside buffer tlb cpu caches generally managed entirely hardware variety software manages caches page cache main memory example disk cache managed operating system kernel disk buffer integrated part hard disk drive sometimes misleadingly referred disk cache main functions write sequencing read prefetching repeated cache hits relatively rare due small size buffer comparison drive capacity however high-end disk controllers often on-board cache hard disk drive data blocks finally fast local hard disk drive also cache information held even slower data storage devices remote servers web cache local tape drives optical jukeboxes scheme main concept hierarchical storage management also fast flash-based solid-state drives ssds used caches slower rotational-media hard disk drives working together hybrid drives solid-state hybrid drives sshds web browsers web proxy servers employ web caches store previous responses web servers web pages images web caches reduce amount information needs transmitted across network information previously stored cache often re-used reduces bandwidth processing requirements web server helps improve responsiveness users web web browsers employ built-in web cache internet service providers isps organizations also use caching proxy server web cache shared among users network another form cache p2p caching files sought peer-to-peer applications stored isp cache accelerate p2p transfers similarly decentralised equivalents exist allow communities perform task p2p traffic example corelli cache store data computed demand rather retrieved backing store memoization optimization technique stores results resource-consuming function calls within lookup table allowing subsequent calls reuse stored results avoid repeated computation related dynamic programming algorithm design methodology also thought means caching bind dns daemon caches mapping domain names ip addresses resolver library write-through operation common operating unreliable networks like ethernet lan enormous complexity coherency protocol required multiple write-back caches communication unreliable instance web page caches client-side network file system caches like nfs smb typically read-only write-through specifically keep network protocol simple reliable search engines also frequently make web pages indexed available cache example google provides cached link next search result prove useful web pages web server temporarily permanently inaccessible another type caching storing computed results likely needed memoization example ccache program caches output compilation order speed later compilation runs database caching substantially improve throughput database applications example processing indexes data dictionaries frequently used subsets data distributed cache uses networked hosts provide scalability reliability performance application hosts co-located spread different geographical regions semantics buffer cache totally different even fundamental differences intent process caching process buffering fundamentally caching realizes performance increase transfers data repeatedly transferred caching system may realize performance increase upon initial typically write transfer data item performance increase due buffering occurring within caching system read caches data item must fetched residing location least order subsequent reads data item realize performance increase virtue able fetched cache faster intermediate storage rather data residing location write caches performance increase writing data item may realized upon first write data item virtue data item immediately stored cache intermediate storage deferring transfer data item residing storage later stage else occurring background process contrary strict buffering caching process must adhere potentially distributed cache coherency protocol order maintain consistency cache intermediate storage location data resides buffering hand typical caching implementations data item read written first time effectively buffered case write mostly realizing performance increase application write originated additionally portion caching protocol individual writes deferred batch writes form buffering portion caching protocol individual reads deferred batch reads also form buffering although form may negatively impact performance least initial reads even though may positively impact performance sum individual reads practice caching almost always involves form buffering strict buffering involve caching buffer temporary memory location traditionally used cpu instructions directly address data stored peripheral devices thus addressable memory used intermediate stage additionally buffer may feasible large block data assembled disassembled required storage device data may delivered different order produced also whole buffer data usually transferred sequentially example hard disk buffering sometimes increases transfer performance reduces variation jitter transfer latency opposed caching intent reduce latency benefits present even buffered data written buffer read buffer cache also increases transfer performance part increase similarly comes possibility multiple small transfers combine one large block main performance-gain occurs good chance data read cache multiple times written data soon read cache sole purpose reduce accesses underlying slower storage cache also usually abstraction layer designed invisible perspective neighboring layers | [
5012,
3942,
1447,
5371,
3948,
1826,
379,
7529,
5737,
6809,
5042,
399,
7552,
2578,
2579,
1481,
5055,
2226,
4347,
1867,
757,
1123,
7213,
2248,
5780,
6148,
436,
3338,
441,
2617,
6156,
6505,
2270,
4384,
5805,
2633,
7242,
108,
4047,
5483,
76... | Test |
1,641 | 4 | Zygalski_sheets:zygalski sheets method zygalski sheets cryptologic technique used polish cipher bureau world war ii war also british cryptologists bletchley park decrypt messages enciphered german enigma machines zygalski-sheet apparatus takes name polish cipher bureau mathematicianβcryptologist henryk zygalski invented october 1938 zygalski device comprised set 26 perforated sheets initially six possible sequences inserting three rotors enigma machine scrambler sheet related starting position left slowest-moving rotor 26 Γ 26 matrix represented 676 possible starting positions middle right rotors duplicated horizontally vertically aβz aβy sheets punched holes positions would allow female occur polish mathematicianβcryptologist marian rejewski writes perforated-sheets device operated like rejewski card-catalog method developed using cyclometer zygalski-sheet procedure independent number plugboard plug connections enigma machine cipher bureau manual manufacture sheets security reasons done mathematician-cryptologists using razor blades time-consuming 15 december 1938 third job finished date germans introduced rotors iv v thus increasing labor making sheets tenfold since ten times many sheets needed 60 possible combinations sequences enigma machine 3 rotors selected among 5 25 july 1939 five weeks outbreak world war ii polish general staff cipher bureau disclosed french british allies warsaw cryptologic achievements breaking enigma ciphers part disclosures involved zygalski perforated-sheet method british bletchley park near london england undertook production two complete sets perforated sheets work done aid perforators section headed john r.f jeffreys sheets known bletchley netz netzverfahren net method though later remembered gordon welchman jeffreys sheets latter term however referred another catalog produced jeffreys section first set completed late december 1939 28 december part second set delivered polish cryptologists escaped german-overrun poland pc bruno outside paris france remaining sheets completed 7 january 1940 couriered alan turing france shortly thereafter help writes rejewski continued solving enigma daily keys sheets used poles make first wartime decryption enigma message 17 january 1940 may 1940 germans completely changed procedure enciphering message keys exception norwegian network result zygalski sheets use though herivel tip could still used | [
5185,
6372,
5796
] | Test |
1,642 | 4 | US_Cyber_Challenge:us cyber challenge us cyber challenge private-public partnership program dedicated finding high level cybersecurity talent endeavor significantly reduce shortage today cyber workforce program identifies attracts recruits trains next generation cybersecurity professionals us cyber challenge currently program council cybersecurity center internet security us cyber challenge founded 2010 karen s. evans former administrator office electronic government information technology office management budget mission us cyber challenge fill workforce gap cybersecurity professionals process assessment training employment networking summer 2015 us cyber challenge hosted four camps across country two camps statewide camps located delaware illinois two camps regional camps located virginia eastern regional utah western regional camp schedule order qualify invitation one four cyber camps individuals must compete online qualifying competition cyber quests 2015 cyber quests schedule | [
2829
] | Test |
1,643 | 1 | Propel_(PHP):propel php propel free open-source mit object-relational mapping toolkit written php also integral part php framework symfony default orm including version 1.2 propel project started august 2003 availability beta versions php version 5 version 5 php finally able provide level support object-oriented programming made projects like propel possible also created demand hitherto-missing components large-scale object-oriented architectures propel originally based apache torque project java language orm project propel primary function provide mapping php classes database tables accomplish propel includes generator component uses source code generation build php classes based datamodel definition written xml propel also includes runtime component manages connections transactions idiosyncratic rules describe workings rdbms used propel | [
2180,
4296,
6701,
1737,
4944,
5571,
6029,
7933,
5433,
4998,
3915,
6594,
5092
] | Train |
1,644 | 3 | Imagination_Creator:imagination creator creator family single-board computers developed imagination technologies promote educational research software development based mips architecture first board platform creator ci20 released august 2014 second development kit called creator ci40 introduced kickstarter campaign november 2015 creator ci20 board based ingenic jz4780 mobile-class application processor contains dual-core 1.2 ghz mips32 cpu 32k l1 cache 512k l2 cache ieee754 floating point unit coupled powervr sgx540 gpu processor supports mxu 32-bit simd extension addition board provides creator ci40 board based cxt200 chip optimized specifically iot applications contains dual-core dual-threaded 550 mhz mips interaptiv cpu 32k l1 cache 512k l2 cache ieee754 floating point unit coupled ensigma c4500 wi-fi radio processor addition board provides creator boards support creator iot framework open source software package based lwm2m protocol developed open mobile alliance | [
5055,
1644,
5571,
1237
] | Test |
1,645 | 3 | LGA_1356:lga 1356 lga 1356 land grid array 1356 pins also called socket b2 intel microprocessor socket released q1 2012 two processor 2p i.e dual socket segment server market supports 3 64-bit wide ddr3 channels whereas socket lga 2011 supports 4 channels socket lga 1155 supports 2 channels lga 1356 one two sockets designed replacement lga 1366 cpu socket lga 2011 known socket r lga 1356 1356 protruding pins make contact pads processor processors lga 1356 lga 1366 sockets compatible since different socket notches supports intel sandy bridge-en microprocessors code-named romley-en marketed xeon e5-2400 series main difference lga 2011 lga 1356 2 intel quickpath interconnect qpi connections lga 2011 1 qpi connection lga 1356 noticeable differences include 24 lanes pci express pci-e version 3.0 connections compared 40 lanes lga 2011 three channels ddr3 support compared four lga 2011 ddr3 channel support one dimm applicable ddr3 ddr3-l plans leaked early 2011 estimated releases first quarter 2012 september 2011 releases estimated end first quarter 2012 socket b2 processors following mechanical maximum load limits exceeded heatsink assembly shipping conditions standard use load limits crack processor die make unusable processors using socket static load limit previous models using lga 1366 socket b | [
2541,
4123,
3942,
3849,
3443,
1729,
2828,
6173,
7974,
2830,
3002,
4314,
5379,
3193,
1841,
3203,
4968,
3385,
4972,
5853,
3565,
2685,
6935,
8021,
7302,
691,
5963,
866,
3333,
7134,
262,
6683,
5886
] | Train |
1,646 | 3 | RH1750:rh1750 rh1750 radiation-hardened implementation mil-std-1750a processor produced gec-plessey marconi communications primary target market aerospace industry | [
7043
] | Test |
1,647 | 4 | Jon_Callas:jon callas jon callas american computer security expert software engineer user experience designer technologist co-founder former cto global encrypted communications service silent circle held major positions digital equipment corporation apple pgp entrust considered one respected well-known names mobile security industry callas credited creating several internet engineering task force ietf standards including openpgp dkim zrtp wrote prior work entrust chief technical officer co-founder pgp corporation former chief technical officer entrust website callas describes entrepreneur innovator information business security including cryptography operating system security public key infrastructure intellectual property rights well innovator human-computer interactions collaboration social virtual reality also worked bruce schneier counterpane internet security one primary authors dkim method chief scientist original pgp inc. founded phil zimmermann callas member infosec think tank shmoo group callas received bsc mathematics university maryland college park attended 1977 1980 minored philosophy english literature member technical staff century computing 1980 1981 served principal software engineer digital equipment 1981 1993 working got work wide variety things graphics schedulers memory management operating system security created random password generator digital equipment designed pathworks network operating system well software macintosh client systems server systems running vms unix created cross-platform communications computers running mac os vms unix windows os/2 using appletalk decnet tcp/ip networks also developed software 3d pex ddx openvms osf/1 windows nt digital equipment folded callas co-founded world benders inc. worked 1993 1995 world benders lead architect developer meeting space cross-platform group collaboration product allowed people conduct meetings real-time existing networks callas held title senior scientist ii apple computer 1995 1997 describes firm β security privateer designed built next-generation cryptographic security products mac os x ios including 'filevault 2 full-disk encryption product also designed concurrent programming system high-performance computing 'transforms addition led engineering approvals fips 140 validation ios callas trusted security apple operating system worked apple whole disk encryption worst time working apple year steve jobs came back callas said apple worked gursharan sidhu inventor appletalk callas shipped first crypto built os called powertalk said failed far early although colleague bruce gaya managed hack piece password manager called keychain could run without rest powertalk thus rescued oblivion present keychain apple products completely utterly rewritten β proud saving joined pgp inc. developer pretty good privacy january 1997 chief scientist network associates nai bought pgp december 1997 callas became cto total network security division nai creating architecture direction company network security products serving primary author ietf openpgp standard director software engineering counterpane 1999 2001 serving co-architect counterpane managed security monitoring system β redundant system adaptive fail-over monitors networks three continents also led engineering team built system taking prototype operational four months managed counterpane export control process getting approval system including fifteen new ciphers senior architect wave systems corporation 2001 2002 lead architect wave embassy trust system performed security analysis created product security subsystems co-founded new pgp corporation 2002 worked server architect pgp july 2002 october 2009 time company principal author ietf openpgp standard rfc2440 developed pgp pretty good privacy universal server security privateer could tell 'd kill associates october 2009 july 2011 chief technical officer entrust provider identity-based security software july 2011 january 2013 co-founded silent circle 2012 blackphone 2013 continued serve cto silent circle april 2016 led development operations groups former produces apps manifest silent circle services subscribers latter runs actual services callas holds patents patents pending several systems methods erasing media facilitating secure media access secure transparent electronic communications dynamic security operations partial message authentication facilitating encryption decryption operations email server callas security product designs major innovation awards wall street journal others one primary authors dkim method member infosec think tank shmoo group served adjunct professor indiana university since 2012 callas lectured widely computers internet security scheduled speaker oslo freedom forum 2014 callas selected one two keynote speakers 2015 pdf technical conference san jose california may 2016 callas rejoined apple callas appeared january 11 2018 episode john wants answers callas stated tech companies bigger threat privacy government views stem big tech mass pooling personal data advertising polarization within silicon valley companies committed privacy many earn revenues selling user data callas stated advertising market takes downturn companies protect users data insulated harm lives san jose california | [
907,
8157,
1986,
3379,
5773,
1805
] | Test |
1,648 | 2 | VM/386:vm/386 vm/386 multitasking operating system 'control program took early advantage capabilities intel 386 processor utilizing virtual 8086 mode users able run existing text-based graphical dos software safely separate environments system offered high degree control ability set memory cpu usage limits unique config.sys autoexec.bat files could configured application even different dos versions 1991 vendor announced intentions support dpmi 1.0 vm/386 vm/386 initially developed softguard systems producer copy-protection software plans include features like non-dos system support financial constraints forced sale intelligent graphics corporation igc launched product 1987 pc magazine award technical excellence 1988 company also introduced multi-user version allowed number serial terminals even graphical systems connected single 386 computer current versions software built multi-user support handle tens users networked environment windows 3.11 support access controls virtual memory device sharing among features version software designed cooperate unix bundled everex systems workstations system sees use mainly vertical applications like point-of-sale systems ability run reliably cheap reliable hardware outweigh gains newer operating systems complex less reliable early competition included desqview 386 sunny hill software omniview starpath systems vmos/3 windows/386 2.01 target market shifted away single-user systems multiple-user setups many serial terminals began compete directly likes multiuser dos pc-mos/386 | [
1522,
7325,
7512,
7605,
280,
2818,
4759,
190,
4670,
5021,
8066,
8167,
4397,
13,
5644,
3271,
5116,
6984,
299,
3626,
7142,
3104,
5571,
2300,
5041,
7827,
4786,
6634,
578,
7550,
4244,
5232,
1992,
405,
6367,
1668,
6922,
8115,
5161,
5865,
739... | Validation |
1,649 | 4 | Penny_Black_(research_project):penny black research project penny black project microsoft research project tries find effective practical ways fighting spam identifying spams consumes recipient time idea make sender emails pay certain amount sending currency mode payment could cpu cycles turing tests memory cycles payment would limit spammers ability send large quantities emails quickly project name derived penny black world first adhesive stamp used paid postage goal project move e-mail costs receiver sender general idea sender must prove expended certain amount effort specifically receiver message alone project aims devise method without introducing additional challenge-response mechanisms third parties without requiring extra maintenance updates retaining current architecture e-mail system one project ideas ticket server credit-based method validating emails tickets would required perform actions sending emails three operations ticket server provides request ticket cancel ticket refund ticket server would allow user request ticket exchange proof work expending cpu cycles solving hard algorithms processing power turing tests even paying money server could also cancel ticket example receiving email ticket receiver could request ticket cancelled reused person cancels ticket also option refund ticket sender causes original sender regain new ticket example user might refund ticket came email spam using friendly trusted emails would little cost tickets would frequently refunded however spammers would required invest either lot computing time money order create enough tickets send large numbers e-mails one obvious flaws project entirely stop spam hopes slow spam enough longer cost effective spammers using methods reduce spam also require policies universal amongst mail clients intended mass email may also work intended example subscribers particular email service may end getting emails significant delay email service also become increased expenses provider | [
4135,
4159,
4734,
4643,
5571,
2772,
2482,
7164,
5231
] | Test |
1,650 | 5 | DIXIE:dixie dixie obsolete protocol accessing x.500 directory services dixie intended provide lightweight means clients access x.500 directory services dixie allowed tcp/ip clients connect dixie-to-dap gateway would provide access x.500 directory service design allows client access directory without requiring support cumbersome open systems interconnection protocol stack dixie created 1990 university michigan tim howes mark smith bryan beecher dixie formally specified rfc 1249 published 1991 university offered completed unix implementation protocol including dixie server application development library dixie clients dixie client apple macintosh also provided efforts led development lightweight directory access protocol ldap replaced dixie created acronym dixie stand anything however later became known stand directory interface x.500 implemented efficiently | [
7998,
3855,
7144
] | Test |
1,651 | 4 | Warrant_canary:warrant canary warrant canary method communications service provider aims inform users provider served secret government subpoena despite legal prohibitions revealing existence subpoena warrant canary typically informs users secret subpoena particular date canary updated time period specified host warning removed users assume host served subpoena intention allow provider warn users existence subpoena passively without disclosing others government sought obtained access information records secret subpoena secret subpoenas covered 18 u.s.c Β§2709 c usa patriot act provide criminal penalties disclosing existence warrant third party including service provider users united states secret subpoenas national security letters originated 1986 electronic communications privacy act used suspected agents foreign power revised 2001 patriot act secret subpoenas used anyone may information deemed relevant counter-intelligence terrorism investigations idea using negative pronouncements thwart nondisclosure requirements court orders served secret warrants first proposed steven schear cypherpunks mailing list mainly uncover targeted individuals isps also suggested used public libraries 2002 response usa patriot act would force librarians disclose circulation history patrons first commercial use warrant canary us cloud storage provider rsync.net began publishing canary 2006 addition digital signature provides recent news headline proof warrant canary recently posted well mirroring posting internationally november 5 2013 apple became prominent company publicly state never received order user data section 215 patriot act september 18 2014 gigaom reported warrant canary statement appear anymore next two apple transparency reports covering julyβdecember 2013 januaryβjune 2014 tumblr also included warrant canary transparency report issued february 3 2014 august 2014 online cloud service spider oak implemented encrypted warrant canary publishes clear message every 6 months three pgp signatures geographically distributed signers must sign message β government agency forced spideroak update page would need enlist help three signers september 2014 us security researcher moxie marlinspike wrote every lawyer 've spoken indicated 'canary remove choose update would likely legal consequences simply posting something explicitly says 've received something matter court exercising judicial power warrant could obtained another person prohibits disclosure existence non-existence however could easily remedied amalgamating right fair trial warrant canary australia everyone right fair trial case law larger picture law right access lawyer one write warrant canary way seeks access legal representation may effect triggering canary informing larger public existence secret warrant authority object remove notice seeking legal representation could seen authority infringement legal right australia goal canary effectively causing stay proceedings common law jurisdictions would cure inherent prohibition reducing warrant canaries matter negative positive action addition notice removal notice whatever case may australia outlawed use certain kind warrant canary march 2015 making illegal journalist disclose information existence non-existence warrant issued new mandatory data retention laws unlikely journalist could give correct canary situation anyway legislation agency obtaining warrant compelled inform journalist warrant afterwards computer security privacy specialist bruce schneier wrote blog post p ersonally never believed warrant canaries would work relies fact prohibition speaking n't prevent someone speaking courts generally n't impressed sort thing easily imagine secret warrant includes prohibition triggering warrant canary know right secret legal proceedings issue said case law specific united states would render covert continuance warrant canaries subject constitutionality challenges west virginia state board education v. barnette wooley v. maynard rule free speech clause prohibits compelling someone speak one wishes easily extended prevent someone compelled lie new york times co. v. united states protects one exercising first amendment publish government information even wishes government except grave exceptional circumstances previously set act precedent latter also carries weight acting direct government intervention similar government intervention warrant canary following list companies organizations whose warrant canaries longer appear transparency reports 2015 coalition organizations consisting eff freedom press foundation nyu law calyx institute berkman center created website called canary watch order provide compiled list companies providing warrant canaries mission provide prompt updates changes canary state often difficult users ascertain canary validity thus canary watch aimed provide simple display active canaries blocks time active may 2016 announced canary watch longer accept submissions new canaries monitor existing canaries changes take downs coalition organizations created canary watch explained decision discontinue project stating achieved goals raise awareness illegal unconstitutional national security process including national security letters secret court processes electronic frontier foundation also noted fact canaries non-standard makes difficult automatically monitor changes takedowns | [
907,
5202,
5889,
2876
] | Train |
1,652 | 2 | Comparison_of_OpenGL_and_Direct3D:comparison opengl direct3d direct3d opengl competing application programming interfaces apis used applications render 2d 3d computer graphics hardware acceleration process commonplace since approximately 1999. graphics processing units gpus almost always implement one version apis examples include directx 9 opengl 2 circa 2004 directx 10 opengl 3 circa 2008 recently directx 11 opengl 4 circa 2011 gpus support recent versions standards backward-compatible applications use older standards example one run older directx 9 games recent directx 11-certified gpu direct3d application development targets microsoft windows platform opengl api open standard means various hardware makers operating system developers freely create opengl implementation part system opengl implementations exist wide variety platforms notably opengl dominating graphics api unix-like computer systems application developer perspective direct3d opengl equally open full documentation necessary development tools available restrictions detail two computer graphics apis following note many essential opengl extensions methods although documented also patented thus imposing serious legal troubles implement see issues mesa opengl direct3d implemented display device driver significant difference however direct3d implements api common runtime supplied microsoft turn talks low-level device driver interface ddi opengl every vendor implements full api driver means api functions may slightly different behavior one vendor next glsl shader compilers different vendors also show slightly different behavior following compares two apis structured around various considerations mostly relevant game development proprietary direct3d officially implemented microsoft windows family operating systems including embedded versions used xbox family video game consoles sega dreamcast several mostly functional reimplementations direct3d api made third parties wine project port common windows apis unix-like operating systems cedega proprietary fork wine however process progressively impeded due interdependence directx upon many proprietary components windows direct3d proprietary nature requires difficult process reverse engineering opengl implementations available across many platforms including microsoft windows unix-based systems mac os x linux nintendo sony developed libraries similar identical opengl subset opengl chosen main graphics library android blackberry ios symbian opengl es form microsoft opengl driver provides hardware acceleration windows vista support dropped windows xp soon failed deliver fahrenheit graphics api low level support opengl-direct3d merger late 1990s opengl hardware acceleration windows achieved users first installing installable client drivers icds developed gpu makers icds virtually cases bundled standard driver download package hardware vendor ihv installing recent graphics drivers sufficient provide hardware opengl support recently google almost native graphics layer engine angle project provides means convert opengl es 2.0 application calls directx 9 done webgl subset variant opengl web run common direct3d runtime means less variation vendors first version direct3d 1996 elicited broad criticism even simple operations state changes required creating submitting objects called execute buffers contrast opengl state changes performed one function call direct3d model frustrated many programmers famous complaint made high-profile game developer john d. carmack codice_1 file urged microsoft abandon direct3d favor opengl chris hecker made similar request open letter microsoft aprilβmay 1997 issue game developer magazine version 5 second version named reflect release part directx 5 replaced execute buffers new drawprimitive api still considered cumbersome chris hecker open letter microsoft referred drawprimitive immature poorly-designed clone opengl missing architectural decisions make opengl fast despite controversy microsoft continued evolve api detailed history releases added features given microsoft direct3d web pages former critics direct3d acknowledge direct3d good better opengl abilities ease use january 2007 john carmack said β¦dx9 really quite good api level even direct3d side things know long history people thinking 'm antagonistic microsoft done good job sensibly evolving stepβthey 're worried breaking backwards compatibilityβand pretty clean api especially like work 'm 360 probably best graphics api far sensibly designed thing 've worked design features direct3d remained unchanged since version one notably reliance microsoft component object model com one advantage using com api used com-aware language notably object pascal delphi microsoft visual c++ c visual basic .net opengl specification implemented programming language c though used languages built concept state machine api opengl depends one programming language feature made callable almost language proper bindings bindings exist current programming languages general direct3d designed virtualize 3d hardware interfaces direct3d frees game programmer accommodating graphics hardware opengl hand designed 3d hardware-accelerated rendering system may emulated software two apis fundamentally designed two separate modes thought functional differences two apis work one functional difference apis manage hardware resources direct3d expects application opengl makes implementation tradeoff opengl decreases difficulty developing api time increasing complexity creating implementation driver performs well direct3d developer must manage hardware resources independently however implementation simpler developers flexibility allocate resources efficient way possible application 2005 another functional difference apis way handled rendering textures direct3d method codice_2 convenient prior versions opengl required manipulating pixel buffers p-buffers cumbersome risky codepath used program different anticipated driver maker code would fall back software rendering causing substantial performance drop however broad support frame buffer objects extension provided opengl equivalent direct3d method successfully addressed shortcoming render target feature opengl brought par direct3d aspect outside minor functional differences mostly addressed years two apis provide nearly level function hardware software makers generally respond rapidly changes directx e.g. pixel processor shader requirements directx 9 stream processors directx 10 tessellation directx 11 contrast new features opengl usually implemented first vendors retroactively applied standard shortly establishment direct3d opengl viable graphics libraries circa 1995 microsoft sgi engaged called api wars much argument revolved around api offered superior performance question relevant due high cost dedicated graphics processors time meant consumer market using software renderers implemented microsoft direct3d opengl dos business software autocad dos games id software quake originally optimized run many different graphics chipsets hardware makers 3dlabs member opengl architecture review board made opengl compatible graphics accelerators e.g. glint chip developers john carmack id software optimized products opengl multitasking user environments windows x window system x11 unix-like systems became prevalent relevance hardware faded microsoft marketed direct3d faster based in-house performance comparisons two software libraries performance deficit blamed rigorous specification conformance required opengl perception changed 1996 special interest group graphics interactive techniques siggraph conference time silicon graphics sgi challenged microsoft optimized windows software implementation opengl called cosmogl various demos matched exceeded performance direct3d sgi critical milestone showed opengl poor software rendering performance due microsoft reference opengl implementation due alleged design flaws opengl contrast software rendering 3d api largely irrelevant direct3d opengl applications many directx applications used direct3d software rendering preferring perform software rendering using directdraw facilities access display hardware opengl applications hardware support expected hardware much faster software fallback opengl application constituted rude surprise opengl developer case time sgi demonstrated opengl software rendering performance could competitive direct3d software rendering fast becoming irrelevant due wide availability low cost 3d graphics hardware 1998 even s3 virge graphics accelerator substantially faster fastest pentium ii running direct3d mmx rasterizer substantive modern performance difference arises structure hardware drivers provided hardware developers directx independent hardware vendor ihv drivers kernel-mode drivers installed operating system user-mode part api handled directx runtime provided microsoft opengl however ihv driver divided two parts user-mode part implements opengl api kernel-mode driver called user-mode part issue calling kernel-mode operations user-mode requires performing system call i.e. making cpu switch kernel mode slow operation taking order microseconds complete time cpu perform operations minimizing number times switching operation occurs would improve performance example gpu command buffer full rendering data api could simply store requested rendering call temporary buffer command buffer nearly empty perform switch kernel-mode add set stored commands batch termed marshalling direct3d ihv drivers kernel-mode user-mode code ihv hand chance optimizations occur direct3d runtime user-mode part implements api explicit knowledge driver inner workings effectively support marshalling means every direct3d call sends commands hardware must perform kernel-mode switch takes time order microseconds complete led several behaviors regarding use direct3d important need submitting large batches triangles one function call since opengl ihv drivers user-mode component ihvs ability implement marshalling thus improving performance still kernel-mode switching theoretical maximum number switches opengl implementations simply equal direct3d standard behavior direct3d 10 release included windows vista allows parts drivers run user-mode making possible ihvs implement marshalling thus bringing two back relative performance parity mac os x opengl system similar ihvs implement simpler version opengl api user kernel mode components apple additions runtime provide direct interface user code basic work make ihvs jobs easier introduction mantle amd lead increased discussion modernizing apis updating abstraction concepts used apis reflect graphics processing unit gpu operations microsoft opengl vendors began showcase visions limiting removing altogether driver overhead amount work cpu needs prepare gpu commands march 2014 microsoft presented basic assumptions goals directx12 3d component ready december 2015 opengl vendors took different approach gdc 2014 presented mix features mandatory opengl 4.3 opengl 4.4 already arb extensions show fast paths already present implementations nvidia amd intel later amd donated mantle khronos group api renamed vulkan current cross-platform api dedicated reduce driver overhead better distributing work among multiple cpu gpu cores using unified management compute kernels graphical shaders presentation apitest introduced new tool microbenchmarking specific solutions given problems emphasizing exploration fast paths current apis opengl 4.x direct3d 11 supported gathered results showed modern opengl many times faster direct3d 11 opengl originally designed then-powerful sgi workstations includes many features like stereo rendering imaging subset generally considered limited use games although stereoscopic gaming drawn interest development consumer-level 3d displays api whole contains 250 calls subset perhaps 100 useful game development however official gaming-specific subset ever defined minigl released 3dfx stopgap measure support glquake might served starting point additional features like stencil soon adopted games support full opengl standard continued today workstations consumer machines use architectures operating systems modern versions opengl standard still include features although special workstation-class video cards accelerate opengl extension mechanism probably heavily disputed difference two apis opengl includes mechanism driver advertise extensions api thus introducing new functions blend modes new ways transfer data gpus different texture wrapping parameters allows new functions exposed quickly lead confusion different vendors implement similar extensions different apis many extensions periodically standardized opengl architecture review board arb made core part future opengl revisions hand direct3d specified one vendor microsoft leading consistent api denying access vendor-specific features nvidia ultrashadow technology instance available stock direct3d apis time writing noted direct3d support texture format extensions via fourcc little-known rarely used used s3 texture compression graphics cards added support pixel shaders known opengl fragment shaders direct3d provided one pixel shader 1.1 ps1.1 standard geforce 3 radeon 8500 advertised compatibility opengl functions accessed variety custom extensions theory microsoft approach allows one code path support brands card whereas opengl programmers must write two separate systems reality though limits pixel processing early cards pixel shader 1.1 nothing pseudo-assembly language version nvidia-specific opengl extensions part cards claimed ps 1.1 functionality nvidia built natively radeon 8500 released microsoft released update direct3d included pixel shader 1.4 nothing pseudo-assembly language version ati-specific opengl extensions cards claimed ps 1.4 support ati cards designed precise hardware needed make functionality happen situation existed short time apis second-generation pixel shading cards functioned far similarly architecture evolving toward kind pixel processing conclusion pixel shader 2.0 allowed unified code path direct3d around time opengl introduced arb-approved vertex pixel shader extensions codice_3 codice_4 sets cards supported standard also opengl always seen use professional graphics market directx directx used mostly computer games term professional used refer professional production display graphics computer animated films scientific visualisation opposed games graphics produced end user personal rather professional use currently opengl directx large enough overlap functionality either could used common purposes operating system often main criterion dictating used directx common choice windows opengl nearly everything else esoteric applications still divide applicability two apis accelerated 3d across network connection directly supported opengl opengl extension x window system glx example past many professional graphics cards supported opengl 2010 virtually professional cards work windows platform also support direct3d part change professional graphics market largely unix-based hardware like sgis suns lower cost pc-based systems leading growth windows market segment time providing new market opengl software unix-based consumer systems running linux mac os x principal historical reason opengl dominance professional market performance many professional graphics applications example softimage|3d alias poweranimator originally written iris gl high-end sgi workstations far capable graphically raw cpu power pcs time later many ported opengl even personal computer evolving system powerful enough run professional graphics applications users able run maya example successor alias poweranimator either sgis windows-based personal computers today linux mac os x windows price competition eventually broke sgi dominance market established base opengl software engineers broadening user base opengl apple linux operating systems resulted market directx opengl viable widespread apis reason opengl historic advantage marketing design directx set apis marketed professional graphics applications indeed even designed uses directx api designed low-level high-performance access broadly available lower-performance consumer-priced graphics hardware purpose game development opengl much general purpose 3d api targeting full range graphics hardware low-end commodity graphics cards professional scientific graphics visualization well range average consumer providing features necessarily exclusive specific kind user gaming developers typically n't demanded wide api professional graphics system developers many games n't need overlay planes stencils although n't prevented game developers using available specifically game designers rarely interested pixel invariance demanded certain parts opengl standards conversely highly useful film computer-aided modeling attempt made merge opengl directx sgi microsoft fahrenheit graphics api intended bring together high end ability opengl broad low-level support directx microsoft eventually retreated project never allocated sufficient resources produce part rendering engine move widely held purposed ensure lock-in developers windows-directx platform would lost fahrenheit api became world de facto standard graphics api however fahrenheit led many improvements directx main architect fahrenheit works microsoft directx earliest days 3d accelerated gaming performance reliability key benchmarks several 3d accelerator cards competed dominance software written specific brand graphics card however years opengl direct3d emerged software layers hardware mainly industry support cross-hardware graphics library competition two rose game developer would choose either one early days 3d accelerated gaming vendors supply full opengl driver reason twofold firstly consumer-oriented accelerators implement enough functionality properly accelerate opengl secondly many vendors struggled implement full opengl driver good performance compatibility instead wrote minigl drivers implemented subset opengl enough run glquake later opengl games mostly based quake engine proper opengl drivers became prevalent hardware evolved consumer-oriented accelerators caught sgi systems opengl originally designed would around time directx 6 directx 7 console world proprietary native apis dominant consoles e.g. ps3 providing opengl wrapper around native api original xbox supported direct3d 8.1 native api xbox 360 supports directx9 native api console developers prefer use native apis console maximize performance making opengl direct3d comparisons relevant mostly pc platforms opengl embedded systems called opengl es subset opengl 3d graphics api designed embedded devices various versions smartphone operating systems support opengl es android ios ipad iphone ipod touch maemo nokia n900 symbian opengl es available 6 variants opengl es 1.0 1.1 2.0 3.0 3.1 3.2 release 2.0 removed backward compatibility older variants due extensive programmable pipeline functions available gl es 2.0 fixed-pipeline functions gl es 1.0 1.1 opengl es 3.0 needed new hardware opengl es 2.0 opengl es 3.1 meant software update needing new drivers direct3d mobile direct3d derivative supported windows ce currently windows phone 7 devices use .net framework ui accelerated direct3d mobile 9 adreno 200/205 integrated gpus qualcomm windows phone 8 implements direct3d 11 limited feature level 9_3 | [
6788,
4575,
4759,
1544,
7442,
5571,
578,
740,
5669,
7093,
224,
7010,
1582,
8024,
1128,
2338,
7494,
2530,
357,
1435,
2085
] | Validation |
1,653 | 5 | Host_Monitoring_Protocol:host monitoring protocol host monitoring protocol hmp obsolete tcp/ip protocol described rfc 869 | [
7148,
456,
6879,
2281,
6521,
6976,
3775,
3855,
2644,
7170,
6531,
1462,
2650,
7637,
2119,
6908,
7091,
3383,
3640,
2219,
3797,
2043,
3312,
2057,
3819,
3820,
3821,
7214,
7217,
7765,
259,
5880
] | Test |
1,654 | 2 | IPhone_OS_1:iphone os 1 iphone os 1 first major release ios apple mobile operating system iphone os 1.1.5 latest last version apple iphone os 1 version ios first iteration touch-centric mobile operating system official name given initial release apple marketing literature simply stated iphone runs version apple desktop operating system macos known mac os x march 6 2008 release iphone software development kit iphone sdk apple named iphone os later went rename ios june 7 2010 succeeded iphone os 2 july 11 2008 iphone os 1.1.3 update cost 19.95 ipod touch users | [
6788,
3940,
4670,
7890,
4320,
2926,
4690,
734,
5752,
6113,
405,
6119,
6125,
2954,
1123,
6479,
6847,
6142,
2609,
5787,
1895,
4376,
5091,
4749,
5450,
7601,
2630,
5101,
3001,
2284,
7259,
2294,
120,
1940,
2300,
3025,
2665,
2679,
2327,
6565,
... | Test |
1,655 | 9 | BAPP:bapp acronyms bapp b.a.p.p bamp b.a.m.p refer set open-source software programs commonly used together run dynamic web sites servers set solution stack open source web platform bapp refers bamp refers two acronyms three major uses operating system freebsd bsd descendant generally regarded reliable robust operating systems accurately report uptime remotely freebsd bsd descendants common free operating system listed netcraft list 50 web servers longest uptime uptime operating systems versions linux determined remotely making top choice among isps hosting providers long uptime also indicates kernel updates deemed necessary installing new kernel requires reboot resets uptime counter system though originators open source programs design work specifically combination become popular low acquisition cost ubiquity components come bundled current bsd distributions particularly deployed isps used combination represent solution stack technologies support application servers stacks include unified application development environments apple computer webobjects java/java ee grails microsoft .net architecture scripting component bapp stack origins cgi web interfaces became popular early 1990s technology allows user web browser execute program web server thereby receive dynamic well static content programmers used scripting languages programs ability manipulate text streams easily efficiently even originate disparate sources reason system designers often referred scripting systems glue languages variants term include | [
4798,
6029,
6507,
5983,
4387,
4759,
5571,
6538,
84,
578,
5956,
3135,
6367
] | Test |
1,656 | 2 | IPhone_OS_2:iphone os 2 iphone os 2 second major release ios mobile operating system developed apple inc. successor iphone os 1 first release ios support third-party applications via app store iphone os 2.2.1 final version iphone os 2 succeeded iphone os 3 june 17 2009. iphone os 2.0 became available july 11 2008 release iphone 3g devices running 1.x upgradable version version ios introduces app store making third-party applications available iphone ipod touch prior public release iphone os 2.0 apple held keynote event announce iphone os software development kit sdk developers notable feature iphone os 2 app store feature introduced way install custom applications device via jailbreaking strongly discouraged unsupported apple 500 applications available download launch app store though amount grown dramatically since app store 2 million apps 2016 mail app makeover push-emails provide always-on capability also supports microsoft office attachments well iwork attachments new features including support bcc multiple email delete ability select outgoing email contacts app new home screen icon available ipod touch along release ability search contacts without searched one-by-one well sim contacts import ability new features added maps app iphone os 2.2 software update among features added inclusion google street view directions public transit walking ability display address dropped pin device landscape mode calculator app displays scientific calculator also app icon updated settings ability turn wifi back airplane mode well ability turn on/off location services within app rene ritchie imore said overall iphone firmware 2.0 stunning achievement really puts iphone par apple ii mac one great revolutions modern technology takes beyond simple phone ipod even smartphone makes leading contender next great shift computing however criticized stability issues overall sluggishness macworld said iphone 2.0 software full kind refinements β expect second-generation apple product iphone os still β perfect wish apple addressed lingering shortcomings β welcome step-up already arguably best mobile platform market iphone os 2 cost 9.95 ipod touch users free iphone users | [
6788,
3940,
4670,
7890,
4320,
2926,
4690,
734,
5752,
6113,
405,
6119,
6125,
2954,
1123,
6479,
6847,
6142,
2609,
1895,
4376,
5091,
4749,
5450,
7601,
3001,
2284,
7259,
2294,
120,
1940,
2300,
3025,
2665,
2679,
1582,
2327,
6565,
2331,
3050,
... | Validation |
1,657 | 2 | IPhone_OS_3:iphone os 3 iphone os 3 third major release ios mobile operating system developed apple inc. successor iphone os 2 announced march 17 2009 released june 17 2009 succeeded ios 4 june 21 2010 new version dropped iphone os naming convention iphone os 3 last version use iphone os naming convention iphone os 3 added system-wide cut copy paste dialog bubble allowing users easily move content also introduced spotlight search indexing feature designed help users locate specific information device contacts email messages apps home screen expanded let users add 11 pages showcasing total 180 apps messages app received support mms camera app received support video recording iphone 3gs new voice memos app let users record voice iphone os 3 announced march 17 2009 beta version available developers day iphone os 3 officially released june 17 2009. iphone os 3 introduced cut copy paste bubble dialog users double-tap text paste button would incorporate anything stored device clipboard marked area spotlight system-wide indexing search feature aiming help users search device specific contacts email messages calendar appointments multimedia files apps accessed swiping right home screen iphone os 3 expands maximum number pages home screen 11 total number 180 apps messages app received native support multimedia messaging service mms allowing users send receive messages also contain pictures contacts locations voice recordings video messages camera app introduced video recording iphone 3gs photos app featured new copy button ability delete multiple photos iphone os 3 added voice memos app allowing users record voice upgrading iphone os 3 free iphone upgrading iphone os 3 cost ipod touch users 5 10 depending device purchase date iphone os 3 last ios charge ipod touch users upgrade starting ios 4 ios upgrades became free users including users ipod touch | [
6788,
3940,
4670,
7890,
4320,
2926,
4690,
734,
5752,
6113,
405,
6119,
6125,
2954,
1123,
6479,
6847,
6142,
2609,
1895,
4376,
5091,
4749,
5450,
7601,
3001,
2284,
7259,
2294,
120,
1940,
2300,
3025,
2665,
2679,
1582,
2327,
6565,
2331,
3050,
... | Validation |
1,658 | 4 | Weird_machine:weird machine computer security weird machine computational artifact additional code execution happen outside original specification program closely related concept weird instructions building blocks exploit based crafted input data expected valid input activates normal intended functionality computer program input unexpected program developer may activate unintended functionality weird machine consists unintended functionality programmed selected inputs exploit classical attack taking advantage stack buffer overflow input given vulnerable program crafted delivered becomes executed program code however data areas program memory protected executed directly like input may instead take form pointers pieces existing program code become executed unexpected order generate functionality exploit snippets code used exploit referred gadgets context return-oriented programming interpretation data code weird machine functionality definition outside original program specification reached also proof-carrying code pcc formally proven function certain specific way disparity essentially caused disconnect formal abstract modelling computer program real-world instance influenced events captured original abstraction memory errors power outages two central categories mitigation problems caused weird machine functionality include input validation within software protecting problems arising platform program runs memory errors input validation aims limit scope forms unexpected inputs e.g whitelists allowed inputs software program would end unexpected state interpreting data internally equally importantly secure programming practices protecting buffer overflows make less likely input data becomes interpreted unintended ways lower layers hardware program executed | [
1019,
449,
367,
755,
3220,
1265,
1805
] | Test |
1,659 | 2 | OpenAL:openal openal open audio library open open-source cross-platform audio application programming interface api designed efficient rendering multichannel three-dimensional positional audio api style conventions deliberately resemble opengl openal environmental 3d audio library add realism game simulating attenuation degradation sound distance doppler effect change frequency result motion material densities openal aimed originally open standard open-source replacement proprietary generally incompatible one another 3d audio systems eax a3d reference implementation later became proprietary open source implementations openal soft available openal originally developed 2000 loki software help business porting windows games linux demise loki project maintained time free software/open source community implemented nvidia nforce sound cards motherboards hosted largely developed creative technology on-going support apple blue ripple sound via rapture3d openal driver individual open-source developers openal charter says architecture review board arb modeled opengl arb organization ever formed openal specification generally handled discussed via email public mailing list since 1.1 implementation creative turned proprietary last releases free licenses still accessible project subversion source code repository however openal soft widely used open source alternative general functionality openal encoded source objects audio buffers single listener source object contains pointer buffer velocity position direction sound intensity sound listener object contains velocity position direction listener general gain applied sound buffers contain audio data pcm format either 8- 16-bit either monaural stereo format rendering engine performs necessary calculations far distance attenuation doppler effect etc net result end user properly written openal application sounds behave quite naturally user moves three-dimensional space virtual world programmer perspective little additional work required make happen existing opengl-based 3d graphical application unlike opengl specification openal specification includes two subsections api core consisting actual openal function calls alc audio library context api used manage rendering contexts resource usage locking cross platform manner also 'alut audio library utility toolkit library provides higher level 'convenience functions β exactly analogous opengl 'glut order provide additional functionality future openal utilizes extension mechanism individual vendors thereby able include extensions distributions openal commonly purpose exposing additional functionality proprietary hardware extensions promoted arb architecture review board status indicating standard extension maintained backwards compatibility arb extensions prospect added core api period time advanced digital signal processing hardware-accelerated sound effects efx effects extension environmental audio extensions eax used single listener model openal tailored single human user fit artificial intelligence robotic simulations multiple human participants collaborative musical performances cases multiple listener model required openal also fails take account sound propagation delays speed sound used doppler effect distance sound source translates amplitude effect attenuation delay hence openal used time difference arrival calculations unless functionality added separately api available following platforms operating systems android supports opensl es amigaos 3.x 4.x bada blackberry 10 blackberry playbook bsd ios supports core audio irix linux supports alsa oss portaudio pulseaudio mac os 8 mac os 9 mac os x core audio microsoft windows supports directsound windows multimedia api windows multimedia device mmdevice api morphos openbsd solaris qnx aros supported gaming devices instance gamecube playstation 2 playstation 3 xbox xbox 360 wii playstation portable following video games known use openal | [
2275,
4759,
2639,
6011,
5571,
3463,
578,
5579,
4879,
1659,
6550,
4970,
6830,
415,
3319,
7026,
7030,
6489,
3915,
7310,
5970,
7228,
1435,
2085
] | Test |
1,660 | 4 | DeCSS:decss decss one first free computer programs capable decrypting content commercially produced dvd video disc release decss linux-based computing systems could play encrypted video dvds decss development done without license dvd copy control association cca organization responsible dvd copy protectionβnamely content scramble system css used commercial dvd publishers release decss resulted norway criminal trial subsequent acquittal one authors decss dvd cca launched numerous lawsuits united states effort stop distribution software decss devised three people two remain anonymous released internet mailing list livid october 1999 one known author trio norwegian programmer jon lech johansen whose home raided 2000 norwegian police still teenager time put trial norwegian court violating norwegian criminal code section 145 faced possible jail sentence two years large fines acquitted charges early 2003 5 march 2003 norwegian appeals court ruled johansen would retried court said arguments filed prosecutor additional evidence merited another trial 22 december 2003 appeals court agreed acquittal 5 january 2004 norway ΓΈkokrim economic crime unit decided pursue case program first released 6 october 1999 johansen posted announcement decss 1.1b closed source windows-only application dvd ripping livid-dev mailing list source code leaked end month first release decss preceded weeks program called dod dvd speed ripper group called drinkordie also faced later raids piracy prosecutions jail one member even extradited australia usa prosecution despite never set foot n't include source code apparently work dvds drink die reportedly disassembled object code xing dvd player obtain player key group wrote decss including johansen came call masters reverse engineering may obtained information drink die css decryption source code used decss mailed derek fawcus decss released decss source code leaked fawcus noticed decss included css-auth code violation gnu gpl johansen made aware contacted fawcus solve issue granted license use code decss non-gpl terms 22 january 2004 dvd cca dropped case jon johansen decss program collaborative project johansen wrote graphical user interface transcripts borgarting court appeal published norwegian newspaper verdens gang contain following description process led release decss internet relay chat henceforth irc jon lech johansen made contact like-minded people seeking develop dvd-player linux operating system 11 september 1999 conversation mdx encryption algorithm css could found using poorly secured software-based dvd-player conversation jon lech johansen mdx 22 september mdx informs nomad found code css decryption mdx would send code jon lech johansen nomad allegedly found decryption algorithm so-called reverse engineering xing dvd-player decryption keys less openly accessible information made possible mdx create code css_scramble.cpp retrieved chat logs dated 4 november 1999 25 november 1999 appears nomad carried reverse engineering process xing player characterized illegal case presented high court known jon lech johansen 4 november 1999 regarding authentication code high court takes basis nomad obtained code electronic mailing list livid linux video internet created derek fawcus appears livid posting dated 6 october 1999 derek fawcus date read decss source code compared appears creators decss taken derek fawcus code almost verbatim alteration removal derek fawcus copyright header paragraph containing commentaries change function names name code css_auth.cpp high court takes basis program jon lech johansen later programmed graphical user interface consisted nomad decryption algorithm derek fawcus authentication package creation graphical user interface made program accessible also users without special knowledge programming program published internet first time 6 october 1999 jon lech johansen tested movie matrix downloaded approximately 2.5 200 megabytes movie hard drive computer file film fragment jon lech johansen saved computer release decss source code made css algorithm available public scrutiny soon found susceptible brute force attack quite different decss encryption 40-bit use keys high-end home computer 1999 running optimized code could brute-force within 24 hours modern computers brute-force seconds less programmers around world created hundreds programs equivalent decss merely demonstrate trivial ease system could bypassed others add dvd support open source movie players licensing restrictions css make impossible create open source implementation official channels closed source drivers unavailable operating systems users need decss watch even legally obtained movies first legal threats sites hosting decss beginning decss mirroring campaign began early november 1999 universal v. reimerdes preliminary injunction dvd copy control association inc. v. bunner followed soon january 2000 response threats program also called decss unrelated function developed program used strip cascading style sheets tags html pages one case school removed student webpage included copy program mistaking original decss program received great deal negative media attention css stripping program specifically created bait mpaa manner protest legislation prohibits publication copy protection circumvention code countries implement wipo copyright treaty united states digital millennium copyright act devised clever ways distributing descriptions decss algorithm steganography various internet protocols t-shirts dramatic readings midi files haiku poem decss haiku even so-called illegal prime number lawrence lessig future ideas 2001 p. 187-190 freely available | [
5606,
4759,
578,
1827,
7093,
6221
] | Validation |
1,661 | 5 | SILC_(protocol):silc protocol silc secure internet live conferencing protocol protocol provides secure synchronous conferencing services much like irc internet silc protocol divided three main parts silc key exchange ske protocol silc authentication protocol silc packet protocol silc protocol additionally defines silc commands used manage silc session silc provides channels groups nicknames private messages common features however silc nicknames contrast many protocols e.g irc unique user able use nickname even one already use real identification protocol performed unique client id silc protocol uses overcome nickname collision problem present many protocols messages sent silc network binary allowing contain type data including text video audio multimedia data ske protocol used establish session key security parameters protecting silc packet protocol ske based diffie-hellman key exchange algorithm form asymmetric cryptography exchange protected digital signatures silc authentication protocol performed successful ske protocol execution authenticate client and/or server authentication may based passphrase digital signatures successful gives access relevant silc network silc packet protocol intended secure binary packet protocol assuring content packet consisting packet header packet payload secured authenticated packets secured using algorithms based symmetric cryptography authenticated using message authentication code algorithm hmac silc channels groups protected using symmetric channel keys optionally possible digitally sign channel messages also possible protect messages privately generated channel key previously agreed upon channel members private messages users silc network protected session keys however possible execute ske protocol two users use generated key protect private messages private messages may optionally digitally signed messages secured key material generated ske protocol previously agreed upon key material example passphrases silc provides security even silc server may compromised silc designed pekka riikonen 1996 1999 first released public summer 2000 client server written protocol specifications proposed ultimately request publication denied june 2004 iesg rfc published date present time several clients advanced official silc client irssi plugin silc protocol also integrated popular pidgin instant messaging client gui clients silky colloquy silky client put hold abandoned 18th july 2007 due inactivity several years latest news silky website client completely rewritten 2008 three silc protocol implementations written silc clients use libsilc part silc toolkit silc toolkit dual-licensed distributed gnu general public license gpl revised bsd license described silc faq chats secured generation symmetric encryption keys keys generated somewhere occurs server means chats might compromised server compromised version man-in-the-middle attack solution offered chat members generate public-private keypair asymmetric encryption private key shared chat members done band public key used encrypt messages channel approach still open compromise one members chat private key compromised share key another without agreement group silc uses similar pattern irc global silc network many small independent networks consisting one several servers although claimed silc scale better many servers single network original network called silcnet silc.silcnet.org round-robin however may 2014 one active though unstable server four several public networks known external links section however also shut due declining popularity silc | [
7148,
456,
3172,
6879,
2281,
6521,
6976,
3775,
3855,
2644,
7170,
6531,
1462,
2650,
7637,
2119,
6908,
7091,
3383,
2219,
3640,
3797,
2043,
3312,
2057,
3819,
3820,
3821,
6049,
7214,
7217,
7765,
259,
5880,
3426
] | Test |
1,662 | 9 | Transformation_language:transformation language transformation language computer language designed transform input text certain formal language modified output text meets specific goal program transformation systems stratego/xt txl tom dms asf+sdf transformation languages major component transformation languages systems driven declarative descriptions structure input text typically grammar allowing applied wide variety formal languages documents macro languages kind transformation languages transform meta language specific higher programming language like java c++ fortran lower-level assembly language model-driven engineering technical space model transformation languages mtls take input models conforming given metamodel produce output models conforming different metamodel example language qvt omg standard also low-level languages lx family implemented bootstrapping method l0 language may considered assembler transformation languages also high-level graphical language built upon lx called mola number xml transformation languages include tritium xslt xquery stx fxt xduce cduce haxml xmlambda flexml concepts languages typical transforms | [
6507,
361,
4220,
4483,
7640,
214,
2866,
684,
336,
2877,
7305,
3670,
3499,
4743,
2803
] | Validation |
1,663 | 4 | ClearOS:clearos clearos also known clearos system formerly clarkconnect operating system marketed software company clearcenter based centos red hat enterprise linux designed use small medium enterprises network gateway network server web-based administration interface positioned alternative windows small business server clearos succeeds clarkconnect software built clearfoundation support services purchased clearcenter clearos 5.1 removes previous limitations mail dmz multiwan functions clearos 6.1 release distribution full-featured operating system gateway network servers built source packages red hat enterprise linux features include | [
2179,
2187,
2909,
5724,
6086,
7894,
395,
2935,
6453,
2585,
2228,
1487,
58,
3996,
7587,
4008,
1893,
7954,
1909,
6884,
7969,
6175,
7251,
4400,
7253,
3696,
474,
1179,
7635,
6902,
2297,
1941,
1559,
6908,
3023,
6549,
1960,
6209,
2680,
4435,
... | Validation |
1,664 | 5 | SIP_trunking:sip trunking sip trunking enables end point β pbx phone exchange system send receive calls via internet sip applied signalling protocol multiple real-time application sip trunk able control voice video messaging applications also voice internet protocol voip technology streaming media service based session initiation protocol sip internet telephony service providers itsps deliver telephone services unified communications customers equipped sip-based ip pbx unified communications facilities unified communications applications provide voice video streaming media applications desktop sharing web conferencing shared whiteboard architecture sip trunking provides partitioning unified communications network two different domains expertise interconnection two domains must occur sip trunk interconnection two domains created transport via internet protocol ip involves setting specific rules regulations well ability handle services protocols fall name sip trunking itsp responsible applicable regulatory authority regarding following law obligations public domain private domain instead nature subject particular constraints law may either responsibility itsp end user enterprise third party provides voice services company domain elements perform characteristic features requested domain particular result part front-end network customer logically divided two levels private domain consists three levels | [
3821,
4172,
6228,
7170
] | Test |
1,665 | 2 | Joinup_collaboration_platform:joinup collaboration platform joinup collaboration platform created european commission funded european union via interoperability solutions public administrations programme isa programme joinup launched 9 december 2011 replaced open source observatory repository osor.eu semantic interoperability centre europe semic.eu communities funded isa programme two became joinup initial communities site aims let public administrations promote e-government systems specifically offers meeting place collaborative working environment development interoperability joinup hosts communities practice community common assessment method standards specifications camss community national interoperability frameworks observatory nifo platform also raises awareness free open source software semantic interoperability public sector joinup offers catalogue open source software interoperability assets models interoperability maturity model imm target audience includes using developing implementing e-government systems site focuses european public sector projects open others platform three main functions site offers software development tools including software repository apache subversion issue tracker joinup provides access federation catalogue hosted public administrations eu member states standardisation bodies european committee standardization cen european telecommunications standards institute etsi joinup also used european commission directorate general informatics make available applications examples include circabc document management system open e-prior tool help manage electronic procurement online collection software eci help organisations gather signatures support request european commission propose legislation december 2014 isa programme added epractice community joinup platform epractice offers services professional community egovernment einclusion ehealth practitioners january 2015 opengovernment community added ec directorate general communications networks content technology detailed list potential services someone receives registering platform found list software contributions made community new version joinup currently developed one features joinup platform creation maven repositories new projects disappear joinup platform powered tailored version drupal content management framework version 6 downloaded joinup web site latest version 1.7.2 released march 15 2015 software like platform powers suitable used application lifecycle management tool software forge source code past versions found development platform done hosts running debian linux joinup platform runs 10 hosts ec datacentre luxembourg includes load balancer network-attached storage reverse-proxy main part platform three red hat linux hosts running apache webserver drupal fourth linux host running apache tomcat java server apache solr search engine apache maven build automation tools fifth linux host running apache subversion software versioning revisioning system sixth linux host running mysql relational database system seventh gnu mailman platform software used offer similar services involving public administrations regions countries australia new zealand openray platform piloted since june 2012 open technology foundation otf research organisation supporting government sector research evaluation trialling uptake open technologies standards methods 21 november 2013 semantic services federated show openray repository also 21 november 2013 government south australia announced would start piloting internal version joinup platform software test use ec open e-prior south australia test use joinup sharing re-use retrieved 2013-11-24 aim improve collaboration procurement activities openroad similar collaboration platform begun vietnam ministry science technology january 2013 joinup federation similar projects french adullact started 2002 association des dΓ©veloppeurs et utilisateurs de logiciels libres pour les administrations et les collectivitΓ©s territoriales association developers users free software governments local authorities adullact actually inspiration ec's open source observatory repository examples would spanish centro de transferencia de tecnologΓa centre technology transfer la forja de guadalinex hosted junta de andalucia platform could also compared national information exchange model niem xml-based information exchange framework united states however niem designed develop disseminate support information exchange standards processes enable jurisdictions automate information sharing ec joinup sharing information technology joinup might even compared comprehensive knowledge archive network ckan however focuses software packages semantic assets storage distribution data spreadsheets contents databases | [
2087,
6080,
3463,
5863
] | Test |
1,666 | 6 | Veritas_File_System:veritas file system veritas file system vxfs called jfs onlinejfs hp-ux extent-based file system originally developed veritas software oem agreement vxfs used primary filesystem hp-ux operating system on-line defragmentation resize support turned via license known onlinejfs also supported aix linux solaris opensolaris sinix/reliant unix unixware sco openserver vxfs originally developed unix system laboratories vxfs packaged part veritas storage foundation also includes veritas volume manager according vendor first commercial journaling file system claim taken two ways i.e. first implementation journaling file system commercial context first file system available unbundled product dan koren cited one original developers vxfs notes mailing list finished release 1.0 one year later starting development vxfs contract corporation 1990 sources agree product first released 1991 internet widely available early 1990s getting new file system deployed unix like operating systems difficult one- two-year delay release commercialization file system unusual on-disk layout vxfs versioned upgradeable file system mounted file system gone ten versions vxfs file system run single instance mode parallel access cluster mode parallel mode allows multiple servers also known cluster nodes simultaneously access file system run mode vxfs referred veritas cluster file system cluster file system provides cache coherency posix compliance across nodes data changes atomically seen cluster nodes simultaneously cluster file system shares binaries on-disk layout single instance vxfs moving cluster single instance mode straightforward | [
3599,
2547,
7161,
4672,
6431,
3626,
5049,
6117,
759,
6854,
5437,
4375,
6500,
7597,
6505,
5457,
460,
1534,
4398,
7976,
4406,
821,
7258,
5130,
1561,
836,
5843,
2313,
6558,
5856,
2683,
5859,
5865,
4444,
5518,
6231,
869,
2704,
1605,
174,
27... | Test |
1,667 | 3 | Message_Signaled_Interrupts:message signaled interrupts message signaled interrupts msi alternative in-band method signaling interrupt using special in-band messages replace traditional out-of-band assertion dedicated interrupt lines complex implement device message signaled interrupts significant advantages pin-based out-of-band interrupt signaling message signaled interrupts supported pci bus since version 2.2 later available pci express bus non-pci architectures also use message signaled interrupts traditionally device interrupt line pin asserts wants signal interrupt host processing environment traditional form interrupt signaling out-of-band form control signaling since uses dedicated path send control information separately main data path msi replaces dedicated interrupt lines in-band signaling exchanging special messages indicate interrupts main data path particular msi allows device write small amount interrupt-describing data special memory-mapped i/o address chipset delivers corresponding interrupt processor common misconception msi allows device send data processor part interrupt data sent part memory write transaction used chipset determine interrupt trigger processor data available device communicate additional information interrupt handler example pci express separate interrupt pins instead uses special in-band messages allow pin assertion deassertion emulated non-pci architectures also use msi another example hp gsc devices interrupt pins generate interrupts writing directly processor interrupt register memory space hypertransport protocol also supports msi complex implement device message signaled interrupts significant advantages pin-based out-of-band interrupt signaling mechanical side fewer pins makes simpler cheaper reliable connector advantage standard pci connector pci express takes advantage savings msi increases number interrupts possible conventional pci limited four interrupts per card shared among cards using one message signaled interrupts allow dozens interrupts per card useful also slight performance advantage software pin-based interrupt could race posted write memory pci device would write data memory send interrupt indicate dma write complete however pci bridge memory controller might buffer write order interfere memory use interrupt could arrive dma write complete processor could read stale data memory prevent race interrupt handlers required read device ensure dma write finished read moderate performance penalty msi write pass dma write race eliminated pci defines two optional extensions support message signaled interrupts msi msi-x pci express compatible legacy interrupts software level requires msi msi-x msi first defined pci 2.2 permits device allocate 1 2 4 8 16 32 interrupts device programmed address write generally control register interrupt controller 16-bit data word identify interrupt number added data word identify interrupt platforms windows use 32 interrupts use 16 interrupts msi-x first defined pci 3.0 permits device allocate 2048 interrupts single address used original msi found restrictive architectures particular made difficult target individual interrupts different processors helpful high-speed networking applications msi-x allows larger number interrupts gives one separate target address data word devices msi-x necessarily support 2048 interrupts optional features msi 64-bit addressing interrupt masking also mandatory msi-x intel systems lapic must enabled pci pci express msi/msi-x work even uniprocessor single core systems systems msis handled writing interrupt vector directly lapic processor/core needs service interrupt intel lapics 2009 supported 224 msi-based interrupts according 2009 intel benchmark using linux using msi reduced latency interrupts factor almost three compared i/o apic delivery motherboard implementations particularly among pci pci-x bridges non-functional msi support amd-8131 serverworks pci express chipsets among problems least versions linux also observed motherboards nvidia nforce chipsets broken msi support result nvidia enabled msi support graphics card drivers first time many users nforce-based motherboards complained instability eventually traced back msi implementation motherboard users complained errors ranging relatively harmless unresponsive gpus windows vista 7 eventually recover usb devices intermittently ceasing work linux gpu tasked heavy workloads hard freezes blue screens kernel panics platforms later versions drivers blacklist platforms activate msi microsoft family operating systems windows vista later versions support msi msi-x support added longhorn development cycle around 2004 msi supported earlier versions like windows xp windows server 2003 solaris express release 6/05 added support msi msi-x part new device driver interface ddi interrupt framework freebsd 6.3 7.0 added support msi msi-x openbsd 5.0 added support msi 6.0 added support msi-x linux gained support msi msi-x around 2003 linux kernel versions 2.6.20 known serious bugs limitations implementation msi/msi-x haiku gained support msi around 2010 msi-x support added later 2013 netbsd 8.0 added support msi msi-x | [
3764,
2885,
4318,
6014,
578,
2332
] | Train |
1,668 | 2 | MS-DOS_4.0_(multitasking):ms-dos 4.0 multitasking ms-dos 4.0 multitasking release ms-dos developed microsoft based ms-dos 2.0 lack interest oems particularly ibm previously gave microsoft multitasking code ibm pc dos included topview led released scaled-back form sometimes referred european ms-dos 4.0 primarily used confused pc dos 4.00 ms-dos 4.01 later contain multi-tasking features apricot computers pre-announced ms-dos 4.0 early 1986 microsoft demonstrated september year paris trade show however european oems international computers limited icl actually licensed releases software particular ibm declined product concentrating instead improvements ms-dos 3.x new joint development microsoft produce os/2 result project scaled back features promised particular oems delivered september 1987 version multi-tasking ms-dos 4.1 reported developed icl drs professional workstation pws releases made contracts fulfilled july 1988 ibm announced ibm dos 4.0 unrelated product continuing dos 3.3 3.4 leading initial conjecture microsoft might release different version number however microsoft eventually released ms-dos 4.0 ms-dos 4.01 following quickly fix issues many reported well minor improvements support new executable file format key feature release support preemptive multitasking use protected mode available 80386 processors allowed specially-written programs continue executing background mode access user input output returned foreground os reported include time-sliced scheduler interprocess communication via pipes shared memory limited form multitasking considered useful server rather workstation environment particularly coupled ms-net 2.0 released simultaneously limitations ms-dos 3.0 remained including inability use memory 640 kb contributed product lack adoption particularly light need write programs specifically targeted new environment int 21h/ah=87h used distinguish multitasking ms-dos 4.x later ms-dos/pc dos 4.x issues microsoft president jon shirley described specialized version went far saying maybe n't called dos 4.0 although clear whether always intention enthusiastic response oems would resulted true successor dos 3.x marketing positioned additional option dos 3.x workstations xenix higher-end servers multiuser systems | [
4751,
4291,
7512,
4759,
6256,
7172,
5648,
5571,
126,
1648,
5931,
6634,
5232,
224,
4611,
6294,
3559,
4524,
6380,
3039,
3137,
858,
3907,
4088,
3664,
5872,
6399,
5784,
352,
3751,
786
] | Test |
1,669 | 4 | IBM_4767:ibm 4767 ibm 4767 pcie cryptographic coprocessor hardware security module hsm includes secure cryptoprocessor implemented high-security tamper resistant programmable pcie board specialized cryptographic electronics microprocessor memory random number generator housed within tamper-responding environment provide highly secure subsystem data processing cryptography performed sensitive key material never exposed outside physical secure boundary clear format ibm 4767 validated fips pub 140-2 level 4 highest level certification achievable commercial cryptographic devices ibm 4767 data sheet describes coprocessor detail ibm supplies two cryptographic-system implementations toolkits custom application development also available applications may include financial pin transactions bank-to-clearing-house transactions emv transactions integrated circuit chip based credit cards general-purpose cryptographic applications using symmetric key algorithms hashing algorithms public key algorithms operational keys symmetric rsa private generated coprocessor saved either keystore file application memory encrypted master key coprocessor coprocessor identical master key use keys performance benefits include incorporation elliptic curve cryptography ecc format preserving encryption fpe hardware ibm supports 4767 certain ibm z ibm power systems x86 servers linux microsoft windows april 2016 ibm 4767 superseded ibm 4765 discontinued ibm 4767 supported platforms listed successor 4767 ibm 4768 introduced ibm z called crypto express6s cex6s available feature code 0893 links point various relevant cryptographic standards iso 13491 secure cryptographic devices https //www.iso.org/standard/61137.html iso 9564 pin security https //www.iso.org/standard/68669.html ansi x9.24 part 1 key management using symmetric techniques https //webstore.ansi.org/recorddetail.aspx sku=ansi+x9.24-1-2017 ansi x9.24 part 2 key management using asymmetric techniques https //webstore.ansi.org/recorddetail.aspx sku=ansi+x9.24-2-2016 fips 140-2 https //nvlpubs.nist.gov/nistpubs/fips/nist.fips.140-2.pdf | [
4759,
7456,
578
] | Test |
1,670 | 3 | Random-access_memory:random-access memory random-access memory ram form computer memory read changed order typically used store working data machine code random-access memory device allows data items read written almost amount time irrespective physical location data inside memory contrast direct-access data storage media hard disks cd-rws dvd-rws older magnetic tapes drum memory time required read write data items varies significantly depending physical locations recording medium due mechanical limitations media rotation speeds arm movement ram contains multiplexing demultiplexing circuitry connect data lines addressed storage reading writing entry usually one bit storage accessed address ram devices often multiple data lines said 8-bit 16-bit etc devices today technology random-access memory takes form integrated circuit ic chips mos metal-oxide-semiconductor memory cells ram normally associated volatile types memory dram modules stored information lost power removed although non-volatile ram also developed types non-volatile memories exist allow random access read operations either allow write operations kinds limitations include types rom type flash memory called nor-flash two main types volatile random-access semiconductor memory static random-access memory sram dynamic random-access memory dram commercial uses semiconductor ram date back 1965 ibm introduced sp95 sram chip system/360 model 95 computer toshiba used dram memory cells toscal bc-1411 electronic calculator based bipolar transistors commercial mos memory based mos transistors developed late 1960s first commercial dram ic chip intel 1103 introduced october 1970 synchronous dynamic random-access memory sdram later debuted samsung km48sl2000 chip 1992 early computers used relays mechanical counters delay lines main memory functions ultrasonic delay lines could reproduce data order written drum memory could expanded relatively low cost efficient retrieval memory items required knowledge physical layout drum optimize speed latches built vacuum tube triodes later discrete transistors used smaller faster memories registers registers relatively large costly use large amounts data generally dozen hundred bits memory could provided first practical form random-access memory williams tube starting 1947 stored data electrically charged spots face cathode ray tube since electron beam crt could read write spots tube order memory random access capacity williams tube hundred around thousand bits much smaller faster power-efficient using individual vacuum tube latches developed university manchester england williams tube provided medium first electronically stored program implemented manchester baby computer first successfully ran program 21 june 1948 fact rather williams tube memory designed baby baby testbed demonstrate reliability memory magnetic-core memory invented 1947 developed mid-1970s became widespread form random-access memory relying array magnetized rings changing sense ring magnetization data could stored one bit stored per ring since every ring combination address wires select read write access memory location sequence possible magnetic core memory standard form computer memory system displaced solid-state mos metal-oxide-silicon semiconductor memory integrated circuits ics early 1970s prior development integrated read-only memory rom circuits permanent read-only random-access memory often constructed using diode matrices driven address decoders specially wound core rope memory planes semiconductor memory began 1960s bipolar memory used bipolar transistors improved performance could compete lower price magnetic core memory invention mosfet metal-oxide-semiconductor field-effect transistor also known mos transistor mohamed atalla dawon kahng bell labs 1959 led development mos semiconductor memory john schmidt fairchild semiconductor 1964 addition higher performance mos memory cheaper consumed less power magnetic core memory development silicon-gate mos integrated circuit ic technology federico faggin fairchild 1968 enabled production mos memory chips mos memory overtook magnetic core memory dominant memory technology early 1970s integrated bipolar static random-access memory sram invented robert h. norman fairchild semiconductor 1963 followed development mos sram john schmidt fairchild 1964 commercial use sram began 1965 ibm introduced sp95 memory chip system/360 model 95 dynamic random-access memory dram allowed replacement 4 6-transistor latch circuit single transistor memory bit greatly increasing memory density cost volatility data stored tiny capacitance transistor periodically refreshed every milliseconds charge could leak away toshiba toscal bc-1411 electronic calculator introduced 1965 used form capacitive bipolar dram storing 180-bit data discrete memory cells consisting germanium bipolar transistors capacitors 1967 robert h. dennard ibm filed patent single-transistor mos dram memory cell using mosfet transistor first commercial dram ic chip intel 1103 manufactured 8Β΅m mos process capacity 1kb released 1970 synchronous dynamic random-access memory sdram developed samsung electronics first commercial sdram chip samsung km48sl2000 capacity 16mb introduced samsung 1992 mass-produced 1993 first commercial ddr sdram double data rate sdram memory chip samsung 64mb ddr sdram chip released june 1998 gddr graphics ddr form ddr sgram synchronous graphics ram first released samsung 16mb memory chip 1998 two widely used forms modern ram static ram sram dynamic ram dram sram bit data stored using state six-transistor memory cell form ram expensive produce generally faster requires less dynamic power dram modern computers sram often used cache memory cpu dram stores bit data using transistor capacitor pair together comprise dram cell capacitor holds high low charge 1 0 respectively transistor acts switch lets control circuitry chip read capacitor state charge change form memory less expensive produce static ram predominant form computer memory used modern computers static dynamic ram considered volatile state lost reset power removed system contrast read-only memory rom stores data permanently enabling disabling selected transistors memory altered writeable variants rom eeprom flash memory share properties rom ram enabling data persist without power updated without requiring special equipment persistent forms semiconductor rom include usb flash drives memory cards cameras portable devices solid-state drives ecc memory either sram dram includes special circuitry detect and/or correct random faults memory errors stored data using parity bits error correction codes general term ram refers solely solid-state memory devices either dram sram specifically main memory computers optical storage term dvd-ram somewhat misnomer since unlike cd-rw dvd-rw need erased reuse nevertheless dvd-ram behaves much like hard disc drive somewhat slower memory cell fundamental building block computer memory memory cell electronic circuit stores one bit binary information must set store logic 1 high voltage level reset store logic 0 low voltage level value maintained/stored changed set/reset process value memory cell accessed reading sram memory cell type flip-flop circuit usually implemented using fets means sram requires low power accessed expensive low storage density second type dram based around capacitor charging discharging capacitor store 1 0 cell however charge capacitor slowly leaks away must refreshed periodically refresh process dram uses power achieve greater storage densities lower unit costs compared sram useful memory cells must readable writeable within ram device multiplexing demultiplexing circuitry used select memory cells typically ram device set address lines a0 ... combination bits may applied lines set memory cells activated due addressing ram devices virtually always memory capacity power two usually several memory cells share address example 4 bit 'wide ram chip 4 memory cells address often width memory microprocessor different 32 bit microprocessor eight 4 bit ram chips would needed often addresses needed provided device case external multiplexors device used activate correct device accessed one read over-write data ram many computer systems memory hierarchy consisting processor registers on-die sram caches external caches dram paging systems virtual memory swap space hard drive entire pool memory may referred ram many developers even though various subsystems different access times violating original concept behind random access term ram even within hierarchy level dram specific row column bank rank channel interleave organization components make access time variable although extent access time rotating storage media tape variable overall goal using memory hierarchy obtain highest possible average access performance minimizing total cost entire memory system generally memory hierarchy follows access time fast cpu registers top slow hard drive bottom many modern personal computers ram comes easily upgraded form modules called memory modules dram modules size sticks chewing gum quickly replaced become damaged changing needs demand storage capacity suggested smaller amounts ram mostly sram also integrated cpu ics motherboard well hard-drives cd-roms several parts computer system addition serving temporary storage working space operating system applications ram used numerous ways modern operating systems employ method extending ram capacity known virtual memory portion computer hard drive set aside paging file scratch partition combination physical ram paging file form system total memory example computer 2 gb ram 1 gb page file operating system 3 gb total memory available system runs low physical memory swap portions ram paging file make room new data well read previously swapped information back ram excessive use mechanism results thrashing generally hampers overall system performance mainly hard drives far slower ram software partition portion computer ram allowing act much faster hard drive called ram disk ram disk loses stored data computer shut unless memory arranged standby battery source sometimes contents relatively slow rom chip copied read/write memory allow shorter access times rom chip disabled initialized memory locations switched block addresses often write-protected process sometimes called shadowing fairly common computers embedded systems common example bios typical personal computers often option called β use shadow bios β similar enabled functions rely data bios β rom instead use dram locations also toggle shadowing video card rom rom sections depending system may result increased performance may cause incompatibilities example hardware may inaccessible operating system shadow ram used systems benefit may hypothetical bios used booting favor direct hardware access free memory reduced size shadowed roms several new types non-volatile ram preserve data powered development technologies used include carbon nanotubes approaches utilizing tunnel magnetoresistance amongst 1st generation mram 128 kib bytes chip manufactured 0.18 Β΅m technology summer 2003 june 2004 infineon technologies unveiled 16 mib 16 Γ 2 bytes prototype based 0.18 Β΅m technology two 2nd generation techniques currently development thermal-assisted switching tas developed crocus technology spin-transfer torque stt crocus hynix ibm several companies working nantero built functioning carbon nanotube memory prototype 10 gib 10 Γ 2 bytes array 2004 whether technologies eventually take significant market share either dram sram flash-memory technology however remains seen since 2006 solid-state drives based flash memory capacities exceeding 256 gigabytes performance far exceeding traditional disks become available development started blur definition traditional random-access memory disks dramatically reducing difference performance kinds random-access memory ecoram specifically designed server farms low power consumption important speed memory wall growing disparity speed cpu memory outside cpu chip important reason disparity limited communication bandwidth beyond chip boundaries also referred bandwidth wall 1986 2000 cpu speed improved annual rate 55 memory speed improved 10 given trends expected memory latency would become overwhelming bottleneck computer performance cpu speed improvements slowed significantly partly due major physical barriers partly current cpu designs already hit memory wall sense intel summarized causes 2005 document first chip geometries shrink clock frequencies rise transistor leakage current increases leading excess power consumption heat ... secondly advantages higher clock speeds part negated memory latency since memory access times able keep pace increasing clock frequencies third certain applications traditional serial architectures becoming less efficient processors get faster due so-called von neumann bottleneck undercutting gains frequency increases might otherwise buy addition partly due limitations means producing inductance within solid state devices resistance-capacitance rc delays signal transmission growing feature sizes shrink imposing additional bottleneck frequency increases n't address rc delays signal transmission also noted clock rate versus ipc end road conventional microarchitectures projected maximum 12.5 average annual cpu performance improvement 2000 2014 different concept processor-memory performance gap addressed 3d integrated circuits reduce distance logic memory aspects apart 2d chip memory subsystem design requires focus gap widening time main method bridging gap use caches small amounts high-speed memory houses recent operations instructions nearby processor speeding execution operations instructions cases called upon frequently multiple levels caching developed deal widening gap performance high-speed modern computers relies evolving caching techniques prevent loss processor performance takes less time perform computation initiated complete 53 difference growth speed processor speeds lagging speed main memory access solid-state hard drives continued increase speed ~400 mb/s via sata3 2012 ~3 gb/s via nvme/pcie 2018 closing gap ram hard disk speeds although ram continues order magnitude faster single-lane ddr4 3200 capable 25 gb/s modern gddr even faster fast cheap non-volatile solid state drives replaced functions formerly performed ram holding certain data immediate availability server farms 1 terabyte ssd storage 200 1tb ram would cost thousands dollars despite speed ram still necessity efficient computation large local data sets analytics machine learning though producing graphics video games vr | [
6788,
3262,
1447,
6421,
5022,
6807,
7178,
3967,
1103,
740,
5405,
6119,
6830,
5060,
4347,
6472,
5421,
5423,
5784,
7222,
4009,
5087,
5088,
5794,
5450,
447,
4749,
448,
1909,
6165,
2633,
4761,
5472,
811,
5473,
6528,
476,
5822,
4410,
5486,
2... | Test |
1,671 | 4 | TACLANE:taclane taclane short tactical fastlane tactical local area network encryption family inline network encryptors ine developed manufactured general dynamics mission systems meet national security agency nsa requirements high assurance internet protocol encryptor haipe version 4.1 nov 2013 taclane devices type 1 key-agile in-line network encryptors provide network communications security internet protocol ip asynchronous transfer mode atm networks individual user enclaves users security level typically deployed department defense dod tactical strategic networks government agencies contractors taclanes allow users communicate securely legacy networks mobile subscriber equipment packet network non-secure internet protocol router network niprnet secret internet protocol router network siprnet emerging atm networks taclanes provide encryption ip datagram traffic atm traffic ip datagrams encapsulated atm cells support variety ip atm mixed network configurations taclanes used overlay secure virtual private network top existing public and/or private network infrastructures taclane-micro introduced became certified nsa 2007 protect classified information top secret 2014 announced general dynamics c4 systems general dynamics mission systems delivered 100,000 taclane-micro encryptors u.s. navy space naval warfare systems command spawar taclane-c100 designated suite b cryptographic high value product chvp encryptor certified national security agency nsa suite b device secure network communications secret level 2012 certification makes c100 non-controlled cryptographic item cci taclane-10g encryptor haipe encryptor offer simultaneous ip ethernet capabilities providing 10 gbit/s throughput speed 10g secures information classified top secret sci government commercial networks encryptor became certified national security agency nsa 2015 allowed u.s government agencies order 10g encryptor taclane-1g ruggedized tactical strategic environments encryptor became nsa certified secure information classified top secret sci 2013 taclane-flex became certified nsa secure information top secret/sci level 2017 taclane-nano encryptor works integrate flyaway kits deployable systems well facilitates communications intelligence surveillance reconnaissance dismounted tactical forward deployment covert special operations encryptor certified nsa yet general dynamics mission systems announced end production product december 2015 general dynamics mission systems announced end life eol product | [
3821,
7764,
281,
2566
] | Test |
1,672 | 7 | Snapforce_CRM:snapforce crm snapforce crm comprehensive customer relationship management crm saas application developed snapforce.com primary use case customer management sales automation although also configured telephony support additional software components include customer databases customer interaction tracking reporting workflow automation snapforce crm configured handle inbound outbound calling calls logged prospect customer record automatically real time may 2014 company became first crm software provider offer telephony services native feature snapforce crm recognized one ten top players customer relationship management market report 2015 | [
2961
] | Test |
1,673 | 9 | Program_lifecycle_phase:program lifecycle phase program lifecycle phases stages computer program undergoes initial creation deployment execution phases edit time compile time link time distribution time installation time load time run time lifecycle phases necessarily happen linear order intertwined various ways example modifying program software developer may need repeatedly edit compile install execute computer ensure sufficient quality distributed users copies modified program downloaded installed executed users computers edit time source code program edited spans initial creation bug fix refactoring addition new features editing typically performed person automated design tools metaprogramming systems may also used compile time source code translated machine code compiler part involves language checking ensuring proper use type system result successful compilation executable link time connects necessary machine code components program including externals common programs use functions implemented external libraries must properly linked together two types linking static linking connection made compiler always prior execution dynamic linking however performed operating system os even execution distribution time process transferring copy program user distribution format typically executable may also source code especially program written interpreted language means distribution physical media usb flash drive remote download via internet installation time gets distributed program ready execution user computer often includes storing executable future loading os load time os takes program executable storage hard drive places active memory order begin execution run time execution phase central processing unit executes program machine code instructions programs may run indefinitely execution terminates either normal expected behavior abnormality crash | [
1361,
4905,
6982,
5571,
1237,
3772,
1989,
3042,
7804,
5190
] | Test |
1,674 | 4 | BNC_(software):bnc software bnc short bounced network connection piece software used relay traffic connections computer networks much like proxy using bnc allows user hide original source user connection providing privacy well ability route traffic specific location bnc also used hide true target user connects one common usage internet relay chat irc via bnc running remote servers environment easy ascertain user ip address bnc may help hide original connection source well providing opportunity vhosts virtual hosts use vhost conceal connection better merely adds statement hostname many bncs remain connected irc server event client disconnect internet often state changes tracked may relayed client upon reconnection implementations opt store messages sent across network client would normally received send upon clients reconnection often considered much resource dependent commercial hosting services provide logging features bot like functions may included various implementations standard list bouncer software bncs also often used file transfer protocol ftp hide user server route traffic specific location ftp bouncers divided two different categories entry traffic entry bouncer acts gateway server hide existence actual server entry bouncers like cubnc used multi-server setup easy access server load balancing removes need select ftp server log trying access server farm traffic bouncers relay traffic host installed used appears bouncer actually ftp server thus hiding real location server completely multiple traffic bouncers installed parallel order balance traffic load across different links elaborate bouncers even bounce secure ssl/tls connections | [
4021,
3722,
5983,
3172,
5965,
486,
3338,
2142,
5162,
4059,
5690
] | Test |
1,675 | 6 | Compact_Pro:compact pro compact pro software data compression utility archiving compressing files apple macintosh platform major competitor stuffit early 1990s producing smaller archives less time able create self-extracting archives without use external program well distributed via shareware greatly helped popularity pc version also available extractorpc neither program actively supported introduced early 1990s compact pro originally known compactor competed stuffit suffering neglect original developer moved projects compact pro sported clean interface variety new features quickly made favorite among digerati quickly drove stuffit leadership position became popular bbs systems stuffit 3.0 fought back even powerful compression algorithm shareware version called stuffit lite features freeware stuffit expander could decompress stuffit archives compact pro archives compact pro never really regained momentum release stuffit expander maintained niche among loyal users preparation tool cyclos smaller installer delivery package notably used ambrosia software disappeared market late 1990s compact pro also served inspiration zipit pkzip-compatible archiver expressly designed look work like compact pro like archiver systems compact pro primary purpose package compress files transmission extract side link unlike systems compact pro used non-modal mac-like ui widely lauded press notable features included ability extract everything archive double-clicking finder key held automatically recognizing converting binhex formatted files back native format without separate step compact pro also featured easy-to-use system splitting files parts fit floppy disks feature archivers implemented external program odd oft-used feature ability include images notes would display archive opened using basic mechanism teachtext compact pro also included ability produce self-extracting archives although becoming common archivers time particular implementation notable extractor stub code quite small 13 kb compared stuffit 38 kb era 14400 bit/s modems worthwhile savings many considered even large bother number small third-party utilities strip stub existing archive compact pro stub could also expand files split parts rare feature time time introduction compact pro offered far fastest best compression mac use compactor files never 1 larger stuffit deluxe better best guess modes anywhere 25 400 faster ironically compact pro even faster stuffit extracting stuffit files often least double performance also allowed background operation multifinder speed remained superior systems even major upgrades ended testing late 1990s show remaining significantly faster smaller versions stuffit years later normal archives created compact pro use .cpt file extension self-extracting versions used .sea file extensions normally needed mac commonly used archives would typically stored system would normally require pcs instance | [
1710,
4213,
6537,
1471,
5571,
405,
7555,
7746,
2589,
7201,
3219,
510,
768,
7584,
169
] | Test |
1,676 | 9 | Steel_Bank_Common_Lisp:steel bank common lisp steel bank common lisp sbcl free common lisp implementation features high-performance native compiler unicode support threading name steel bank common lisp reference carnegie mellon university common lisp sbcl forked andrew carnegie made fortune steel industry andrew mellon successful banker sbcl descends cmucl descended spice lisp including early implementations mach operating system ibm rt pc three rivers computing corporation perq computer 1980s william newman originally announced sbcl variant cmucl december 1999 main point divergence time clean bootstrapping procedure cmucl requires already compiled executable binary compile cmucl source code whereas sbcl supported bootstrapping theoretically ansi-compliant common lisp implementation sbcl became sourceforge project september 2000 original rationale fork continue initial work done newman without destabilizing cmucl time already mature much-used implementation forking amicable since significant flows code cross-pollination two projects since sbcl attracted several developers ported multiple hardware architectures operating systems undergone many changes enhancements dropped support several cmucl extensions considers beyond scope project motif interface also developed many new ones including native threading unicode support version 1.0 released november 2006 active development continues william newman stepped project administrator sbcl april 2008 several developers taken interim management releases time tenth anniversary sbcl workshop organized | [
7878,
1445,
6796,
6087,
2915,
5734,
1478,
4332,
4704,
5757,
6116,
1116,
6471,
2600,
5077,
2249,
1889,
1890,
6876,
4759,
6886,
6888,
3370,
1557,
6191,
5494,
5501,
6210,
144,
7298,
5515,
8025,
7680,
3749,
5883,
4837,
897,
6981,
2734,
5571,
... | Validation |
1,677 | 1 | Inspec:inspec inspec major indexing database scientific technical literature published institution engineering technology iet formerly institution electrical engineers iee one iet forerunners inspec coverage extensive fields physics computing control engineering subject coverage includes astronomy electronics communications computers computing computer science control engineering electrical engineering information technology physics manufacturing production mechanical engineering due emerging concept technology business inspec also includes information technology business portfolio inspec indexed journals publishing high quality research integrating technology management economics social sciences domains sample journals include annual review financial economics aslib journal information management australian journal management international journal management economics social sciences inspec started 1967 outgrowth science abstracts service electronic records distributed magnetic tape 1980s available u.s. knowledge index low-priced dial-up version dialog service individual users made popular nearly 50 years iet employed scientists manually review items included inspec hand-indexing literature using expertise subject area make judgement call terms classification codes applied thanks work significant thesaurus developed enables content indexed far accurately context turn helps end-users discover relevant literature may otherwise remained hidden typical search queries making inspec essential tool prior art patentability searches patent drafting access inspec currently internet inspec direct various resellers inspec several print counterparts computer control abstracts frequency 12 per year covers computers computing information technology electrical electronics abstracts frequency 12 per year covers topics telecommunications electronics radio electrical power optoelectronics printed indexes subject author indexes subject guide produced twice per year physics abstracts frequency 24 per year abstracting indexing service first published institution electrical engineers first circulated science abstracts volume 1 volume 5 1898 1902 1903 1971 database different titles closely related names science abstracts section physics science abstracts section physics abstracts volume 6 volume 74 1972 societies associated authors service american institute physics 1975 1976 institute electrical electronics engineers also became author 1980 database also issued inspec-physics various formats also available part inspec database presently part inspec section physics database time physics abstracts title employed throughout 1990s science fiction writer arthur c. clarke b.s degree physics mathematics honors king college assistant editor physics abstracts 1949β1951 position allowed clarke access world β leading scientific journals first issue science abstracts published january 1898 first year total 1,423 abstracts published monthly intervals end year author subject index added first issue contained 110 abstracts divided 10 sections science abstracts result joint collaboration institution electrical engineers iee physical society london publication time provided without charge members societies cost publication mainly borne iee physical society financial contributions also received institution civil engineers royal society british association advancement science 1902 annual number abstracts published increased 2,362 may 1903 decided split publication two parts physics b electrical engineering decision allowed subject scope widen particularly physics result allowed larger quantity material covered since 1967 electronic access science abstracts provided inspec | [] | Test |
1,678 | 7 | Supercomputer_architecture:supercomputer architecture approaches supercomputer architecture taken dramatic turns since earliest systems introduced 1960s early supercomputer architectures pioneered seymour cray relied compact innovative designs local parallelism achieve superior computational peak performance however time demand increased computational power ushered age massively parallel systems supercomputers 1970s used processors 1990s machines thousands processors began appear end 20th century massively parallel supercomputers tens thousands off-the-shelf processors norm supercomputers 21st century use 100,000 processors graphic units connected fast connections throughout decades management heat density remained key issue centralized supercomputers large amount heat generated system may also effects reducing lifetime system components diverse approaches heat management pumping fluorinert system hybrid liquid-air cooling system air cooling normal air conditioning temperatures systems massive number processors generally take one two paths one approach e.g. grid computing processing power large number computers distributed diverse administrative domains opportunistically used whenever computer available another approach large number processors used close proximity e.g. computer cluster centralized massively parallel system speed flexibility interconnect becomes important modern supercomputers used various approaches ranging enhanced infiniband systems three-dimensional torus interconnects since late 1960s growth power proliferation supercomputers dramatic underlying architectural directions systems taken significant turns early supercomputers relied small number closely connected processors accessed shared memory supercomputers 21st century use 100,000 processors connected fast networks throughout decades management heat density remained key issue centralized supercomputers seymour cray get heat motto central design philosophy continued key issue supercomputer architectures e.g. large-scale experiments blue waters large amount heat generated system may also effects reducing lifetime system components diverse approaches heat management e.g cray 2 pumped fluorinert system system x used hybrid liquid-air cooling system blue gene/p air-cooled normal air conditioning temperatures heat aquasar supercomputer used warm university campus heat density generated supercomputer direct dependence processor type used system powerful processors typically generating heat given similar underlying semiconductor technologies early supercomputers used fast closely packed processors took advantage local parallelism e.g. pipelining vector processing time number processors grew computing nodes could placed away e.g. computer cluster could geographically dispersed grid computing number processors supercomputer grows component failure rate begins become serious issue supercomputer uses thousands nodes may fail per year average system experience several node failures day price/performance general purpose graphic processors gpgpus improved number petaflop supercomputers tianhe-i nebulae started rely however systems k computer continue use conventional processors sparc-based designs overall applicability gpgpus general purpose high performance computing applications subject debate gpgpu may tuned score well specific benchmarks overall applicability everyday algorithms may limited unless significant effort spent tune application towards however gpus gaining ground 2012 jaguar supercomputer transformed titan replacing cpus gpus number independent processors supercomputer increases way access data file system share access secondary storage resources becomes prominent years number systems distributed file management developed e.g ibm general parallel file system beegfs parallel virtual file system hadoop etc number supercomputers top100 list tianhe-i use linux lustre file system cdc 6600 series computers early attempts supercomputing gained advantage existing systems relegating work peripheral devices freeing cpu central processing unit process actual data minnesota fortran compiler 6600 could sustain 500 kiloflops standard mathematical operations early supercomputers cray 1 cray 2 appeared afterwards used small number fast processors worked harmony uniformly connected largest amount shared memory could managed time early architectures introduced parallel processing processor level innovations vector processing processor perform several operations one clock cycle rather wait successive cycles time number processors increased different architectural issues emerged two issues need addressed number processors increases distribution memory processing distributed memory approach processor physically packaged close local memory memory associated processors away based bandwidth latency parameters non-uniform memory access 1960s pipelining viewed innovation 1970s use vector processors well established 1980s many supercomputers used parallel vector processors relatively small number processors early systems allowed easily use shared memory architecture allows processors access common pool memory early days common approach use uniform memory access uma access time memory location similar processors use non-uniform memory access numa allowed processor access local memory faster memory locations cache-only memory architectures coma allowed local memory processor used cache thus requiring coordination memory values changed number processors increases efficient interprocessor communication synchronization supercomputer becomes challenge number approaches may used achieve goal instance early 1980s cray x-mp system shared registers used approach processors access shared registers move data back forth used interprocessor communication synchronization however inherent challenges managing large amount shared memory among many processors resulted move distributed architectures 1980s demand computing power increased trend much larger number processors began ushering age massively parallel systems distributed memory distributed file systems given shared memory architectures could scale large number processors hybrid approaches distributed shared memory also appeared early systems computer clustering approach connects number readily available computing nodes e.g personal computers used servers via fast private local area network activities computing nodes orchestrated clustering middleware software layer sits atop nodes allows users treat cluster large one cohesive computing unit e.g via single system image concept computer clustering relies centralized management approach makes nodes available orchestrated shared servers distinct approaches peer peer grid computing also use many nodes far distributed nature 21st century top500 organization semiannual list 500 fastest supercomputers often includes many clusters e.g world fastest 2011 k computer distributed memory cluster architecture large number local semi-independent computing nodes used e.g cluster architecture speed flexibility interconnect becomes important modern supercomputers taken different approaches address issue e.g tianhe-1 uses proprietary high-speed network based infiniband qdr enhanced feiteng-1000 cpus hand blue gene/l system uses three-dimensional torus interconnect auxiliary networks global communications approach node connected six nearest neighbors similar torus used cray t3e massive centralized systems times use special-purpose processors designed specific application may use field-programmable gate arrays fpga chips gain performance sacrificing generality examples special-purpose supercomputers include belle deep blue hydra playing chess gravity pipe astrophysics mdgrape-3 protein structure computation molecular dynamics deep crack breaking des cipher grid computing uses large number computers distributed diverse administrative domains opportunistic approach uses resources whenever available example boinc volunteer-based opportunistic grid system boinc applications reached multi-petaflop levels using close half million computers connected internet whenever volunteer resources become available however types results often appear top500 ratings run general purpose linpack benchmark although grid computing success parallel task execution demanding supercomputer applications weather simulations computational fluid dynamics remained reach partly due barriers reliable sub-assignment large number tasks well reliable availability resources given time quasi-opportunistic supercomputing large number geographically disperse computers orchestrated built-in safeguards quasi-opportunistic approach goes beyond volunteer computing highly distributed systems boinc general grid computing system globus allowing middleware provide almost seamless access many computing clusters existing programs languages fortran c distributed among multiple computing resources quasi-opportunistic supercomputing aims provide higher quality service opportunistic resource sharing quasi-opportunistic approach enables execution demanding applications within computer grids establishing grid-wise resource allocation agreements fault tolerant message passing abstractly shield failures underlying resources thus maintaining opportunism allowing higher level control air-cooled ibm blue gene supercomputer architecture trades processor speed low power consumption larger number processors used room temperature using normal air-conditioning second-generation blue gene/p system processors integrated node-to-node communication logic energy-efficient achieving 371 mflops/w k computer water-cooled homogeneous processor distributed memory system cluster architecture uses 80,000 sparc64 viiifx processors eight cores total 700,000 coresβalmost twice many system comprises 800 cabinets 96 computing nodes 16 gb memory 6 i/o nodes although powerful next five systems top500 list combined 824.56 mflops/w lowest power performance ratio current major supercomputer system follow system k computer called primehpc fx10 uses six-dimensional torus interconnect still one processor per node unlike k computer tianhe-1a system uses hybrid architecture integrates cpus gpus uses 14,000 xeon general-purpose processors 7,000 nvidia tesla general-purpose graphics processing units gpgpus 3,500 blades 112 computer cabinets 262 terabytes distributed memory 2 petabytes disk storage implemented via lustre clustered files tianhe-1 uses proprietary high-speed communication network connect processors proprietary interconnect network based infiniband qdr enhanced chinese made feiteng-1000 cpus case interconnect system twice fast infiniband slower interconnects supercomputers limits specific approaches continue tested boundaries reached large scale experiments e.g. 2011 ibm ended participation blue waters petaflops project university illinois blue waters architecture based ibm power7 processor intended 200,000 cores petabyte globally addressable memory 10 petabytes disk space goal sustained petaflop led design choices optimized single-core performance hence lower number cores lower number cores expected help performance programs scale well large number processors large globally addressable memory architecture aimed solve memory address problems efficient manner type programs blue waters expected run sustained speeds least one petaflop relied specific water-cooling approach manage heat first four years operation national science foundation spent 200 million project ibm released power 775 computing node derived project technology soon thereafter effectively abandoned blue waters approach architectural experiments continuing number directions e.g cyclops64 system uses supercomputer chip approach direction away use massive distributed processors 64-bit cyclops64 chip contains 80 processors entire system uses globally addressable memory architecture processors connected non-internally blocking crossbar switch communicate via global interleaved memory data cache architecture half sram bank used scratchpad memory although type architecture allows unstructured parallelism dynamically non-contiguous memory system also produces challenges efficient mapping parallel algorithms many-core system | [
1346,
553,
5371,
7712,
4484,
4672,
5559,
4049,
4318,
3458,
1006,
3015,
2845,
5042,
7180,
7453,
578,
5666,
4154,
1481,
5939,
7010,
4159,
1023,
1295,
5947,
3041,
2266,
240,
1586,
7930,
763,
515,
1042,
8024,
2961,
3578,
4993,
2433,
1237,
2... | Test |
1,679 | 3 | Sun-Ni_law:sun-ni law sun-ni law sun ni law also known memory-bounded speedup memory-bounded speedup model states computing power increases corresponding increase problem size constrained system β memory capacity general system grows computational power problems run system increase size analogous amdahl law says problem size remains constant system sizes grow gustafson law proposes problem size scale bound fixed amount time sun-ni law states problem size scale bound memory capacity system sun-ni law initially proposed xian-he sun lionel ni proceedings ieee supercomputing conference 1990 increasing disparity cpu speed memory data access latency application execution time often depends memory speed system predicted sun ni data access become premier performance bottleneck high-end computing fact one see intuition behind sun-ni law system resources increase applications often bottlenecked memory speed bandwidth thus application achieve larger speedup utilizing memory capacity system sun-ni law applied different layers memory hierarchy system l1 cache main memory memory-bounded function w=g reveals trade-off computing memory algorithm system architecture design three speedup models sun-ni gustafson amdahl provide metric analyze speedup parallel computing amdahl β law focuses time reduction given fixed-size problem amdahl β law states sequential portion problem algorithm limits total speedup achieved system resources increase gustafson β law suggests beneficial build large-scale parallel system speedup grow linearly system size problem size scaled maintain fixed execution time yet memory access latency often becomes dominant factor application β execution time applications may scale meet time bound constraint sun-ni law instead constraining problem size time constrains problem memory capacity system words bounds based memory sun-ni law generalization amdahl law gustafson law memory-bounded function g =1 resolves amdahl law memory-bounded function g =m number processors resolves gustafson law let formula_1 scaled workload memory space constraint memory bounded speedup defined suppose formula_2 portion workload parallelized formula_3 sequential portion workload let formula_4 function reflects parallel workload increase factor memory capacity increases times let formula_5 formula_6 formula_7 memory capacity one node thus formula_8 memory bounded speedup formula_9 power function formula_10 rational numbers b formula_11 formula_12 power function coefficient 1 thus taking highest degree term determine complexity algorithm rewrite memory bounded speedup formula_13 equation formula_14 represents influence memory change change problem size suppose formula_15 memory-bounded speedup model reduces amdahl law since problem size fixed independent resource increase suppose formula_16 memory-bounded speedup model reduces gustafson law means memory capacity increases times workload also increases times data needed local every node system often simplicity matching notation amdahl law gustafson law letter g used represent memory bound function formula_14 n replaces using notation get formula_18 suppose one would like determine memory-bounded speedup matrix multiplication memory requirement matrix multiplication roughly formula_19 n dimension two n x n source matrices computation requirement formula_20 thus formula_21 formula_22 thus memory-bounded speedup matrix multiplication formula_23 following another matrix multiplication example illustrates rapid increase parallel execution time execution time n x n matrix uniprocessor formula_24 memory usage formula_25 suppose 10000 -by- 10000 matrix takes 800 mb memory factorized 1 hour uniprocessor scaled workload suppose possible factorize 320,000 -by- 320,000 matrix 32 hours time increase quite large increase problem size may valuable someones whose premier goal accuracy example astrophysicist may interested simulating n-body problem number particles large possible example shows computation intensive applications memory capacity need proportionally scale computing power memory-bounded speedup model first work reveal memory performance constraint high-end computing presents quantitative mathematical formulation trade-off memory computing based memory-bounded function w=g n w work thus also computation applications memory requirement terms capacity g reuse rate w=g gives simple effective description relation computation memory requirement architecture viewpoint memory-bounded model suggests size well speed cache match cpu performance today modern microprocessors pentium pro alpha 21164 strong arm sa110 longson-3a use 80 transistors on-chip cache rather computing components algorithm design viewpoint reduce number memory accesses reuse data possible function g gives reuse rate today term memory bound functions become general term refers functions involve extensive memory access memory complexity analysis become discipline computer algorithm analysis | [
4049,
6922,
75,
7499,
553,
1447,
7364
] | Validation |
1,680 | 6 | UnionFS:unionfs unionfs filesystem service linux freebsd netbsd implements union mount file systems allows files directories separate file systems known branches transparently overlaid forming single coherent file system contents directories path within merged branches seen together single merged directory filesystem mounting branches priority one branch specified branches contain file name different branches may either read-only read-write file systems writes virtual merged copy directed specific real file system allows file system appear writable without actually allowing writes change file system also known copy-on-write may desirable media physically read-only case live cds unionfs originally developed professor erez zadok team stony brook university knoppix union file system cd-rom dvd file system contained image file called knoppix.img knoppix-data.img knoppix 7 writable drive usb memory stick made writable drive priority read-only filesystem allows user change files system new file stored image transparently used instead one cd unionfs also used create single common template number file systems security reasons sometimes used ad hoc snapshotting system docker uses unionfs layer docker images actions done base image layers created documented layer fully describes recreate action strategy enables docker lightweight images layer updates need propagated compared full vms example ubuntultsp linux terminal server project implementation ubuntu uses unionfs pxe booting thin thick clients unionfs linux two versions version 1.x standalone one built module version 2.x newer redesigned reimplemented one aufs alternative version unionfs overlayfs written miklos szeredi used openwrt considered ubuntu merged mainline linux kernel 26 october 2014 many years development discussion version 3.18 kernel unionfs-fuse independent project implemented user space filesystem program instead kernel module patch like unionfs supports copy-on-write read-only read-write branches plan 9 bell labs operating system uses union mounts extensively build custom namespaces per user processes union mounts also available bsd since least 1995 gnu hurd implementation unionfs january 2008 works results read-only mount-point mhddfs works like unionfs permits balancing files drives free space available implemented user space filesystem mergerfs fuse based union filesystem offers multiple policies accessing writing files well advanced features xattrs managing mixed ro rw drives link cow etc. sun microsystems introduced first implementation stacked layered file system copy-on-write whiteouts hiding files lower layers higher layers etc translucent file service sunos 3 circa 1986 jailbreakme 3.0 tool jailbreaking ios devices released july 2011 uses unionfs techniques speed installation process operating system modification | [
3599,
1438,
2547,
7161,
4672,
6431,
3626,
5049,
6117,
5760,
759,
7581,
6854,
5437,
4375,
6500,
788,
6505,
5457,
460,
1534,
7976,
4406,
821,
7258,
5130,
1561,
836,
5843,
2313,
6558,
2683,
5859,
5865,
4444,
5518,
6231,
869,
2704,
1605,
17... | Train |
1,681 | 9 | SheerPower4GL:sheerpower4gl sheerpower 4gl fourth-generation programming language developed touch technologies inc sheerpower 4gl result porting touch technologies intouch 4gl programming language runs openvms dec alpha vax computers windows launching 2000 downloads free official sheerpower 4gl website sheerpower 4gl similar basic programming language easy learn sheerpower 4gl several key features 1 free hobbyists non-profit organizations 2 extremely fast able compile millions lines per minute modern systems 3 web scripting features make fast easy develop dynamic web pages using sheerpower basic-like syntax version 5.0 official release containing syntax logic web scripting sheerpower 4 sheerpower utilizes perfect precision math package patent 7149765 apparatus method precision binary numbers numerical operations applied precision math eliminates rounding errors experienced using floating point data type 5 sheerpower comes bundled ars advanced record system database engine ars proprietary database engine also developed touch technologies inc. tti created ars engine performance critical many applications example ars 20 times faster mysql shared read/write operations 6 open database connectivity sheerpower supports database engines odbc interface ars engine accessed via odbc database applications 7 sheerpower internet services spins webserver also comes bundled sheerpower 4gl spins webserver comes bundled sheerpower developed simplicity use high-speed performance modern multi-core system spins web server perform 1,000 page hits per secondβgiven enough bandwidth course 8 also common gateway interface cgi interface built sheerpower along many built-in functions designed high-performance increased programmer productivity sheerpower 4gl following built-in security features 1 run sheerpower program windows temporary folder stops computer viruses written sheerpower programs emailed run email opened 2 sheerpower mix data code database operation makes impervious sql injection attacks binary distribution available microsoft windows nt 2000 2003 xp vista virtual machine downloaded alone purpose running .spsrc .sprun programs sheerpower source code files deployed files code encrypted software free non-commercial use terms undefined besides levels support business customers non-profit organizations hobbyist programmers use free license comes download license fees outlined wanting develop applications commercial business use high-priority support packages available email web forum support available charge | [
623,
2226,
2866,
8117
] | Validation |
1,682 | 2 | Multi-user_software:multi-user software multi-user software software allows access multiple users computer time-sharing systems multi-user systems batch processing systems mainframe computers may also considered multi-user avoid leaving cpu idle waits i/o operations complete however term multitasking common context example unix server multiple remote users access via serial port secure shell unix shell prompt time another example uses multiple x window sessions spread across multiple terminals powered single machine example use thin client similar functions also available mp/m concurrent dos multiuser dos flexos multi-user operating systems windows versions windows nt family support simultaneous access multiple users example via remote desktop connection well ability user disconnect local session leaving processes running work behalf another user logs uses system operating system provides isolation user processes users enabling execute concurrently management systems implicitly designed used multiple users typically one system administrator end-user community complementary term single-user commonly used talking operating system usable one person time reference single-user software license agreement multi-user operating systems unix sometimes single user mode runlevel available emergency maintenance | [
4759,
6256,
192,
5116,
2017,
6722,
5571,
5486,
4786,
5933,
4423,
6646,
3033,
8111,
6380,
6572,
7396,
4183,
8026,
5252,
3664,
7214,
344,
2251,
6853,
5784,
2703,
1237,
4009,
3756,
4651,
447
] | Validation |
1,683 | 7 | MindTouch:mindtouch mindtouch american multinational technology company headquartered san diego california designs develops sells saas computer software online services company software products include mindtouch formerly called mindtouch responsive mindtouch 4 mindtouch tcs mindtouch core mindtouch allows team create publish edit content structure content within responsive user interface online services include touchpoints crm integrations success program custom software development team helps branding information architecture custom integrations new existing customers mindtouch founded aaron fulkerson steve bjorg 2005 january 2016 mindtouch announced series venture capital funding round totaling 12 million usd peakspan capital led round participation sk ventures sap se mindtouch started mediawiki 2005 first release name dekiwiki occurred july 2006 featuring xhtml place wikitext wysiwyg editor lucene-based search main functionality mindtouch wiki access php frontend provided wiki along wysiwyg editor multi-language support named polyglot allows switching interface content languages per page per section per user basis multilingual wikis engine prioritizes search results user β default language mindtouch cites 8.05 release deki first polyglot application web mindtouch core allowed user access edit pages stored xml rather wikitext mindtouch core open-source enterprise web-based wiki software mashup platform pages edited using gui editor could manipulated xml web service software supported authentication apache iis modules permissions could applied individual pages page hierarchies open source version mindtouch core distributed sourceforge terms gnu general public license parts gnu lesser general public license apache license dekiscript lightweight interpreted programming language allows users add dynamic content mindtouch pages mindtouch core allowed embedded directly web pages extended xml extensions mindtouch core used multiple connectors perform mashups mindtouch core shipped extensions allowing connection numerous online services including systems google maps windows live flickr yahoo unsupported commercial license enabled features connectors sugarcrm salesforce linkedin mysql microsoft sql server microsoft access april 9 2013 mindtouch inc. announced would longer support open source offering mindtouch core last open-source releases mindtouch core still available sourceforge mindtouch 4 developed open-source mindtouch core source code base mindtouch current version software service second iteration mindtouch 4 mindtouch allows team create publish edit content structure content within responsive user interface integration partnerships crm vendors sap salesforce.com provide support agents ability use mindtouch content customer support workflows amazon β aws also partnered mindtouch january 2016 mindtouch announced series venture capital funding round totaling 12 million usd peakspan capital led round participation sk ventures sap se mindtouch cloud infrastructure delivers weekly update bug fixes feature changes mindtouch forked mediawiki 2005 first release name dekiwiki occurred july 2006 featuring xhtml place wikitext wysiwyg editor lucene-based search consequently backend completely reimplemented c resulting api built web services top new dream distributed rest application manager server toolset mindtouch responsive latest version mindtouch saas offering replacing mindtouch 4 mindtouch 4 forked internally within mindtouch inc. open-source mindtouch core source code base early 2010 addition legacy php c components mindtouch core mindtouch responsive software infrastructure includes technologies nodejs elasticsearch f amazon sqs amazon lambda amazon redshift redis haproxy puppet | [
330,
6029
] | Test |
1,684 | 2 | NuGet:nuget nuget free open-source package manager designed microsoft development platform formerly known nupack since introduction 2010 nuget evolved larger ecosystem tools services nuget distributed visual studio extension starting visual studio 2012 nuget comes pre-installed default nuget also integrated sharpdevelop nuget also used command line automated scripts supports multiple programming languages including chocolatey machine-level package manager installer software packages built windows nt platform execution engine using nuget packaging infrastructure windows powershell provide automation tool installing software windows machines designed simplify process user perspective name extension pun nuget nougat everyone loves chocolatey nougat chocolatey invoked packagemanagement module formerly 'oneget powershell version 5.0 | [
5726,
4675,
6428,
720,
5386,
4697,
5747,
7555,
3303,
1860,
53,
2594,
422,
425,
781,
4017,
5092,
4759,
7619,
7621,
7971,
2283,
7251,
3366,
4778,
4059,
3036,
1582,
3042,
4441,
3407,
523,
163,
2341,
1598,
2702,
7687,
8055,
5200,
5545,
6609... | Validation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.