node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4 values |
|---|---|---|---|---|
7,485 | 0 | Babelfy:babelfy babelfy software algorithm disambiguation text written language specifically babelfy performs tasks multilingual word sense disambiguation i.e. disambiguation common nouns verbs adjectives adverbs entity linking i.e disambiguation mentions encyclopedic entities like people companies places etc. babelfy based babelnet multilingual semantic network performs disambiguation entity linking three steps result text written 271 languages supported babelnet output possibly overlapping semantic annotations | [
1314,
282
] | Test |
7,486 | 4 | ISACA:isaca isaca international professional association focused governance irs filings known information systems audit control association although isaca goes acronym isaca originated united states 1967 group individuals working auditing controls computer systems started become increasingly critical operations organizations identified need centralized source information guidance field 1969 stuart tyrnauer employee douglas aircraft company incorporated group edp auditors association edpaa tyrnauer served body founding chairman first three years 1976 association formed education foundation undertake large-scale research efforts expand knowledge value accorded fields governance control information technology association became information systems audit control association 1994 march 2016 isaca bought cmmi institute behind capability maturity model integration isaca currently serves 110,000 constituents members professionals holding isaca certifications 180 countries job titles members auditor consultant educator security professional regulator chief information officer chief information security officer internal auditor work nearly industry categories network isaca chapters 200 chapters established 80 countries chapters provide education resource sharing advocacy networking benefits csx-p isaca first cybersecurity certification introduced summer 2015 one certifications require individual work live environment real problems obtain certification specifically exam puts test takers live network real incident taking place student efforts respond incident fix problem results type score awarded | [
3932,
6694,
1531,
284,
3517,
7803,
2829,
904,
8091,
7651,
7192,
3474,
1034,
2513,
4648
] | Validation |
7,487 | 4 | Information_Technology_Security_Assessment:information technology security assessment information technology security assessment security assessment explicit study locate security vulnerabilities risks assessment assessor full cooperation organization assessed organization grants access facilities provides network access outlines detailed information network etc parties understand goal study security identify improvements secure systems assessment security potentially useful security tests goal security assessment also known security audit security review network assessment ensure necessary security controls integrated design implementation project properly completed security assessment provide documentation outlining security gaps project design approved corporate security policies management address security gaps three ways management decide cancel project allocate necessary resources correct security gaps accept risk based informed risk reward analysis following methodology outline put forward effective means conducting security assessment security assessment report include following information security risk assessments like many risk assessments actually quantitative represent risk actuarially-sound manner measuring risk quantitatively significant impact prioritizing risks getting investment approval quantitative risk analysis applied security major us government study 2000 federal cio council commissioned study 100 million security investment department veterans affairs results shown quantitatively united states department veterans affairs common vendor-neutral professional certifications performing security assessment casas iii victoriano 2006 information security risk assessment model public university administrators applied research project texas state university http //ecommons.txstate.edu/arp/109/ | [
7192,
3932,
2747,
1328,
5577,
5135,
1805
] | Validation |
7,488 | 7 | Apache_Ambari:apache ambari apache ambari software project apache software foundation ambari enables system administrators provision manage monitor hadoop cluster also integrate hadoop existing enterprise infrastructure ambari sub-project hadoop top-level project right ambari used companies including ibm hortonworks cardinal health ebay expedia kayak.com lending club neustar macy pandora radio samsung shutterfly spotify | [
2451,
7238,
894,
4303,
5728,
7805,
2741,
7444,
7896,
917,
5571,
3463,
3542,
3204,
1286,
6821,
5054,
840,
1392,
3031,
5408,
3558,
5677,
3479,
5863,
6387,
5075,
6137,
7857,
5874,
5965,
3915,
1511,
4742,
5007,
1333,
702
] | Train |
7,489 | 9 | Speedcoding:speedcoding speedcoding speedcode first high-level programming language created ibm computer language developed john backus 1953 ibm 701 support computation floating point numbers high level means symbolic aiming natural language expressivity goal opposed machine hardware instruction oriented coding idea arose difficulty programming ibm ssec machine backus hired calculate astronomical positions early 1950 speedcoding system interpreter focused ease use expense system resources provided pseudo-instructions common mathematical functions logarithms exponentiation trigonometric operations resident software analyzed pseudo-instructions one one called appropriate subroutine speedcoding also first implementation decimal input/output operations although substantially reduced effort writing many jobs running time program written help speedcoding usually ten twenty times machine code interpreter took 310 memory words 30 memory available 701 | [
336,
6507,
4946,
6497,
2803,
5932,
1381,
5190,
1435
] | Test |
7,490 | 5 | Reverse_Address_Resolution_Protocol:reverse address resolution protocol reverse address resolution protocol rarp obsolete computer networking protocol used client computer request internet protocol ipv4 address computer network available link layer hardware address mac address client broadcasts request need prior knowledge network topology identities servers capable fulfilling request rarp described internet engineering task force ietf publication rfc 903 rendered obsolete bootstrap protocol bootp modern dynamic host configuration protocol dhcp support much greater feature set rarp rarp requires one server hosts maintain database mappings link layer addresses respective protocol addresses media access control mac addresses need individually configured servers administrator rarp limited serving ip addresses reverse arp differs inverse address resolution protocol inarp described rfc 2390 designed obtain ip address associated local frame relay data link connection identifier inarp used ethernet although original uses rarp overcome different protocols modern day protocols use rarp examples cisco overlay transport virtualization otv rarp used update layer 2 forwarding tables mac address moves data centers | [
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,
2335,
7214,
7217,
7765,
5085,
259,
5880,
5181
] | Test |
7,491 | 0 | Linguee:linguee linguee web service provides online dictionary number language pairs unlike similar services leo linguee incorporates search engine provides access large amounts bilingual sentence pairs found online translation aid linguee therefore differs machine translation services like babelfish similar function translation memory linguee uses specialized webcrawlers search internet appropriate bilingual texts divide parallel sentences paired sentences identified undergo automatic quality evaluation human-trained machine learning algorithm estimates quality translation user set number pairs using fuzzy search access ranking search results previous quality assurance compliance influenced search term users also rate translations manually machine learning system trained continuously addition serving bilingual web patent translated texts well eu parliament protocols laws european union eur-lex sources addition officially translated text eu sources french language service relies translated texts canadian government documents websites transcripts along canadian national institutions organisations often provide bilingual services according operator linguee offers access approximately 100 million translations concept behind linguee conceived fall 2007 former google employee dr. gereon frahling developed following year along leonard fink business idea recognized 2008 main prize competition founded federal ministry economics technology germany april 2009 web service available public linguee operated deepl gmbh formerly linguee gmbh based cologne august 2017 linguee team publicly announced launch deepl translator freely available translation service capable translating seven major european languages | [
80
] | Test |
7,492 | 3 | Qualcomm_Hexagon:qualcomm hexagon hexagon qdsp6 brand family 32-bit multi-threaded microarchitectures implementing instruction set digital signal processor dsp developed qualcomm according 2012 estimation qualcomm shipped 1.2 billion dsp cores inside system chip socs average 2.3 dsp core per soc 2011 year 1.5 billion cores planned 2012 making qdsp6 shipped architecture dsp ceva around 1 billion dsp cores shipped 2011 90 ip-licenseable dsp market hexagon architecture designed deliver performance low power variety applications features hardware assisted multithreading privilege levels long instruction word vliw single instruction multiple data simd instructions geared toward efficient signal processing cpu capable in-order dispatching 4 instructions packet 4 execution units every clock hardware multithreading implemented barrel temporal multithreading threads switched round-robin fashion cycle 600 mhz physical core presented three logical 200 mhz cores v5 hexagon v5 switched dynamic multithreading dmt thread switch l2 misses interrupt waiting special instructions hot chips 2013 qualcomm announced details hexagon 680 dsp qualcomm announced hexagon vector extensions hvx hvx designed allow significant compute workloads advanced imaging computer vision processed dsp instead cpu march 2015 qualcomm announced snapdragon neural processing engine sdk allow ai acceleration using cpu gpu hexagon dsp qualcomm snapdragon 855 contains 4th generation on-device ai engine includes hexagon 690 dsp hexagon tensor accelerator hta ai acceleration port linux hexagon runs hypervisor layer hexagon virtual machine merged 3.2 release kernel original hypervisor closed-source april 2013 minimal open-source hypervisor implementation qdsp6 v2 v3 hexagon minivm released qualcomm bsd-style license support hexagon added 3.1 release llvm tony linthicum hexagon/hvx v66 isa support added 8.0.0 release llvm also non-fsf maintained branch gcc binutils qualcomm hexagon dsps available qualcomm snapdragon soc since 2006 snapdragon s4 msm8960 newer three qdsp cores two modem subsystem one hexagon core multimedia subsystem modem cores programmed qualcomm multimedia core allowed programmed user also used femtocell processors qualcomm including fsm98xx fsm99xx fsm90xx march 2016 announced semiconductor company conexant audiosmart audio processing software integrated qualcomm hexagon six versions qdsp6 architecture released v1 2006 v2 2007–2008 v3 2009 v4 2010–2011 qdsp6 v5 2013 snapdragon 800 qdsp6 v6 2016 snapdragon 820 v4 20 dmips per milliwatt operating 500 mhz clock speed hexagon varies 400–2000 mhz qdsp6 256–350 mhz previous generation architecture qdsp5 hexagon qdsp6 pre-hexagon qdsp5 cores used modern qualcomm socs qdsp5 mostly low-end products modem qdsps often pre-hexagon shown table qdsp5 usage qdsp6 hexagon usage single instruction packet inner loop fft packet claimed qualcomm equal 29 classic risc operations includes vector add 4x 16-bit complex multiply operation hardware loop support instructions packet done cycle | [
950,
2448,
1640,
2765,
6874,
6922,
4479,
4197,
3751,
7412,
578,
6910,
515,
3695
] | Test |
7,493 | 4 | The_Tor_Project:tor project tor project inc. massachusetts-based 501 c 3 research-education nonprofit organization founded computer scientists roger dingledine nick mathewson five others tor project primarily responsible maintaining software tor anonymity network tor project founded computer scientists roger dingledine nick mathewson five others december 2006 electronic frontier foundation eff acted tor project fiscal sponsor early years early financial supporters tor project included u.s. international broadcasting bureau internews human rights watch university cambridge google netherlands-based stichting.net october 2014 tor project hired public relations firm thomson communications order improve public image particularly regarding terms dark net hidden services educate journalists technical aspects tor may 2015 tor project ended tor cloud service december 2015 tor project announced hired shari steele former executive director electronic frontier foundation new executive director roger dingledine acting interim executive director since may 2015 remained tor project director board member later month tor project announced open technology fund sponsoring bug bounty program coordinated hackerone program initially invite-only focus finding vulnerabilities specific tor project applications may 25 2016 core developer public face tor project jacob appelbaum stepped position announced june 2 two-line statement tor following days allegations sexual mistreatment made public several people june 4 shari steele executive director tor project published statement saying recent allegations sexual mistreatment regarding appelbaum consistent rumors us hearing time asserted ... recent allegations much serious concrete anything heard previously appelbaum denounced allegations part concerted strategy damage reputation july 13 2016 complete board tor project – meredith hoban dunn ian goldberg julius mittenzwei rabbi rob thomas wendy seltzer roger dingledine nick mathewson – replaced matt blaze cindy cohn gabriella coleman linus nordberg megan price bruce schneier july 2016 tor project announced results seven-week investigation led private investigator allegations jacob appelbaum determined accurate shari steele noted everything power treat mr. appelbaum fairly determined allegations appear true investigation concluded many people inside outside tor project reported incidents humiliated intimidated bullied frightened jacob appelbaum several experienced unwanted sexually aggressive behavior two unnamed individuals involved inappropriate behavior longer part project institutionally despite top-down management organization working volunteers employees organizations new anti-harassment policy approved new board well conflicts interest policy procedures submitting complaints internal complaint review process initially affair caused split wider still close-knit privacy community coming appelbaum defense others presenting even allegations affair continues controversial considerable dissent within tor community 80 tor project 2 million annual budget came united states government u.s. state department broadcasting board governors national science foundation major contributors aid democracy advocates authoritarian states swedish government organizations provided 20 including ngos thousands individual sponsors dingledine said united states department defense funds similar research grant procurement contract tor executive director andrew lewman said even though accepts funds u.s. federal government tor service collaborate nsa reveal identities users june 2016 tor project received award mozilla open source support program moss award significantly enhance tor network metrics infrastructure performance stability network monitored improvements made appropriate march 2011 tor project received free software foundation 2010 award projects social benefit citation read using free software tor enabled roughly 36 million people around world experience freedom access expression internet keeping control privacy anonymity network proved pivotal dissident movements iran recently egypt september 2012 tor project received 2012 eff pioneer award along jérémie zimmermann andrew huang november 2012 foreign policy magazine named dingledine mathewson syverson among top 100 global thinkers making web safe whistleblowers 2014 roger dingledine nick mathewson paul syverson received usenix test time award paper titled tor second-generation onion router published proceedings 13th usenix security symposium august 2004 | [
6025,
907,
501,
5808,
52,
6424,
3573,
6046
] | Validation |
7,494 | 5 | Finger_protocol:finger protocol computer networking name/finger protocol finger user information protocol simple network protocols exchange human-oriented status user information name/finger protocol based request comments document december 1977 interface codice_1 codice_2 programs provide status reports particular computer system particular person network sites finger program written 1971 les earnest created program solve need users wanted information users network information logged-in useful check availability person meet probably earliest form presence information remote network users prior finger program way get information codice_3 program showed ids terminal line numbers server internal number communication line user terminal connected logged-in users earnest named program idea people would run fingers codice_3 list find looking term finger 1970s connotation snitch made finger good reminder/mnemonic semantic unix codice_2 command client protocol context finger daemon runs tcp port 79 client case remote hosts open connection port 79 ruip remote user information program started remote end connection process request local host sends ruip one line query based upon finger query specification waits ruip respond ruip receives processes query returns answer initiates close connection local host receives answer close signal proceeds close end connection finger user information protocol based finger user information protocol december 1991 typically server side protocol implemented program codice_6 finger daemon client side implemented codice_1 codice_2 programs supposed return friendly human-oriented status report either system moment particular person depth required format protocol consists mostly specifying single command line program would supply information whether user currently logged-on e-mail address full name etc well standard user information finger displays contents codice_9 codice_10 files user home directory often file maintained user contains either useful information user current activities similar micro-blogging alternatively manner humor supplying detailed information e-mail addresses full names considered acceptable convenient early days networking later considered questionable privacy security reasons finger information used hackers way initiate social engineering attack company computer security system using finger client get list company employee names email addresses phone numbers hacker call email someone company requesting information posing another employee finger daemon also several exploitable security holes crackers used break systems example 1988 morris worm exploited overflow vulnerability codice_6 among others spread finger protocol also incompatible network address translation nat private network address ranges e.g 192.168.0.0/16 used majority home office workstations connect internet routers firewalls nowadays reasons finger widely used early days internet late 1990s vast majority sites internet longer offered service implemented unix unix-like systems current versions windows finger.exe command software finger support | [
7148,
361,
707,
6789,
1812,
3260,
6088,
7168,
7170,
7533,
20,
1462,
2219,
403,
3640,
2589,
3312,
7214,
7217,
1140,
2261,
4020,
456,
6879,
4759,
2281,
6521,
1537,
2999,
2644,
6531,
2650,
5480,
7637,
4415,
6908,
5138,
3383,
3033,
1213,
58... | Test |
7,495 | 3 | PPC_512:ppc 512 amstrad ppc512 amstrad ppc640 first portable ibm pc compatible computers made amstrad released 1988 development desktop pc-1512 pc-1640 models portable computers contained elements necessary perform computing move keyboard monochrome lcd display built also space disposable batteries power pc suitable alternative power source i.e mains 12 volt vehicle power available pcs came either one two double density double side floppy disc drives ppc640 model also featured modem models supplied 'ppc organiser software ppc640 additionally supplied 'mirror ii communications software two computers similar specifications ppc512 nec v30 processor running 8 mhz 512 kib memory full-size 102-key keyboard numeric keypad built-in liquid crystal display backlit could emulate cga mda either one two 720k 3.5 floppy drives model either ppc512s ppc512d depending number drives ppc640 otherwise identical except 640 kib memory built-in 1200 baud modem unusually fast day case darker shade grey versions machine empty socket main circuit board intel 8087 coprocessor could installed permit hardware processing floating point arithmetic ppc included standard connectors rs-232 centronics cga/mda video allowing existing peripherals used signals used 8-bit isa bus also available pair expansion connectors available external card cage expansion cards four possible power sources could used physical layout components unlike laptop designs instead lid containing screen contained keyboard hinges therefore front main unit rather back lcd hinged separately folded recess top system unit one two floppy drives located right-hand side closed size ppc 45 cm wide × 10 cm high × 23 cm deep bank six dip switches used select whether video hardware emulated cga mda whether use internal external monitor official hard drive option docking station manufactured sold third-party manufacturers ms-dos 3.3 supplied ppcs along 'organizer memory-resident suite utilities including card file diary calculator telephone dialler addition ppc 640 supplied mirror ii communications package use built-in modem ms-dos boot disk also included utility could used switch internal display external monitor without rebooting late 1988 amstrad created desktop computer based ppc design intended home market lcd replaced rf modulator display cga video domestic television keyboard system unit combined integrated case similar original atari st amiga 500 second floppy drive bay replaced two isa slots though design case cards fitted would protrude top computer pc200 black case 'sinclair branding pc20 white branded 'amstrad pc20s also omitted rf modulator support circuitry addition ms-dos 3.3 organizer pc20/pc200 supplied gem four cga-compatible games graphical capabilities cga sound output pc speaker greatly inferior compared home computers time consequently pc20/pc200 commercial success although pc20/pc200 support today floppy disk drives built-in fdd connector uses compatible floppy disk controller zilog z765a work modification fdd connector though 720k disks | [
768,
6380,
4277,
2189
] | Test |
7,496 | 2 | Universal_Time-Sharing_System:universal time-sharing system universal time-sharing system uts discontinued operating system xds sigma series computers succeeding batch processing monitor bpm /batch time-sharing monitor btm uts announced 1966 delays actually ship 1971 designed provide multi-programming services online interactive user programs addition batch-mode production jobs symbiont spooled i/o critical real-time processes system daemons called ghost jobs used run monitor code user space final release d00 shipped january 1973 succeeded cp-v operating system combined uts heavily batch-oriented xerox operating system xos cp-v pronounced sea-pea-five operating system compatible successor uts released august 1973 cp-v supported cpus uts plus xerox 560 cp-v offers single-stream multiprogrammed batch timesharing remote processing mode including intelligent remote batch realtime processing added release b00 april 1974 transaction processing release c00 november 1974 cp-v version c00 f00 telefile tcp-v version i00 still run sigma emulator developed 1997 cp-r control program real-time discontinued realtime operating system xerox 550 sigma 9 computer systems cp-r supports three types tasks foreground primary tasks foreground secondary tasks batch tasks 1975 xerox decided exit computer business purchased scientific data systems 1969 honeywell offered purchase xerox data systems initially provide field service support existing customer base cp-6 system including os program products developed beginning 1976 honeywell convert xerox cp-v users run honeywell equipment first beta site installed carleton university ottawa canada june 1979 three sites installed end 1979 support cp-6 transferred actc canada 1993 cp-6 systems continued run many years us canada sweden uk germany final system shutdown carleton university 2005 cp-6 accomplishments developers customers commemorated plaque community wall computer history museum mountain view california cp-v software release b00 1974 cp-v supporrted cp-6 team honeywell los angeles development center ladc 1977 thereafter xerox maintained library xerox user-written software exchange user group | [
1522,
7325,
7605,
280,
2818,
4759,
190,
4670,
5021,
8066,
8167,
4397,
13,
5644,
3271,
3526,
5116,
5999,
6984,
299,
3626,
7142,
5571,
2300,
5041,
7827,
4786,
578,
7550,
4244,
5232,
1992,
405,
6367,
2769,
6922,
8115,
5161,
5865,
336,
7396... | Test |
7,497 | 2 | OS/7:os/7 os/7 discontinued operating system sperry univac 90/60 90/70 computer systems system first announced november 1971 univac 9700 system originally scheduled delivery march 1973. ref name= univac 90/60 90/70 univac 90/60 90/70 /ref however delivery slipped nearly year impacted 9700 marketing effort first demonstrated univac new 90/60 system october 1973 official release planned january 1974 os/7 abruptly discontinued 1975 favor vs/9 univac name rca vmos operating system os/7 multi-tasking multi-programming system utilizes roll-in roll-out capability keep cpu optimally busy | [
1522,
7325,
7605,
280,
2818,
4759,
190,
4670,
5021,
8066,
8167,
4397,
13,
5644,
3271,
5116,
6984,
299,
3626,
7142,
5571,
2300,
5041,
7827,
4786,
578,
6197,
4244,
5232,
7550,
1992,
405,
1855,
6367,
6922,
8115,
5161,
5865,
7396,
65,
861,
... | Validation |
7,498 | 2 | Linux_From_Scratch:linux scratch linux scratch lfs type linux installation name book written gerard beekmans currently mainly maintained bruce dubbs book gives readers instructions build linux system source book available freely linux scratch site linux scratch way install working linux system building components manually naturally longer process installing pre-compiled linux distribution according linux scratch site advantages method compact flexible secure system greater understanding internal workings linux-based operating systems keep lfs small focused book beyond linux scratch blfs created presents instructions develop basic linux system created lfs introduces guides reader additions system including networking x sound printer scanner support since release 5.0 blfs book version matches lfs book version book cross linux scratch clfs focuses cross compiling including compiling headless embedded systems run linux lack resources needed compile linux clfs supports broad range processors addresses advanced techniques included lfs book cross-build toolchains multilibrary support 32 64-bit libraries side-by-side alternative instruction set architectures itanium sparc mips alpha book hardened linux scratch hlfs focuses security enhancements hardened kernel patches mandatory access control policies stack-smashing protection address space layout randomization besides main purpose creating security-focused operating system hlfs secondary goal security teaching tool automated linux scratch alfs project designed automate process creating lfs system aimed users gone lfs blfs books several times wish reduce amount work involved secondary goal act test lfs blfs books directly extracting running instructions xml sources lfs blfs books clean partition working linux system compiler essential software libraries required build lfs instead installing existing linux system one also use live cd build lfs system project formerly maintained linux scratch live cd lfs live cd contains source packages full version live cd lfs book automated building tools except minimal live cd version xfce gui environment work official lfs live cd longer maintained used build lfs version7 later however two unofficial builds used build 32-bit 64-bit kernel userspace respectively lfs 7.x first toolchain must compiled consisting tools used compile lfs like gcc glibc binutils necessary utilities root directory must changed using chroot toolchain partition start building final system one first packages compile glibc toolchain linker must adjusted link newly built glibc packages make finished system linked well chroot phase bash hashing feature turned temporary toolchain bin directory moved end path way newly compiled programs come first path new system builds new components list packages included clfs version 1.1.0 unless otherwise noted list applicable supported architectures standard build unit sbu term used initial bootstrapping system represents amount time required build first package lfs given computer creation prompted long time required build lfs system desire many users know long source tarball take build ahead time linux scratch version 6.3 first package built user gnu binutils building users encouraged measure build process using shell constructs dub time system standard build unit number known estimate time required build later packages expressed relative known sbu several packages built compilation take much longer build binutils including gnu c library rated 4.1 sbus gnu compiler collection rated 8.4 sbus unit must interpreted approximation various factors influence actual time required build package lwn.net reviewed lfs 2004 tux machines wrote review linux scratch 6.1 2005 tux machines also second part review third part source-based linux distributions | [
6789,
4662,
7528,
2559,
7182,
3635,
7555,
5055,
2226,
7214,
6489,
6865,
5453,
5803,
4759,
1535,
7251,
1176,
486,
7275,
7667,
1227,
169,
3747,
1237,
3751,
1989,
6952,
174,
5540,
5200,
7710,
1260,
6984,
2746,
3106,
5571,
578,
5933,
5232,
... | Test |
7,499 | 3 | CPU_cache:cpu cache cpu cache hardware cache used central processing unit cpu computer reduce average cost time energy access data main memory cache smaller faster memory closer processor core stores copies data frequently used main memory locations cpus different independent caches including instruction data caches data cache usually organized hierarchy cache levels l1 l2 l3 l4 etc. modern fast cpus specialized exceptions multiple levels cpu caches first cpus used cache one level cache unlike later level 1 caches split l1d data l1i instructions almost current cpus caches split l1 cache also l2 caches larger processors l3 caches well l2 cache usually split acts common repository already split l1 cache every core multi-core processor dedicated l2 cache usually shared cores l3 cache higher-level caches shared cores split l4 cache currently uncommon generally dynamic random-access memory dram rather static random-access memory sram separate die chip also case historically l1 bigger chips allowed integration generally cache levels possible exception last level extra level cache tends bigger optimized differently types caches exist counted towards cache size important caches mentioned translation lookaside buffer tlb part memory management unit mmu cpus caches generally sized powers two 4 8 16 etc kib mib larger non-l1 sizes although ibm z13 96 kib l1 instruction cache trying read write location main memory processor checks whether data location already cache processor read write cache instead much slower main memory modern desktop server cpus least three independent caches instruction cache speed executable instruction fetch data cache speed data fetch store translation lookaside buffer tlb used speed virtual-to-physical address translation executable instructions data single tlb provided access instructions data separate instruction tlb itlb data tlb dtlb provided data cache usually organized hierarchy cache levels l1 l2 etc see also multi-level caches however tlb cache part memory management unit mmu directly related cpu caches data transferred memory cache blocks fixed size called cache lines cache blocks cache line copied memory cache cache entry created cache entry include copied data well requested memory location called tag processor needs read write location memory first checks corresponding entry cache cache checks contents requested memory location cache lines might contain address processor finds memory location cache cache hit occurred however processor find memory location cache cache miss occurred case cache hit processor immediately reads writes data cache line cache miss cache allocates new entry copies data main memory request fulfilled contents cache make room new entry cache miss cache may evict one existing entries heuristic uses choose entry evict called replacement policy fundamental problem replacement policy must predict existing cache entry least likely used future predicting future difficult perfect method choose among variety replacement policies available one popular replacement policy least-recently used lru replaces least recently accessed entry marking memory ranges non-cacheable improve performance avoiding caching memory regions rarely re-accessed avoids overhead loading something cache without reuse cache entries may also disabled locked depending context data written cache point must also written main memory timing write known write policy write-through cache every write cache causes write main memory alternatively write-back copy-back cache writes immediately mirrored main memory cache instead tracks locations written marking dirty data locations written back main memory data evicted cache reason read miss write-back cache may sometimes require two memory accesses service one first write dirty location main memory another read new location memory also write main memory location yet mapped write-back cache may evict already dirty location thereby freeing cache space new memory location intermediate policies well cache may write-through writes may held store data queue temporarily usually multiple stores processed together reduce bus turnarounds improve bus utilization cached data main memory may changed entities e.g peripherals using direct memory access dma another core multi-core processor case copy cache may become out-of-date stale alternatively cpu multiprocessor system updates data cache copies data caches associated cpus become stale communication protocols cache managers keep data consistent known cache coherence protocols cache performance measurement become important recent times speed gap memory performance processor performance increasing exponentially cache introduced reduce speed gap thus knowing well cache able bridge gap speed processor memory becomes important especially high-performance systems cache hit rate cache miss rate play important role determining performance improve cache performance reducing miss rate becomes one necessary steps among steps decreasing access time cache also gives boost performance time taken fetch one cache line memory read latency due cache miss matters cpu run things waiting cache line cpu reaches state called stall cpus become faster compared main memory stalls due cache misses displace potential computation modern cpus execute hundreds instructions time taken fetch single cache line main memory various techniques employed keep cpu busy time including out-of-order execution cpu pentium pro later intel designs example attempts execute independent instructions instruction waiting cache miss data another technology used many processors simultaneous multithreading smt orin intel terminologyhyper-threading ht allows alternate thread use cpu core first thread waits required cpu resources become available replacement policy decides cache copy particular entry main memory go replacement policy free choose entry cache hold copy cache called fully associative extreme entry main memory go one place cache cache direct mapped many caches implement compromise entry main memory go one n places cache described n-way set associative example level-1 data cache amd athlon two-way set associative means particular location main memory cached either two locations level-1 data cache choosing right value associativity involves trade-off ten places replacement policy could mapped memory location check location cache ten cache entries must searched checking places takes power chip area potentially time hand caches associativity suffer fewer misses see conflict misses cpu wastes less time reading slow main memory general guideline doubling associativity direct mapped two-way two-way four-way effect raising hit rate doubling cache size however increasing associativity four improve hit rate much generally done reasons see virtual aliasing cpus dynamically reduce associativity caches low-power states acts power-saving measure order worse simple better complex cache organization location main memory go one entry cache therefore direct-mapped cache also called one-way set associative cache replacement policy since choice cache entry contents evict means two locations map entry may continually knock although simpler direct-mapped cache needs much larger associative one give comparable performance unpredictable let block number cache block number memory number blocks cache mapping done help equation location main memory cached either two locations cache one logical question one two simplest commonly used scheme shown right-hand diagram use least significant bits memory location index index cache memory two entries index one benefit scheme tags stored cache include part main memory address implied cache memory index since cache tags fewer bits require fewer transistors take less space processor circuit board microprocessor chip read compared faster also lru especially simple since one bit needs stored pair one advantages direct mapped cache allows simple fast speculation address computed one cache index might copy location memory known cache entry read processor continue work data finishes checking tag actually matches requested address idea processor use cached data tag match completes applied associative caches well subset tag called hint used pick one possible cache entries mapping requested address entry selected hint used parallel checking full tag hint technique works best used context address translation explained schemes suggested skewed cache index way 0 direct index way 1 formed hash function good hash function property addresses conflict direct mapping tend conflict mapped hash function less likely program suffer unexpectedly large number conflict misses due pathological access pattern downside extra latency computing hash function additionally comes time load new line evict old line may difficult determine existing line least recently used new line conflicts data different indexes way lru tracking non-skewed caches usually done per-set basis nevertheless skewed-associative caches major advantages conventional set-associative ones true set-associative cache tests possible ways simultaneously using something like content addressable memory pseudo-associative cache tests possible way one time hash-rehash cache column-associative cache examples pseudo-associative cache common case finding hit first way tested pseudo-associative cache fast direct-mapped cache much lower conflict miss rate direct-mapped cache closer miss rate fully associative cache cache row entries usually following structure data block cache line contains actual data fetched main memory tag contains part address actual data fetched main memory flag bits discussed size cache amount main memory data hold size calculated number bytes stored data block times number blocks stored cache tag flag error correction code bits included size although affect physical area cache effective memory address goes along cache line memory block split msb lsb tag index block offset index describes cache set data put index length formula_1 bits cache sets block offset specifies desired data within stored data block within cache row typically effective address bytes block offset length formula_2 bits number bytes per data block tag contains significant bits address checked rows current set set retrieved index see set contains requested address cache hit occurs tag length bits follows authors refer block offset simply offset displacement original pentium 4 processor four-way set associative l1 data cache 8 kib size 64-byte cache blocks hence 8 kib 64 128 cache blocks number sets equal number cache blocks divided number ways associativity leads 128 4 32 sets hence 2 32 different indices 2 64 possible offsets since cpu address 32 bits wide implies 32 5 6 21 bits tag field original pentium 4 processor also eight-way set associative l2 integrated cache 256 kib size 128-byte cache blocks implies 32 8 7 17 bits tag field instruction cache requires one flag bit per cache row entry valid bit valid bit indicates whether cache block loaded valid data power-up hardware sets valid bits caches invalid systems also set valid bit invalid times multi-master bus snooping hardware cache one processor hears address broadcast processor realizes certain data blocks local cache stale marked invalid data cache typically requires two flag bits per cache line valid bit dirty bit dirty bit set indicates associated cache line changed since read main memory dirty meaning processor written data line new value propagated way main memory cache miss failed attempt read write piece data cache results main memory access much longer latency three kinds cache misses instruction read miss data read miss data write miss cache read misses instruction cache generally cause largest delay processor least thread execution wait stall instruction fetched main memory cache read misses data cache usually cause smaller delay instructions dependent cache read issued continue execution data returned main memory dependent instructions resume execution cache write misses data cache generally cause shortest delay write queued limitations execution subsequent instructions processor continue queue full detailed introduction types misses see cache performance measurement metric general purpose cpus implement form virtual memory summarize either program running machine sees simplified address space contains code data program programs run common virtual address space program executes calculating comparing reading writing addresses virtual address space rather addresses physical address space making programs simpler thus easier write virtual memory requires processor translate virtual addresses generated program physical addresses main memory portion processor translation known memory management unit mmu fast path mmu perform translations stored translation lookaside buffer tlb cache mappings operating system page table segment table purposes present discussion three important features address translation early virtual memory systems slow required access page table held main memory every programmed access main memory caches effectively cut speed memory access half first hardware cache used computer system actually data instruction cache rather tlb caches divided four types based whether index tag correspond physical virtual addresses speed recurrence load latency crucial cpu performance modern level-1 caches virtually indexed least allows mmu tlb lookup proceed parallel fetching data cache ram virtual indexing best choice cache levels cost dealing virtual aliases grows cache size result level-2 larger caches physically indexed caches historically used virtual physical addresses cache tags although virtual tagging uncommon tlb lookup finish cache ram lookup physical address available time tag compare need virtual tagging large caches tend physically tagged small low latency caches virtually tagged recent general-purpose cpus virtual tagging superseded vhints described cache relies virtual indexing tagging becomes inconsistent virtual address mapped different physical addresses homonym solved using physical address tagging storing address space identifier cache line however latter approach help synonym problem several cache lines end storing data physical address writing locations may update one location cache leaving others inconsistent data issue may solved using non-overlapping memory layouts different address spaces otherwise cache part must flushed mapping changes great advantage virtual tags associative caches allow tag match proceed virtual physical translation done however coherence probes evictions present physical address action hardware must means converting physical addresses cache index generally storing physical tags well virtual tags comparison physically tagged cache need keep virtual tags simpler virtual physical mapping deleted tlb cache entries virtual addresses flushed somehow alternatively cache entries allowed pages mapped tlb entries flushed access rights pages changed page table also possible operating system ensure virtual aliases simultaneously resident cache operating system makes guarantee enforcing page coloring described early risc processors sparc rs/6000 took approach used recently hardware cost detecting evicting virtual aliases fallen software complexity performance penalty perfect page coloring risen useful distinguish two functions tags associative cache used determine way entry set select used determine cache hit missed second function must always correct permissible first function guess get wrong answer occasionally processors e.g early sparcs caches virtual physical tags virtual tags used way selection physical tags used determining hit miss kind cache enjoys latency advantage virtually tagged cache simple software interface physically tagged cache bears added cost duplicated tags however also miss processing alternate ways cache line indexed probed virtual aliases matches evicted extra area latency mitigated keeping virtual hints cache entry instead virtual tags hints subset hash virtual tag used selecting way cache get data physical tag like virtually tagged cache may virtual hint match physical tag mismatch case cache entry matching hint must evicted cache accesses cache fill address one hint match since virtual hints fewer bits virtual tags distinguishing one another virtually hinted cache suffers conflict misses virtually tagged cache perhaps ultimate reduction virtual hints found pentium 4 willamette northwood cores processors virtual hint effectively two bits cache four-way set associative effectively hardware maintains simple permutation virtual address cache index content-addressable memory cam necessary select right one four ways fetched large physically indexed caches usually secondary caches run problem operating system rather application controls pages collide one another cache differences page allocation one program run next lead differences cache collision patterns lead large differences program performance differences make difficult get consistent repeatable timing benchmark run understand problem consider cpu 1 mib physically indexed direct-mapped level-2 cache 4 kib virtual memory pages sequential physical pages map sequential locations cache 256 pages pattern wraps around label physical page color 0–255 denote cache go locations within physical pages different colors conflict cache programmers attempting make maximum use cache may arrange programs access patterns 1 mib data need cached given time thus avoiding capacity misses also ensure access patterns conflict misses one way think problem divide virtual pages program uses assign virtual colors way physical colors assigned physical pages programmers arrange access patterns code two pages virtual color use time wide literature optimizations e.g loop nest optimization largely coming high performance computing hpc community snag pages use given moment may different virtual colors may physical colors fact operating system assigns physical pages virtual pages randomly uniformly extremely likely pages physical color locations pages collide cache birthday paradox solution operating system attempt assign different physical color pages different virtual colors technique called page coloring although actual mapping virtual physical color irrelevant system performance odd mappings difficult keep track little benefit approaches page coloring simply try keep physical virtual page colors operating system guarantee physical page maps one virtual color virtual aliases processor use virtually indexed caches need extra virtual alias probes miss handling alternatively os flush page cache whenever changes one virtual color another mentioned approach used early sparc rs/6000 designs modern processors multiple interacting on-chip caches operation particular cache completely specified cache size cache block size number blocks set cache set replacement policy cache write policy write-through write-back cache blocks particular cache size associativity typically lower-level caches called level 1 cache smaller number blocks smaller block size fewer blocks set short access times higher-level caches i.e level 2 progressively larger numbers blocks larger block size blocks set relatively longer access times still much faster main memory cache entry replacement policy determined cache algorithm selected implemented processor designers cases multiple algorithms provided different kinds work loads pipelined cpus access memory multiple points pipeline instruction fetch virtual-to-physical address translation data fetch see classic risc pipeline natural design use different physical caches points one physical resource scheduled service two points pipeline thus pipeline naturally ends least three separate caches instruction tlb data specialized particular role victim cache cache used hold blocks evicted cpu cache upon replacement victim cache lies main cache refill path holds blocks data evicted main cache victim cache usually fully associative intended reduce number conflict misses many commonly used programs require associative mapping accesses fact small fraction memory accesses program require high associativity victim cache exploits property providing high associativity accesses introduced norman jouppi dec 1990 intel crystalwell variant haswell processors equipped intel iris pro gt3e embedded graphics 128 mb edram introduced on-package level 4 cache serves victim cache processors level 3 cache skylake processors level 4 cache longer works victim cache one extreme examples cache specialization trace cache also known execution trace cache found intel pentium 4 microprocessors trace cache mechanism increasing instruction fetch bandwidth decreasing power consumption case pentium 4 storing traces instructions already fetched decoded trace cache stores instructions either decoded retired generally instructions added trace caches groups representing either individual basic blocks dynamic instruction traces pentium 4 trace cache stores micro-operations resulting decoding x86 instructions providing also functionality micro-operation cache next time instruction needed decoded micro-ops write coalescing cache special cache part l2 cache amd bulldozer microarchitecture stores l1d caches module go wcc buffered coalesced wcc task reducing number writes l2 cache micro-operation cache μop cache uop cache uc specialized cache stores micro-operations decoded instructions received directly instruction decoders instruction cache instruction needs decoded μop cache checked decoded form re-used cached available instruction decoded cached one early works describing μop cache alternative frontend intel p6 processor family 2001 paper micro-operation cache power aware frontend variable instruction length isa later intel included μop caches sandy bridge processors successive microarchitectures like ivy bridge haswell amd implemented μop cache zen microarchitecture fetching complete pre-decoded instructions eliminates need repeatedly decode variable length complex instructions simpler fixed-length micro-operations simplifies process predicting fetching rotating aligning fetched instructions μop cache effectively offloads fetch decode hardware thus decreasing power consumption improving frontend supply decoded micro-operations μop cache also increases performance consistently delivering decoded micro-operations backend eliminating various bottlenecks cpu fetch decode logic μop cache many similarities trace cache although μop cache much simpler thus providing better power efficiency makes better suited implementations battery-powered devices main disadvantage trace cache leading power inefficiency hardware complexity required heuristic deciding caching reusing dynamically created instruction traces branch target cache branch target instruction cache name used arm microprocessors specialized cache holds first instructions destination taken branch used low-powered processors need normal instruction cache memory system capable delivering instructions fast enough satisfy cpu without one however applies consecutive instructions sequence still takes several cycles latency restart instruction fetch new address causing cycles pipeline bubble control transfer branch target cache provides instructions cycles avoiding delay taken branches allows full-speed operation much smaller cache traditional full-time instruction cache smart cache level 2 level 3 caching method multiple execution cores developed intel smart cache shares actual cache memory cores multi-core processor comparison dedicated per-core cache overall cache miss rate decreases cores need equal parts cache space consequently single core use full level 2 level 3 cache cores inactive furthermore shared cache makes faster share memory among different execution cores another issue fundamental tradeoff cache latency hit rate larger caches better hit rates longer latency address tradeoff many computers use multiple levels cache small fast caches backed larger slower caches multi-level caches generally operate checking fastest level 1 l1 cache first hits processor proceeds high speed smaller cache misses next fastest cache level 2 l2 checked accessing external memory latency difference main memory fastest cache become larger processors begun utilize many three levels on-chip cache price-sensitive designs used pull entire cache hierarchy on-chip 2010s highest-performance designs returned large off-chip caches often implemented edram mounted multi-chip module fourth cache level benefits l3 l4 caches depend application access patterns examples products incorporating l3 l4 caches include following finally end memory hierarchy cpu register file considered smallest fastest cache system special characteristic scheduled software—typically compiler allocates registers hold values retrieved main memory example loop nest optimization however register renaming compiler register assignments reallocated dynamically hardware runtime register bank allowing cpu break false data dependencies thus easing pipeline hazards register files sometimes also hierarchy cray-1 circa 1976 eight address eight scalar data registers generally usable also set 64 address b 64 scalar data registers took longer access faster main memory b registers provided cray-1 data cache cray-1 however instruction cache considering chip multiple cores question whether caches shared local core implementing shared cache inevitably introduces wiring complexity one cache per chip rather core greatly reduces amount space needed thus one include larger cache typically sharing l1 cache undesirable resulting increase latency would make core run considerably slower single-core chip however highest-level cache last one called accessing memory global cache desirable several reasons allowing single core use whole cache reducing data redundancy making possible different processes threads share cached data reducing complexity utilized cache coherency protocols example eight-core chip three levels may include l1 cache core one intermediate l2 cache pair cores one l3 cache shared cores shared highest-level cache called accessing memory usually referred last level cache llc additional techniques used increasing level parallelism llc shared multiple cores including slicing multiple pieces addressing certain ranges memory addresses accessed independently separate cache structure instructions data cached separately meaning cache line used cache either instructions data various benefits demonstrated separate data instruction translation lookaside buffers unified structure constraint present cache lines used cache instructions data multi-level caches introduce new design decisions instance processors data l1 cache must also somewhere l2 cache caches called strictly inclusive processors like amd athlon exclusive caches data guaranteed one l1 l2 caches never still processors like intel pentium ii iii 4 require data l1 cache also reside l2 cache although may often universally accepted name intermediate policy two common names non-exclusive partially-inclusive advantage exclusive caches store data advantage larger exclusive l1 cache comparable l2 cache diminishes l2 cache many times larger l1 cache l1 misses l2 hits access hitting cache line l2 exchanged line l1 exchange quite bit work copying line l2 l1 inclusive cache one advantage strictly inclusive caches external devices processors multiprocessor system wish remove cache line processor need processor check l2 cache cache hierarchies enforce inclusion l1 cache must checked well drawback correlation associativities l1 l2 caches l2 cache least many ways l1 caches together effective associativity l1 caches restricted another disadvantage inclusive cache whenever eviction l2 cache possibly corresponding lines l1 also get evicted order maintain inclusiveness quite bit work would result higher l1 miss rate another advantage inclusive caches larger cache use larger cache lines reduces size secondary cache tags exclusive caches require caches size cache lines cache lines swapped l1 miss l2 hit secondary cache order magnitude larger primary cache data order magnitude larger cache tags tag area saved comparable incremental area needed store l1 cache data l2 illustrate specialization multi-level caching cache hierarchy k8 core amd athlon 64 cpu k8 four specialized caches instruction cache instruction tlb data tlb data cache caches specialized k8 also multiple-level caches second-level instruction data tlbs store ptes mapping 4 kb instruction data caches various tlbs fill large unified l2 cache cache exclusive l1 instruction data caches means 8-byte line one l1 instruction cache l1 data cache l2 cache however possible line data cache pte also one tlbs—the operating system responsible keeping tlbs coherent flushing portions page tables memory updated k8 also caches information never stored memory—prediction information caches shown diagram usual class cpu k8 fairly complex branch prediction tables help predict whether branches taken tables predict targets branches jumps information associated instructions level 1 instruction cache unified secondary cache k8 uses interesting trick store prediction information instructions secondary cache lines secondary cache protected accidental data corruption e.g alpha particle strike either ecc parity depending whether lines evicted data instruction primary caches since parity code takes fewer bits ecc code lines instruction cache spare bits bits used cache branch prediction information associated instructions net result branch predictor larger effective history table better accuracy processors kinds predictors e.g store-to-load bypass predictor dec alpha 21264 various specialized predictors likely flourish future processors predictors caches store information costly compute terminology used discussing predictors caches one speaks hit branch predictor predictors generally thought part cache hierarchy k8 keeps instruction data caches coherent hardware means store instruction closely following store instruction change following instruction processors like alpha mips family relied software keep instruction cache coherent stores guaranteed show instruction stream program calls operating system facility ensure coherency computer engineering tag ram used specify possible memory locations currently stored cpu cache simple direct-mapped design fast sram used higher associative caches usually employ content-addressable memory cache reads common cpu operation takes single cycle program execution time tends sensitive latency level-1 data cache hit great deal design effort often power silicon area expended making caches fast possible simplest cache virtually indexed direct-mapped cache virtual address calculated adder relevant portion address extracted used index sram returns loaded data data byte aligned byte shifter bypassed next operation need tag checking inner loop fact tags need even read later pipeline load instruction retired tag loaded data must read checked virtual address make sure cache hit miss cache updated requested cache line pipeline restarted associative cache complicated form tag must read determine entry cache select n-way set-associative level-1 cache usually reads n possible tags n data parallel chooses data associated matching tag level-2 caches sometimes save power reading tags first one data element read data sram adjacent diagram intended clarify manner various fields address used address bit 31 significant bit 0 least significant diagram shows srams indexing multiplexing 4 kb 2-way set-associative virtually indexed virtually tagged cache 64 byte b lines 32-bit read width 32-bit virtual address cache 4 kb 64 b lines 64 lines cache read two time tag sram 32 rows pair 21 bit tags although function virtual address bits 31 6 could used index tag data srams simplest use least significant bits similarly cache 4 kb 4 b read path reads two ways access data sram 512 rows 8 bytes wide modern cache might 16 kb 4-way set-associative virtually indexed virtually hinted physically tagged 32 b lines 32-bit read width 36-bit physical addresses read path recurrence cache looks similar path instead tags vhints read matched subset virtual address later pipeline virtual address translated physical address tlb physical tag read one vhint supplies way cache read finally physical address compared physical tag determine hit occurred sparc designs improved speed l1 caches gate delays collapsing virtual address adder sram decoders see sum addressed decoder early history cache technology closely tied invention use virtual memory scarcity cost semi-conductor memories early mainframe computers 1960s used complex hierarchy physical memory mapped onto flat virtual memory space used programs memory technologies would span semi-conductor magnetic core drum disc virtual memory seen used programs would flat caching would used fetch data instructions fastest memory ahead processor access extensive studies done optimize cache sizes optimal values found depend greatly programming language used algol needing smallest fortran cobol needing largest cache sizes early days microcomputer technology memory access slightly slower register access since 1980s performance gap processor memory growing microprocessors advanced much faster memory especially terms operating frequency memory became performance bottleneck technically possible main memory fast cpu economically viable path taken use plenty low-speed memory also introduce small high-speed cache memory alleviate performance gap provided order magnitude capacity—for price—with slightly reduced combined performance first documented uses tlb ge 645 ibm 360/67 used associative memory tlb first documented use data cache ibm system/360 model 85 68010 released 1982 loop mode considered tiny special-case instruction cache accelerates loops consist two instructions 68020 released 1984 replaced typical instruction cache 256 bytes first 68k series processor feature true on-chip cache memory 68030 released 1987 basically 68020 core additional 256-byte data cache process shrink added burst mode caches 68040 released 1990 split instruction data caches four kilobytes 68060 released 1994 following 8 kb data cache four-way associative 8 kb instruction cache four-way associative 96-byte fifo instruction buffer 256-entry branch cache 64-entry address translation cache mmu buffer four-way associative x86 microprocessors reached clock rates 20 mhz 386 small amounts fast cache memory began featured systems improve performance dram used main memory significant latency 120 ns well refresh cycles cache constructed expensive significantly faster sram memory cells time latencies around 10 ns 25 ns early caches external processor typically located motherboard form eight nine dip devices placed sockets enable cache optional extra upgrade feature versions intel 386 processor could support 16 256 kb external cache 486 processor 8 kb cache integrated directly cpu die cache termed level 1 l1 cache differentiate slower on-motherboard level 2 l2 cache on-motherboard caches much larger common size 256 kb popularity on-motherboard cache continued pentium mmx era made obsolete introduction sdram growing disparity bus clock rates cpu clock rates caused on-motherboard cache slightly faster main memory next development cache implementation x86 microprocessors began pentium pro brought secondary cache onto package microprocessor clocked frequency microprocessor on-motherboard caches enjoyed prolonged popularity thanks amd k6-2 amd k6-iii processors still used socket 7 previously used intel on-motherboard caches k6-iii included 256 kb on-die l2 cache took advantage on-board cache third level cache named l3 motherboards 2 mb on-board cache produced socket 7 became obsolete on-motherboard cache disappeared x86 systems three-level caches used first introduction multiple processor cores l3 cache added cpu die became common total cache sizes increasingly larger newer processor generations recently 2011 uncommon find level 3 cache sizes tens megabytes intel introduced level 4 on-package cache haswell microarchitecture crystalwell haswell cpus equipped gt3e variant intel integrated iris pro graphics effectively feature 128 mb embedded dram edram package l4 cache shared dynamically on-die gpu cpu serves victim cache cpu l3 cache early cache designs focused entirely direct cost cache ram average execution speed recent cache designs also consider energy efficiency fault tolerance goals researchers also explored use emerging memory technologies edram embedded dram nvram non-volatile ram designing caches several tools available computer architects help explore tradeoffs cache cycle time energy area tools include open-source cacti cache simulator open-source simplescalar instruction set simulator modeling 2d 3d sram edram stt-ram reram pcm caches done using destiny tool multi-ported cache cache serve one request time accessing traditional cache normally use single memory address whereas multi-ported cache may request n addresses time n number ports connected processor cache benefit pipelined processor may access memory different phases pipeline another benefit allows concept super-scalar processors different cache levels | [
2903,
1447,
1452,
5737,
5738,
2926,
1473,
5752,
1481,
4347,
4365,
4368,
4370,
4372,
2977,
3002,
7254,
3008,
4408,
4410,
1556,
1564,
1568,
1570,
1590,
1592,
7314,
4479,
5911,
3098,
1640,
7361,
7364,
216,
5939,
7376,
4524,
1670,
4526,
239,
... | Validation |
7,500 | 7 | SnapLogic:snaplogic snaplogic commercial software company provides integration platform service ipaas tools connecting cloud data sources saas applications on-premises business software applications headquartered san mateo ca snaplogic founded 2006 snaplogic headed ex-ceo co-founder informatica gaurav dhillon venture backed andreessen horowitz ignition partners floodgate fund brian mcclendon naval ravikant 2017 company raised 136.3 million december 10 2015 snaplogic announced 37.5 million funding round led microsoft silver lake waterman along existing investors andreessen horowitz ignition partners triangle peak partners made total investment raised 96.3 million snaplogic time announcement snaplogic elastic integration platform consists integration cloud prebuilt connectors called snaps snaplex data processing cloud behind firewall company products referred targeting internet things marketplace connecting data applications devices integration cloud approaches big data integration following tools snaplex self-upgrading elastic execution grid streams data applications databases files social big data sources snaplex run cloud behind firewall hadoop snaps modular collections integration components built specific application data source available analytics big data sources identity management social media online storage erp databases technologies xml json oauth soap rest snap patterns introduced march 2014 help connecting cloud services like amazon redshift salesforce.com workday servicenow on-premises applications databases files company winter 2015 release focused adding tighter security added support hadoop big data integration product line | [
2961,
4163,
7037,
330
] | Validation |
7,501 | 9 | Autovivification:autovivification perl programming language autovivification automatic creation new arrays hashes required every time undefined value dereferenced perl autovivification allows programmer refer structured variable arbitrary sub-elements structured variable without expressly declaring existence variable complete structure beforehand contrast programming languages either 1 require programmer expressly declare entire variable structure using referring part 2 require programmer declare part variable structure referring part 3 create assignment part variable referring assigning composing expression refers part perl autovivification contrasted languages python php ruby many c style languages dereferencing null undefined values generally permitted compared html standard named access window object results corresponding globally scoped variables automatically accessible browser-based javascript important remember autovivification happens undefined value dereferenced assignment necessary debugger session illustrates autovivification hash examining debugger session illustrates autovivification hash assigning inner hash hashes several layers deep created automatically without declarations autovivification prevent excessive typing perl support autovivification structure would created follows perl 5.6.1 newer support autovivification file directory handles calling codice_1 undefined variable set filehandle according perl561delta largely eliminates need typeglobs opening filehandles must passed around following example c++ associative containers like codice_2 use codice_3 get value associated key nothing associated key construct another example counting occurrences string similar trick achieved codice_4 method returns iterator element associated key even already exists python built-in codice_5 class subclassed implement autovivificious dictionaries simply overriding codice_6 method added class python v2.5 ways implementing behavior following one simplest instances class print like normal python dictionary objects ruby hashes take block specifying object returned non-existing indexes used implement autovivificious maps java map method computeifabsent used emulate autovivificous maps php arrays natively autovivificious however applies assignment array access es6 introduces new proxy class used implement autovivification features javascript reduced single line code c using indexers c 4.0 dynamics dynamicobject used implementing different syntaxes also | [
6029,
5983,
2451,
5965,
8174,
7005
] | Test |
7,502 | 7 | Hue_(Software):hue software hue open-source sql cloud editor licensed apache v2 license hue open source sql cloud editor browsing querying visualizing data goal make self service data querying widespread organizations hue team works provides releases website hue also present major hadoop distributions cdh hdp mapr aws emr demo vms | [
6506,
5965
] | Test |
7,503 | 4 | Ahn_Cheol-soo:ahn cheol-soo ahn cheol-soo born 26 february 1962 south korean politician medical doctor businessperson software entrepreneur two-time former presidential election candidate 2012 2017 ahn currently bareunmirae party candidate seoul mayorship ran independent candidate presidential election 2012 withdrew month election took place support moon jae-in ran 2017 people party nominee founding co-leader party leader people party party bareun party merged bareunmirae party february 2018 prior politics ahn founded ahnlab inc. antivirus software company 1995 chairman board chief learning officer ahnlab september 2012 remains company largest stakeholder prior entering politics ahn served dean graduate school convergence science technology seoul national university september 2012 ahn born 26 february 1962 miryang south korea father military service subsequently moved family busan grew ahn academic child number academic hobbies reading received doctor medicine md master science ms doctor philosophy phd degrees physiology seoul national university 1980 1991 became youngest chief professors dankook university medical college 27 years age marking first career medical doctor ahn met wife whilst university whilst working graduate student pursuing md ahn began gain interest computer software hobby particular antivirus software ahn soon began working antivirus software confronted virus mass-infecting computers korea ahn soon infected virus reverse engineered virus attempt erase disk drive successful program wrote help get rid virus eventually called vaccine ahn distributed free finishing military service medical officer south korean navy leaving behind career medical profession cheol-soo went establish venture company ahnlab inc march 1995 advised software company official ahn previously attempted distribute v3 via samsung brand though samsung rejected ahn offer ahn knowing run business first struggled first several years whilst managing company ahn also attempting get master degree engineering university pennsylvania graduated 1997 ahn eventually received 10 million offer us software giant mcafee ahn met john mcafee personally mcafee struggling expand south korea due ahnlab inc wanted purchase company attempt monopolize anti-virus software market south korea ahn rejected offer despite ahnlab inc struggling selling company would lead widespread redundancies 1999 company began run surplus cih virus became widespread korea people needed buy v3 protect end 1999 ahnlab inc became second biggest computer security company south korea company later became largest computer security company south korea included annual lists korea admired companies korea management association consulting 2004 2008 resigned ceo 2005 served chairman board 2012 ahn revealed john mcafee suggested would acquire ahnlab 10,000,000 rejected offer mentioned patriotic reasons decision saying selling ahnlab might allow foreign firm dominate korean market ahn became outside director posco 2005 2010 2011 chairman company ahn awarded executive master business administration emba degree wharton school san francisco campus 2008 became professor kaist 2008 later beginning 2011 became dean graduate school convergence science technology seoul national university since 2006 ahn offered places main political parties constantly denied chance run independent due opposing factions early september 2011 speculation spread ahn would enter politics competing 26 october seoul mayoral by-election democratic party liberty korea party attempted recruit ahn mayoral by-election though failed due ahn feeling like many voters become disenfranchised main two choices ahn eventually made announcement denouncing opposition ruling party saying sure candidacy deciding watch polls making choice though shared sentiment felt like 'd take lot work help seoul saying ten years work would needed help city analysts stated positioned independent ahn would attract degree support disaffected mainstream political parties wake corruption allegations continuing policy failures ahn polling higher potential candidates 35 second place coming 17 approval rating subsequently polled afterwards reaching 50 ahn eventually n't run despite positive poll ratings instead endorsing park won-soon went win by-election park win attributed ahn endorsement due centrist voters moving park side endorsement alluded standing presidential candidate 2012 book thoughts ahn cheol-soo 19 september 2012 3 p.m. korea standard time ahn held press conference announced intention run 2012 presidential election announcement came months speculation whether ahn going run presidency south korean presidential election held 19 december 2012 address lasted around 20 minutes ahn spent considerable amount time explaining came decision run president republic korea quoting people met exploring candidacy expressed desire new politics ahn one point showed polling stronger moon jae-in polls showing could win park geun-hye candidate would go win election 23 november 2012 8:20 p.m. kst ahn announced would drop race endorsing moon jae-in democratic united party presidential candidate 11 march 2013 ahn announced would run seat national assembly south korea independent candidate by-election district seoul nowon c. election 24 april entering first elected office may 2013 launched new think tank named policy network tomorrow entered assembly ahn began explore creation new party provisionally named new political vision party basis public surveys 26 march 2014 however party process set ahn merged faction liberal democratic party form new politics alliance democracy npad becoming co-chairman new party alongside kim han-gil ahn kim resigned position three months later july following new party disappointing performance by-elections year seen liberals lose seat jeolla conservatives first time 26 years ahn remained npad came increasing conflict moon jae-in taken sole leadership party resignation pro-roh faction moon represented december 2015 ahn issued ultimatum moon demanding convention held beginning 2016 elect new party leader moon rejected demand ahn left npad along range lawmakers opposed moon including kim han-gil announcing would form new party subsequently joined forces chun jung-bae left party earlier year form people party january 2016 moon resigned leader ahn defection describing experience series difficult days without single one respite ahn positioned new people party anti-establishment centrist force attracting support political wings labeled remaining npad anachronistic progressives accused contemporary korean politicians lacking policies beyond short-term gimmicks lead-up april 13 parliamentary election came conflict co-leader chun members party kim chong-in interim leader democratic party npad successor called two parties form electoral alliance kim han-gil ahn co-leader chun supported plan ahn rejected prospect alliance former party proposal ultimately scotched kim han-gil withdrawing upcoming election protest event people party performed better anticipated coming second party-list voting winning 38 seats overall including 23 28 districts liberal stronghold jeolla people party held balance power new assembly establishing three-party system ahn credited victory seen giving position kingmaker support contesting presidential elections following year following election ahn rejected continued calls regroup minjoo party stating would inappropriate speak politically realigning point time added people party would mere tie-breaking third party ... new opinion leader parliamentary affairs ahn widely known likely contender 2017 south korean presidential election selected people party nominee defeating sohn hak-kyu park joo-sun despite rapid increase opinion polling briefly bypassed moon jae-in ahn floundered tv debates led loss finishing third field five total candidates underperformance presidential campaign party scandal found people party members fabricating evidence smear moon jae-in campaign led ahn declare july 2017 apologize take step back politics self-reflection returned month later run later win party chairmanship head people party ahn strong advocate merging center-right bareun party two leaders respective parties ahn former presidential contender yoo seung-min pushed forward merger completed february 2018 although yoo retained leadership position within new party ahn stepped leadership role march 2018 took role leading party talent recruiting committee formal position speculated signal preparation run seoul mayorship later year ahn stated considers franklin d. roosevelt role model referred bernie sanders korea supports increased capital gains tax higher public welfare spending cautious approach free trade agreements ahn also made appeals conservatives however associated people party reformative currents korean conservatism september 2012 ahn visited graves syngman rhee park chung-hee kim dae-jung park rhee often praised korean conservatives kim liberals ahn stated time would hypocritical paint half people enemies time call 'unity ahn considered palatable conservative voters part due business background ahn among first opposed american deployment terminal high altitude area defense system commonly referred thaad alongside moon jae-in however changed stance suggesting irresponsible future president reverse agreement already made united states korea ahn stated opposes legalization same-sex marriage although detailed article broadcasting network sbs website said same-sex marriage needs achieved social discussion december 2011 ahn expressed willingness donate half shares ahnlab education children low-income families owns 37.1 percent ahnlab shares 9 december 2011 value shares donated 250 billion 218 million september 2012 ahn made public apology reports surfaced wife evaded taxes under-pricing 2001 apartment bought worth ₩450 million ₩250 million thus reducing acquisition registration taxes ₩10 million however statement korea taxpayers association claimed contract accordance trade customs thus unlawful due flaws local tax law 1996 2005 1988 married kim mi-kyung currently professor seoul national university college medicine ahn daughter kim | [
496,
935,
3162,
1805
] | Test |
7,504 | 4 | Vanish_(computer_science):vanish computer science vanish project give users control lifetime personal data stored web led roxana geambasu university washington project proposes allow user enter information send across internet thereby relinquishing control however user able include expiration date information longer usable anyone may copy even creator vanish approach found vulnerable sybil attack thus insecure team called unvanish university texas university michigan princeton vanish acts automating encryption information entered user encryption key unknown user along actual information user enters also enters metadata concerning long information remain available system encrypts information store either encryption key original information instead breaks decryption key smaller components disseminated across distributed hash tables dhts via internet dhts refresh information within nodes set schedule unless told persist information time-delay entered user metadata controls long dhts allow information persist time period dhts reuse nodes making information decryption stored irretrievable long decryption key may reassembled dhts information retrievable however time initially entered user lapsed information recoverable user never informed decryption key vanish currently exists firefox plug-in allows user enter text either standard gmail email facebook message choose send message via vanish message encrypted sent via normal networking pathways cloud recipient recipient must firefox plug-in decrypt message plugin accesses bittorrent dhts 8-hour lifespans means user may select expiration date message increments 8 hours expiration user-defined time span information dht overwritten thereby eliminating key user recipient may copies original encrypted message key used turn back plain text gone although particular instance data become inaccessible important note information always saved means expiration copied even via screen shots published | [
3094
] | Test |
7,505 | 9 | AtScript:atscript atscript proposed javascript-based scripting language extending microsoft typescript transcompiling javascript introduced october 2014 ng-europe conference developers google angularjs web development framework language upcoming angular 2.0 would built atscript originally intended run top typescript including features dart october 2014 google announced angular 2.0 would written atscript march 2015 microsoft announced many atscript features would implemented typescript 1.5 release angular 2.0 would built pure typescript name “ atscript ” comes “ ” symbol used annotations many languages | [
5629,
2451,
4755,
4296,
5998,
4315,
1177,
562,
831,
313,
1016,
3719,
3559,
237,
2870,
6660,
6221,
340,
6400,
3584,
7687
] | Test |
7,506 | 4 | Finjan:finjan finjan holdings finjan publicly traded company nasdaq fnjn centers licensing intellectual property finjan claims patented technology used enterprise web security solutions finjan filed large number lawsuits leading software security companies asserting patents including cisco palo alto networks symantec blue coat systems sophos trend micro eset bitdefender check point qualys rapid7 fortinet others finjan named patent troll original hardware software divisions finjan acquired m86 security 2009 finjan continues hold patents various web security technologies licenses patents trustwave formerly m86 among others finjan commitment innovation security space continues investments culminated recent launch finjan consulting services business cyberisk development mobile applications consumer subsidiary finjan mobile incubation up-and-coming technology startups pioneering new generation security technologies company investment jerusalem venture partners jvp fund vii cyber labs invested alongside companies like cisco technology companies company headquartered east palo alto california finjan founded 1997 shlomo touboul serial entrepreneur founded first company shani computers 1985 sold intel 1994 worked intel starting finjan 1998 touboul decided bring experienced seasoned ceo would able develop grow company quickly left start venture capital fund 2001 company ran financial difficulties touboul asked board directors rejoin company ceo touboul realigned company strategy moving away developing software solutions combined hardware software security appliances additionally company moved channel sales model december 2002 finjan acquired assets alchemedia software developer drm product called clever content several drm patents alchemedia also ties israel founder daniel schreiber israeli though company technically headquartered dallas area 2005 following disagreements board touboul left started new company yoggie security systems october 2007 eric benhamou former ceo chairman 3com appointed chairman finjan also invested company venture capital fund benhamou global ventures november 2009 hardware software divisions finjan sold m86 security global computer security firm based orange california international headquarters london offices worldwide m86 subsequently acquired trustwave still use finjan technology patents licensing agreement finjan appliances sold trustwave secure web gateway june 2013 finjan became publicly traded company capitalized 30m installed new management team began focused program license company landmark intellectual property may 2014 finjan listed nasdaq capital market trading symbol fnjn continue trade today finjan initial shareholders included cisco microsoft bessemer venture partners benchmark capital harbourvest partners israel seed partners november 2008 company secured additional investment 22m brought total capital invested finjan since founding 67 million june 2013 finjan became publicly traded company capitalized 30m installed new management team began focused program license company landmark intellectual property may 2014 finjan listed nasdaq capital market trading symbol fnjn finjan claims invented concept proactive content security behavior-based content analysis technology claim shared others selected technology patents licensed microsoft july 2005 april 2009 finjan intellectual property portfolio included granted pending patents areas behavior-based security digital rights management finjan portfolio includes processes enable networks execute security plans counteract effects polymorphic code designed hide malware | [
2488,
91,
3170,
5482,
2209,
1328,
6305,
84,
7087,
8100,
6043,
88
] | Train |
7,507 | 3 | Re-order_buffer:re-order buffer re-order buffer rob used tomasulo algorithm out-of-order instruction execution allows instructions committed in-order normally three stages instructions issue execute write result tomasulo algorithm additional stage commit stage results instructions stored register memory write result stage results put re-order buffer contents buffer used executing instructions depending additional fields every entry buffer additional benefits re-order buffer include precise exceptions easy rollback control target address mispredictions branch jump rob works storing instructions original fetched order rob also accessed side since reservation station tomasulo algorithm additional parameter points instruction rob jump prediction correct nonrecoverable exception encountered instruction stream rob cleared instructions reservation stations re-initialized | [
5012,
5371,
3948,
14,
7527,
7529,
5737,
5042,
1481,
5055,
2226,
1867,
2248,
6148,
441,
4047,
5483,
5487,
6198,
1568,
1570,
7666,
515,
5521,
3747,
1237,
6236,
534,
7314,
1252,
4847,
4479,
895,
4864,
3458,
216,
4154,
5939,
4524,
5243,
629... | Test |
7,508 | 5 | Remote_Desktop_Protocol:remote desktop protocol remote desktop protocol rdp proprietary protocol developed microsoft provides user graphical interface connect another computer network connection user employs rdp client software purpose computer must run rdp server software clients exist versions microsoft windows including windows mobile linux unix macos ios android operating systems rdp servers built windows operating systems rdp server unix os x also exists default server listens tcp port 3389 udp port 3389 microsoft currently refers official rdp client software remote desktop connection formerly terminal services client protocol extension itu-t t.128 application sharing protocol every version microsoft windows windows xp onwards includes installed remote desktop connection rdc terminal services client mstsc.exe whose version determined operating system last applied windows service pack terminal services server supported official feature windows nt 4.0 terminal server edition windows 2000 server editions windows xp except windows xp home edition windows server 2003 windows home server windows fundamentals legacy pcs windows vista ultimate enterprise business editions windows server 2008 windows server 2008 r2 windows 7 professional microsoft provides client required connecting newer rdp versions downlevel operating systems since server improvements available downlevel features introduced newer rdp version work downlevel operating systems connecting higher version rdp server older operating systems using rdp server older operating system based itu-t t.128 application sharing protocol draft also known t.share t.120 recommendation series first version rdp named version 4.0 introduced microsoft terminal services part product windows nt 4.0 server terminal server edition terminal services edition nt 4.0 relied citrix multiwin technology previously provided part citrix winframe atop windows nt 3.51 order support multiple users login sessions simultaneously microsoft required citrix license multiwin technology microsoft order allowed continue offering terminal-services product named citrix metaframe atop windows nt 4.0 citrix-provided dlls included windows nt 4.0 terminal services edition still carry citrix copyright rather microsoft copyright later versions windows integrated necessary support directly t.128 application sharing technology acquired microsoft uk software developer data connection limited version introduced windows 2000 server added support number features including printing local printers aimed improve network bandwidth usage version introduced windows xp professional included support 24-bit color sound client available windows 2000 windows 9x windows nt 4.0 version name client changed terminal services client remote desktop connection heritage remains day however underlying executable still named mstsc.exe version introduced windows server 2003 included support console mode connections session directory local resource mapping also introduces transport layer security tls 1.0 server authentication encrypt terminal server communications version built windows xp professional x64 edition windows server 2003 x64 x86 editions version introduced windows vista incorporated support windows presentation foundation applications network level authentication multi-monitor spanning large desktop support tls 1.0 connections version 6.0 client available windows xp sp2 windows server 2003 sp1/sp2 x86 x64 editions windows xp professional x64 edition microsoft remote desktop connection client macintosh os x also available support intel powerpc mac os versions 10.4.9 greater server 2012 support rdc 6.0 later version released february 2008 included windows server 2008 well windows vista service pack 1 client included windows xp sp3 addition changes related remote administrator connects console version new functionality introduced windows server 2008 connecting remotely individual programs new client-side printer redirection system makes client print capabilities available applications running server without install print drivers server version released manufacturing july 2009 included windows server 2008 r2 well windows 7 release also changed terminal services remote desktop services version new functions windows media player redirection bidirectional audio multi-monitor support aero glass support enhanced bitmap acceleration easy print redirection language bar docking rdp 7.0 client available windows xp sp3 windows vista sp1/sp2 kb969084 rdp 6.1 client rdp 7.0 client supported windows server 2003 x86 windows server 2003 windows xp professional x64 editions rdp 7.0 also supported windows server 2008 rdp 7.0 clients also support connecting terminal servers running windows 2000 server rdp 7.0 features like aero glass remote use bidirectional audio windows media player redirection multiple monitor support remote desktop easy print available windows 7 enterprise ultimate editions release 7.1 rdp included windows 7 service pack 1 windows server 2008 r2 sp1 2010 introduced remotefx provides virtualized gpu support host-side encoding version released windows 8 windows server 2012 version new functions adaptive graphics progressive rendering related techniques automatic selection tcp udp transport protocol multi touch support directx 11 support vgpu usb redirection supported independently vgpu support etc connection quality button displayed rdp client connection bar rdp 8.0 connections clicking provides information connection including whether udp use rdp 8.0 client server components also available add-on windows 7 sp1 rdp 8.0 client also available windows server 2008 r2 sp1 server components add-on requires dtls protocol installed prerequisite installing updates rdp 8.0 protocol enabled windows 7 machines extra configuration step needed using group policy editor new feature rdp 8.0 limited support rdp session nesting works windows 8 server 2012 though windows 7 server 2008 r2 even rdp 8.0 update support feature shadow feature rdp 7 allowed administrator monitor snoop rdp connection removed rdp 8 aero glass remoting feature applicable windows 7 machines connecting also removed rdp 8 version released windows 8.1 windows server 2012 r2 rdp 8.1 client update exists windows 7 sp1 well unlike rdp 8.0 update windows 7 add rdp 8.1 server component windows 7 furthermore rdp 8.0 server function desired windows 7 kb 2592687 rdp 8.0 client server components update must installed installing rdp 8.1 update support session shadowing added back rdp version 8.1 version also fixes visual glitches microsoft office 2013 running remoteapp version 8.1 rdp also enables restricted admin mode logging mode requires knowledge hashed password rather plaintext therefore making pass hash attack possible microsoft released 82-page document explaining mitigate type attack version 10.0 rdp includes following new features autosize zoom useful hidpi clients addition graphics compression improvements included utilizing h.264/avc microsoft introduced following features release rdp 6.0 2006 release 7.1 rdp 2010 introduced following feature version 5.2 rdp default configuration vulnerable man-in-the-middle attack administrators enable transport layer encryption mitigate risk rdp sessions also susceptible in-memory credential harvesting used launch pass hash attacks march 2012 microsoft released update critical security vulnerability rdp vulnerability allowed windows computer compromised unauthenticated clients computer worms rdp client version 6.1 used reveal names pictures users rdp server matter windows version order pick one username specified rdp connection march 2018 microsoft released patch remote code execution vulnerability credssp security support provider involved microsoft remote desktop windows remote management discovered preempt may 2019 microsoft issued security patch bluekeep vulnerability allows possibility remote code execution microsoft warned wormable potential cause widespread disruption unusually patches also made available several versions windows reached end-of-life windows xp immediate malicious exploitation followed experts unanimous likely could cause widespread harm based number systems appeared remained exposed unpatched july 2019 microsoft issued security patch rdp vulnerability affects hyper-v numerous non-microsoft implementations rdp clients servers implement subsets microsoft functionality instance open-source command-line client rdesktop available linux/unix microsoft windows operating systems many gui clients like tsclient krdc built top rdesktop cord client macintosh 2009 rdesktop forked freerdp new project aiming modularizing code addressing various issues implementing new features freerdp comes command-line-client xfreerdp supports seamless windows rdp6 ’ also gtk-application named remmina open-source implementation remote desktop protocol server unix freerdp xrdp windows remote desktop connection client used connect server proprietary rdp client solutions rdpclient available stand-alone application embedded client hardware new access paradigm browser-based access enabled users access windows desktops applications rdp hosts microsoft remote desktop rds session hosts terminal services virtual desktops well remote physical pcs also so-called vrdp used virtualbox virtual machine implementation oracle protocol compatible rdp clients provided windows unlike original rdp configured accept unencrypted password unprotected connections may useful secure trusted networks home office lans default microsoft rdp server refuses connections user accounts empty passwords changed group policy editor external guest authorization options provided vrdp well matter operating system installed guest vrdp implemented virtual machine host level guest system proprietary virtualbox extension pack required microsoft requires third-party implementations license relevant rdp patents extent open-source clients meet requirement remains unknown security researchers reported cybercriminals selling compromised rdp servers underground forums well specialized illicit rdp shops compromised rdps may used staging ground conducting types fraud access sensitive personal corporate data researchers report instances cybercriminals using rdps directly drop malware computers | [
544,
4293,
4759,
2991,
5637,
5904,
1536,
3945,
1925,
2733,
6618,
4496,
7637,
5571,
1376,
3967,
578,
6731,
4333,
4880,
930,
7756,
5252,
7214,
6770,
2885,
5794,
3243,
3756,
3426
] | Test |
7,509 | 3 | Toshiba_T3100:toshiba t3100 t3100 laptop manufactured toshiba released 1986 featured hard drive 8 mhz intel 80286 cpu black orange 9.6 gas-plasma display resolution 640x400 pixels laptop time special high-resolution 640 x 400 display mode similar partially compatible olivetti/at 6300 graphics single proprietary expansion slot 1200 bit/s modem expansion chassis 5x 8-bit isa cards ethernet nic 2400 bit/s modem 1 mb memory card thus 3.6 mb max total base model 1mb memory could upgraded 5mb toshiba t3100 true portable needed external power source except last version five versions existed japan japanese version t3100 marketed j-3100 byte 1989 listed t3100/20 among distinction winners byte awards citing amazingly clear display hard drive | [
7172,
4408,
6380,
5571,
1237,
4200,
602
] | Test |
7,510 | 6 | Briefcase_(Microsoft_Windows):briefcase microsoft windows microsoft windows briefcase special folder supports simple two-way file synchronization another folder briefcase designed mobile pc users may transfer removable drive synchronize computer removable drive attached follows metaphor file file folder file management tasks performed windows explorer briefcase behaves like another folder i.e support copy-paste drag-and-drop additional functions toolbar buttons updating out-of-sync files windows briefcase introduced windows 95 windows briefcase synchronizes files folders within folder even removable writable media network intended users portable media multiple computers use briefcase users need use windows explorer drag copy files briefcase changes either files disk briefcase synchronized whenever user right-clicks briefcase selects update differences copies briefcase shows dialog box icon description indicating action take synchronizing whether replace copy briefcase external file vice versa action briefcase take configurable right clicking icon example users skip synchronizing individual items selecting skip action upon right clicking icon items deleted either briefcase main original folder briefcase create copy missing item users also sync individual items briefcase selecting item first clicking update button instead update update status item stored briefcase item link original item outside briefcase example drive containing briefcase inserted secondary computer original deleted main computer called orphan special folders windows briefcase folders hidden file system attribute called desktop.ini may also windows registry entries describing desktop.ini briefcase contains following lines second file called briefcase database bearing hidden system attributes filename extension serves briefcase index fourcc ddsh briefcase folder must read-only system file attributes default read-only order display briefcase desktop.ini briefcase database files required hidden system attributes order parent folder display briefcase user wishes sync file one another folder filename must exactly item renamed moved splits original longer synchronized becomes orphan item deleted associated copy default deleted well using update briefcase medium becomes full update space writing updated briefcase database effect making many folders files orphans easy way restore link counterparts source medium limitations others make briefcase files brittle easily corrupted limits robustness folder file backup mechanism | [
1710,
2361,
3626,
4759,
6844
] | Test |
7,511 | 2 | Accredited_Symbian_Developer:accredited symbian developer accredited symbian developer asd defunct accreditation program software developers using symbian os mobile phone operating system terminated april 2011 closure symbian foundation scheme operated independently foundation behalf majinate limited also closed business foundation closed primary qualification accredited asd pass on-line multiple choice examination adhered principles symbian os curriculum curriculum reviewed annual basis ensure accreditation kept date developments symbian operating system final release curriculum made 2009 although still adhered closely asd primer learning aid published wiley symbian press imprint final version curriculum contained following major topics topic assessed marked separately examination pass required high score coverage majority topics | [
5872,
2564,
5062,
5571,
6440,
3039,
5068,
1172,
1803
] | Validation |
7,512 | 2 | IBM_TopView:ibm topview topview first object-oriented multitasking windowing personal computer operating environment pc dos developed ibm announced august 1984 shipped march 1985 topview provided text-mode although also ran graphics mode operating environment allowed users run one application time pc ibm demonstrated early version product key customers making generally available around time shipped new pc computer microsoft announced windows 1.0 november 1983 international business machines ibm microsoft important partner popularizing ms-dos ibm pc notably announce support forthcoming window environment ibm determined microcomputer market needed multitasking environment released topview 1985 press speculated software start ibm plan increase control ibm pc even though nothing ibm pc proprietary including bios published world creating proprietary operating system similar ibm offered years larger computers topview also allowed ibm serve customers surprised new ibm come operating system able use hardware multitasking protected mode features new 80286 cpu dos applications still running 8086/8088 real mode even given topview virtual memory management capabilities hardware limitations still held new environment back—a base 256 kb ram room 80 kb application code data ram dos topview loaded 512-640 kb recommended load two typical application programs time maximum earlier ibm xt could installed loaded topview took back much memory consumed dos still enough satisfy industry critics topview ran real mode x86 processor could run well behaved dos programs i.e programs write directly screen used bios int 10h dos int 21h ibm assistant series productivity programs arrangement windows well behaved applications would use standard dos bios function calls access system services hardware misbehaving programs i.e programs write directly screen lotus 1-2-3 wordstar dbase iii would still run topview environment would consume entire screen object-oriented applications written using topview api topview updated make use virtual 8086 mode added intel 80386 processors allowed better virtualization initially compatibility extended features limited mainly ibm applications along third-party products like wordperfect volkswriter chicken-and-egg situation developed third-party developers reluctant add extended feature support block insert delete allow users cut/copy/paste applications see market demand dos programs however support functions allow user perform cut copy paste operations using topview pop-up menus believed ibm planned use topview force rely comply new technical specifications later versions topview released able successfully make challenging dos apps run multitasking fashion intercepting direct access system services hardware topview first introduced program information files pif files defined given dos program run multi-tasking environment notably avoid giving unnecessary resources could remain available programs topview pif files inherited extended quarterdeck desqview microsoft windows concept program information files also used digital research operating systems concurrent dos multiuser dos datapac system manager real/32 however using pifed command necessary program information got directly embedded .exe .com executable file version 1.1 introduced june 1986 added support ibm pc network ibm 3270 terminal emulation importantly support swapping non-resident programs added—onto hard disk computers high memory area machines equipped 286 cpu initially poor support dos batch files improved version 1.12 introduced april 1987 added support new ibm ps/2 series dos 3.30 operating system new ps/2 mice could also use four serial ports topview sold expectations start many potential users already satisfied cheaper less memory-intensive tsr task switchers like ready spotlight borland sidekick n't need multitasking environment topview ran graphics mode topview /g however rarely used mid-1987 ibm began shift focus away topview promoting use os/2 developers end users alike os/2 1.0 pre-emptive multitasking multithreading os allowed one real mode multiple 16-bit protected mode sessions run time pc/at based 80286 provided dos alternative announced april 1987 made available later december graphical user interface presentation manager added os/2 1.1 october 1988 1.1 could run without presentation manager well embedded system screen keyboard mouse interface required ibm officially stopped marketing final release topview version 1.12 3 july 1990 topview concept carried forward dos multitaskers notably quarterdeck desqview retained topview user interface many features plus added features support special features 80286 80386 compatible processors desqview/x released june 1992 true gui interface running dos variety similar programs topview also available including one dynamical systems called mondrian microsoft bought 1986 stated intention implementing topview api compatibility windows never happened later april 1992 ibm introduced os/2 2.0 included virtual 8086 mode full 32-bit support intel 80386 superseding even desqview similar environments os/2 2.0 priority based preemptive multitasking multithreading os including 32 levels priority time critical idle time 386 topview requires ibm pc dos versions 2.0 5.0 ms-dos 2.0 6.0 run later releases key contributors topview included david morrill father topview code-named orion glass project moved boca raton dennis mckinley tasking ross cook memory management bob hobbs topview toolkit neal whitten product manager bill gates steve ballmer gordon letwin key microsoft executives accepted invitation ibm executive estridge ibm boca raton see special demonstration topview gates disturbed windows multitasking windows used cooperative method share cpu windowing capabilities i.e overlapping windows etc topview gates witnessed topview running multiple copies microsoft basic interpreter running windows overlapping side-by-side multitasking fashion microsoft later released multitasking version ms-dos 4.0 multitasking learned meeting even though joint development agreement microsoft development topview estridge asked later told whitten whitten topview team wishes turn source code documentation topview microsoft within short time meeting estridge request granted gates gave code documentation group headed nathan myhrvold code modified according gates specifications purchased company product mondrian never released gates however gave members team key positions microsoft led joint development agreement microsoft agreement previously included dos co-develop os/2 agreement lasted 1990 done order satisfy usa vs. ibm anti-trust court case filed 1969 even though dismissed 1982 ibm mired antitrust troubles decade dismissal recover legal morass early mid-90s june 1990 ftc probe launched possible collusion microsoft ibm pc software market infoworld 1985 described topview bland plain vanilla software hogs far much memory byte also criticized topview memory usage stated find software written ibm pc topview-compatible noting low price innovative multitasking features magazine predicted software attract lot takers 1985 digital research positioned multitasking concurrent dos 4.1 gem alternative topview | [
4291,
4759,
3514,
4408,
5571,
5574,
1648,
6543,
7003,
3807,
1668,
6130,
858,
4088,
5784,
6586,
1237,
4277,
352,
5088,
2803
] | Test |
7,513 | 4 | Excellent_SME:excellent sme excellent sme international project aiming establish white list small medium enterprises sme means certification system project brings emphasis web site certification since internet becoming prevailing media promotion search business opportunities partners project built three pillars excellent sme certificate obtained companies meeting basic criteria certificate issued period 1 year however credit score permanent monitoring certificate revoked prematurely holder credit score drops 6 publishing certificate holder exposes good standing business successful practices publishing possible holder web site stationery promotional materials vehicles etc observer thus instantly establish level trust would otherwise require inquiries credit rating agencies consequence selection business partner becomes easier faster cheaper risk free growing number certified companies business environment becomes transparent good enterprises exposed visible client easier task finding partner project initiated 2012 slovenia partners chamber commerce industry slovenia credit rating agency technology provider connet d.o.o serbia joined project year 2013 macedonia romania followed 2014 bulgaria joined | [] | Train |
7,514 | 2 | PlayStation_4_system_software:playstation 4 system software playstation 4 system software updatable firmware operating system playstation 4 operating system orbis os based freebsd 9 native operating system playstation 4 orbis os fork freebsd version 9.0 released 12 january 2012 playstation 4 features two graphics apis low level api named gnm high level api named gnmx developers start gnmx wraps around gnm turn manages esoteric gpu details familiar way work developers used platforms like direct3d 11 another key area game programmable pixel shaders sony playstation shader language pssl introduced playstation 4 suggested playstation shader language similar hlsl standard directx 11 subtle differences could eliminated part preprocessor macros besides kernel related components components included worth mentioning cairo jquery lua mono openssl webkit pixman rendering library many open-source software although playstation 4 open console software development kit sdk based llvm clang sony chosen due conformant c c++ front-ends c++11 support compiler optimization diagnostics playstation 4 uses playstation dynamic menu graphical shell contrast xrossmediabar xmb used playstation portable playstation 3 well livearea used playstation vita playstation tv named dynamic menu options offers players context sensitive changing based player actually playstation 4 given time makes navigation simpler previous iteration dynamic menu alter little time possible users placing game disc drive actual gameplay beginning playstation 4 user interface attempts simplicity priority main place entertainment options content area prominently displayed large square icons horizontal line arranged recently used users scroll gamer newsfeed alternating brick-like formation reminiscent social media site pinterest many main objects display additional information cursor selected game may news updates advertisements downloadable content recently played games receive tiles along number mandatory items like live playstation internet browser applications content icon customization options sort would give players way mold display better suit needs augmented reality application playroom comes pre-installed playstation 4 console demonstrated e3 2013 utilizes sony playstation camera technology according sony fantastically fresh augmented reality entertainment experience created combining light bar located front dualshock 4 controller playstation camera players allowed produce small floating robot called asobi interacts players scans faces shoots fireballs playstation camera identifies player help light bar front flick touchpad dualshock 4 controller brings augmented reality bots function playroom creates illusion hundreds little bots inside controller released simply tap track pad functions like playstation vita ps4 owners view smartphone playstation vita drawing object flick anywhere augmented reality bots play remote play users operate ps4 uses playstation vita handheld game console allowing play ps4 games media small device via streaming games except exceptions require playstation move playstation camera compatible second screen used display unique content playing games support option confused split screen second screen may used show extra contents example maps alternate camera angles radar even playbooks sports games apart playstation vita mobile devices ipad android tablet also used second screen comes form official playstation app game companion apps knack quest heavy emphasis social features placed playstation 4 console loading ps4 number share-centric apps features new feature allows users check friends latest activities via landing page full pictures trophies recent events easy way find friends hand cross-chat feature dubbed party chat interesting way keep touch gives gamers ability chat users whether 're playing title ps4 sharing capabilities adds another layer console gaming ps4 owners able capture livestream gameplay simple button touch record 60 minutes latest gaming exploits quick press share button controller footage shared facebook twitter youtube also ability broadcast gameplay real time twitch ustream addition recording videos also social features community creation introduced via system updates favorite groups new section within friends app acts way quickly access people user plays feature aimed making easier faster get game session friends hand communities new hubs formed around shared interests like games activities play styles also exist smaller social features ps4 ability message friend request watch gameplay live playstation 4 console function without internet connection provide functionality connected internet example updates system software may downloaded internet users may play online internet properly connected online play main pillar playstation 4 playstation plus subscription required play majority ps4 titles online unlike playstation 3 titles according sony developing many new ways play connect ps4 requires large investment resources result sony claim keep service free maintain quality time considering cost thus decided would better charge fee order continue offer good service web browser included playstation 4 console based open source webkit layout engine unlike playstation 3 uses netfront browser using modern webkit core safari apple ps4 web browser receives high score html5 compliance testing however support adobe flash means websites require flash might display properly function intended also pdf format supported however one clear advantage gamers able cut gaming browsing back loss gameplay due multitasking feature web browser additionally ps4 web browser limited support usb keyboards seem support usb mice furthermore internet connection enabled playstation 4 allows users access variety playstation network psn services including playstation store playstation plus subscription service users may download buy games contents services also gamers able play selection ps3 titles via internet-based playstation gaming service playstation 4 supports playing 2d 3d blu-rays dvds. previously system software update required standard new consoles instead console needs go online activate player first time used system support audio cds internally year console launch sony partnered spotify bring music streaming service playstation 4 well predecessor february 2015 including ability stream music background game application plus ability control music playback via smartphone computers etc available free premium subscribers spotify sony later added blu-ray 3d support console via system update users also use media player application enjoy videos photos music saved usb storage devices media servers ps4 may serve good portable device video enjoyment addition game playing following multimedia file formats supported although according playstation support website ps4 could play mp4 videos support mp4 files encoded h.264/mpeg-4 avc high profile aac-lc playstation 4 backward compatible games previous playstation consoles launch though playstation 4 users play playstation 3 games directly 2014 playstation cloud-based streaming service allowed streaming selected ps3 games december 2015 sony added playstation 2 backward compatibility republished ps2 games dark cloud grand theft auto iii ps4 via playstation store americas europe supported ps2 games run via software emulation upscaled high definition ps4 systems instead remastered one updated access various ps4 features including trophies share play broadcasting remote play second-screen features however original ps2 game discs ps2 classics re-released ps3 compatible ps4 system arabic chinese simplified chinese traditional czech danish dutch english united kingdom english united states french canada french france finnish german greek hungarian indonesian italian japanese korean norwegian polish portuguese brazil portuguese portugal russian romanian spanish latin america spanish spain swedish thai turkish vietnamese initial version system software playstation 4 1.01 pre-installed original consoles support remote play second screen experiences added version 1.50 launched day playstation 4 console released north america november 15 2013 features accessible playstation vita console using ps4 link application second screen functionality also accessible smartphones tablets playstation mobile app also able record share video clips well broadcasting gameplay twitch.tv ustream supports blu-ray dvd-video playback version 1.60 released february 4 2014 improving dvd playback version 1.60 also adds support pulse elite wireless headsets version 1.70 released april 30 2014 adds number new features addition rich video editor called sharefactory offers users tools combine edit personalize captured video clips update also adds abilities share video clips screenshots streaming copy video clips screenshots usb storage version 1.75 released july 29 2014 adding support playback blu-ray 3d also improves sound quality 1.5-speed playback blu-ray dvd video version 1.76 released september 2 2014 came minor changes last update version 2.0 released october 28 2014 version 2.00 major upgrade playstation 4 system software among features introduced share play allows playstation plus users invite online friend join play session via streaming even copy game users pass control game entirely remote user partake cooperative multiplayer physically present version also adds youtube app ability upload video clips youtube users play music stored usb storage devices also support custom themes ability change background color users set themes home screens function screens user version version 2.50 released march 26 2015 adding suspend/resume feature allow players jump games ps button games suspended low-power rest mode instead closing completely version also allows console hard drive backed restored usb flash drive september 30 2015 sony released ps4 update 3.00 introduced entirely new features user-interface enhancements among new features ability share videos directly twitter dedicated playstation plus section tweaks interface streaming youtube improvements social features messages group creation ability save screenshots pngs increase online storage capacity 1 gb 10 gb also introduced playstation plus members sony states update create new ways connect friends players around world expanding social capabilities system even april 6 2016 sony released ps4 update 3.50 would enable ps4 use remote play functionality windows macos formerly named os x vg247 reported update allow remote play functionality computers running windows 8.1 windows 10 os x yosemite os x el capitan furthermore article explains remote play support resolution options 360p 540p 720p frame rate options 30 fps 60 fps one dualshock 4 controller connected via computer usb port september 13 2016 sony released ps4 update 4.00 added high dynamic range hdr home screen folder support 1080p streaming tweaks menus game info screens greater overview streamlined interfaces march 9 2017 sony released next major firmware update version 4.50 update includes support installing applications external hard drives custom wallpapers refined quick menu simplified notifications list custom status updates new 3d blu-ray support playstation vr includes support preloading game patches however developer make use first game take advantage feature littlebigplanet 3 october 3 2017 sony released ps4 update 5.00 overhauling master/sub-account system update allows customization accounts family members roles applying parental controls account groups system replaced new friends management system along support 5.1 7.1 surround sound configurations playstation vr new tournament bracket viewer made along tweaks broadcasting 1080p streaming 60 frames per second twitch possible changes ps message notifications quick menu lastly introduces localization czech greek hungarian indonesian romanian thai vietnamese languages 5.50 released march 8 2018 includes playtime restrictions child accounts ability hide applications library custom wallpapers via usb supersampling mode ps4 pro ability delete notifications september 13 2018 sony released ps4 update 6.00 major feature added ability use remote play ios devices minor improvements may 10 2019 sony interactive entertainment added ability remove purchased games download list playstation store delete games profile gaming platforms sony gaming platforms generation gaming platforms seventh generation | [
2177,
6794,
6085,
728,
738,
3636,
740,
746,
2583,
5760,
5065,
4718,
6477,
424,
6489,
4011,
6860,
5446,
443,
6158,
4748,
786,
6505,
450,
7962,
4761,
5116,
1547,
4408,
3368,
481,
1193,
4059,
8001,
6918,
4441,
6583,
3751,
875,
3081,
191,
... | Test |
7,515 | 9 | Tim_Teitelbaum:tim teitelbaum ray tim teitelbaum born april 12 1943 united states american computer scientist known early work integrated development environments ides syntax-directed editing incremental computation educator faculty member cornell university computer science department since 1973 recognized large-scale teaching introductory programming mentoring highly successful graduate students businessman known co-founded grammatech inc. sole ceo since 1988 teitelbaum educated massachusetts institute technology carnegie mellon university 1978 teitelbaum created cornell program synthesizer one seminal systems demonstrated power tightly integrating collection program development tools deeply knowledgeable programming language semantics one unified framework 45 lectures demonstrations early ide 1979-82 well credo 1981 paper co-authored thomas reps asserted programs text hierarchical compositions computational structures edited executed debugged environment consistently acknowledges reinforces viewpoint motivated importance immediate feedback interactive systems ides teitelbaum ’ research 1980s 1990s focused problem incremental computation given program p written language l result executing p input x one efficiently determine result running p input x ’ difference x x ’ small increment x ’ -x body work graduate students teitelbaum investigated problem range languages l included attribute grammars sql first-order functional languages lambda calculus addition incremental evaluation methods work also included program transformation methods i.e. automatic derivation p incremental program p ’ executing p ’ previous result p x increment x ’ -x auxiliary information retained previous executions efficiently performs computation executing p input x ’ teitelbaum recent work aimed design implementation tools assist making software safer secure techniques include static program analysis dynamic program analysis source code machine code teitelbaum co-recipient association computing machinery sigsoft retrospective impact paper award 2010 1984 paper co-authored thomas reps synthesizer generator | [
5326,
3499,
1243,
5190
] | Test |
7,516 | 9 | Dymola:dymola dymola commercial modeling simulation environment based open modelica modeling language large complex systems composed component models mathematical equations describe dynamic behavior system developed european company dassault systèmes dymola available standalone product integrated 3dexperience part catia dymola 2020 supports version 3.4 modelica language version 3.2.3 modelica standard library well versions 1.0 2.0 functional mock-up interface fmi dymola initially designed 1978 hilding elmqvist phd thesis lund institute technology later part lund university first version dymola based dynamic modeling language also called dymola implemented simula 67 later re-implemented pascal c++ 1992 elmqvist created swedish company dynasim ab continue development dymola 2006 dassault systèmes acquired dynasim ab started integrate dymola catia 1996 elmqvist initiated modelica design effort goal develop object-oriented language modeling technical systems reuse exchange dynamic system models standardized format modelica based dymola language experience modeling languages taken account september 1997 version 1.0 modelica specification released basis prototype implementation within dymola year 2000 non-profit modelica association formed manage continually evolving modelica language development free modelica standard library since 2002 modelica language supported dymola dymola multi-engineering capabilities mean models consist components many engineering domains using modelica language sub-systems represented interconnected components lowest level dynamic behavior described mathematical equations algorithms connections components form additional equations dymola processes complete system equations order generate efficient simulation code domain-specific knowledge represented modelica libraries containing components mechanical electrical control thermal pneumatic hydraulic power train thermodynamics vehicle dynamics air conditioning etc commercial libraries dymola supports information hiding encryption typical application areas facilitated modelica libraries include automotive applications fall three main categories engine drive train modeled using engines powertrain libraries flexibility open modelica language particularly suitable modeling hybrid alternative drive trains using battery brushless dc drives electrified powertrains libraries modal bodies flexible shafts available flexible bodies library engine battery cooling supported cooling library combined hvac library human comfort library adds models occupant comfort complete vehicle thermal modeling controller components available modelica standard library hierarchically structured open-source modelica models offer unprecedented flexibility multiple vehicle configurations reusing common components multitude libraries offer capacity model complex thermo-fluid systems aircraft ranging fuel systems environmental control human comfort library provides additional models occupant comfort cabin thermal modeling flight dynamics library enables rapid modeling simulation analysis flight dynamic characteristics wide range aircraft uavs actuators flight control subsystems use brushless dc drives electrified powertrains libraries flexible beams modal bodies finite element models managed flexible bodies library ever stringent requirements environmental impact drive trend towards detailed modeling physics control systems heat ventilation air conditioning hvac library allows minimize building hvac operating costs selecting correct system control strategy avoid costly hvac system design errors early building design process human comfort library provides integrated approach simulate thermal comfort within occupied building vehicle thermo-fluid system typically modeled thermalsystem library industrial process simulation library focused paper pulp industries kinds industrial equipment modeled using mechanical libraries modelica standard library including 3d multi-body systems options flexible beams modal bodies originating finite element model actuators control systems modeled battery brushless dc drives electrified powertrains libraries thermal properties industrial machinery easily modeled cooling library addition libraries available dymola product portfolio several libraries developed third parties claytex modelon ab tlk-thermo xrg simulation additional free commercial libraries available modelica association homepage model calibration option based process measured data real device used tune parameters simulation results good agreement measured data design optimization option used tune parameters device controller improve system dynamics multiple criteria multiple cases model management includes support encryption models version control dymola utilities checking testing comparing models also included support common version management tools cvs svn git steps system development dimensioning detailed design implementation important access c code image model run hardware loop rapid prototyping simulations build simulators validation training purposes several options available achieve activities dymola supports import export according functional mockup interface fmi appropriate options exported code generated export without run-time license source code exported functional mockup units used several simulation platforms | [
6527,
1155,
3148,
7382,
5948,
3463,
4759,
2524,
5571,
352,
578,
1336
] | Test |
7,517 | 2 | Bundle_(macOS):bundle macos nextstep openstep gnustep lineal descendants macos ios bundle file directory defined structure file extension allowing related files grouped together conceptually single item examples bundles contain executable code include applications frameworks plugins kind bundle usually contains one file representing executable code files represent resources nibs templates images sounds media systems microsoft windows resources usually included directly executable file compile time older macintoshes similar technique used additional metadata added file resource fork similar concept application directories used risc os rox desktop examples bundles contain executable code include document packages iwork documents media libraries iphoto library bundles programmatically accessed codice_1 class cocoa nextstep gnustep foundation frameworks codice_2 core foundation uniform type identifier uti apple bundle codice_3 application bundles directory hierarchies top-level directory name ends codice_4 extension application bundle first directory bundle underneath top-level directory usually named codice_5 within codice_5 usually another directory called codice_7 macs using application name gnustep contains application executable code within codice_5 folder usually also directory called codice_9 contains resources application among things codice_9 folder contains localized versions application nib files common subdirectories include codice_11 codice_12 codice_13 codice_12 directory contains frameworks used application used even another version framework exists system codice_13 directory contains frameworks used application contains applications used newer version exist elsewhere system codice_11 contains extensible code used application default finder displays application bundles also referred packages opaque files underlying structure contents bundle shown show package contents context menu item macos frameworks also stored bundles top-level directory framework bundle name name framework followed extension codice_17 top-level directory codice_18 directory subdirectories one versions framework subdirectory containing dynamic library code framework file whose name name framework possibly codice_19 folder containing header files framework subfolders codice_9 codice_18 directory also contains symbolic link codice_22 directory current version framework top-level directory symbolic links contents codice_23 finder displays framework bundles directories rather opaque files loadable bundles bundles contain code loaded runtime loadable bundles usually extension codice_24 often used plug-ins macos way load bundles even applications n't support allowing third party hacks popular applications safari apple mail default finder displays loadable bundles also referred packages opaque files underlying structure contents bundle shown show package contents context menu item many third-party macos applications utilize custom bundle format e.g candybar codice_25 aperture codice_26 vmware fusion codice_27 etc. .lproj file bundle contains localization files macos software typically contains .nib files given language along string files images need example readme license files localized files used install makers customize install packages also included application bundle | [
7096,
7259,
2609,
6295,
4759,
2679,
5786,
5787,
2749,
6582,
1989,
5191
] | Validation |
7,518 | 4 | Centre_for_Cybersecurity_&_Cybercrime_Investigation:centre cybersecurity amp cybercrime investigation university college dublin centre cybersecurity cybercrime investigation ucd cci centre research education cybersecurity cybercrime digital forensic science dublin ireland ucd centre cybersecurity cybercrime investigation established early 2000s developed collaborative relationships law enforcement industry across world centre cybersecurity cybercrime investigation widely regarded europe leading centre research education cybersecurity cybercrime digital forensics ucd cci trains specialist officers irish national police service garda síochána irish military personnel defence forces well international law enforcement agencies interpol europol authorities 40 countries cci also runs educational qualifications training industry sector multinational corporations memorandum understanding centre cybersecurity cybercrime investigation ucd national cyber security centre ncsc dccae irish government computer emergency response team ucd cci network formal relationships garda síochána irish defence forces interpol europol visa inc. irish banking federation well collaborations united nations office drugs crime unodc organization security co-operation europe osce european anti-fraud office olaf microsoft citibank ebay director ucd centre cybersecurity cybercrime investigation professor joe carthy bsc. phd | [
7754,
1805
] | Validation |
7,519 | 3 | WDC_65C134:wdc 65c134 western design center wdc w65c134s microcontroller complete fully static 8-bit computer fabricated single chip using low power cmos process w65c134s complements established growing line 65xx products wide range microcomputer applications w65c134s developed hi-rel applications minimum power required w65c134s consists w65c02s static central processing unit cpu 4096 bytes read memory rom 192 bytes random access memory ram two 16 bit timers low power serial interface bus sib configured token passing local area network universal asynchronous receiver transmitter uart baud rate timer one 16-bit monitor watch-dog timer restart interrupt twenty-two priority encoded interrupts ice interface real-time clock features including time day tod clock bus control register bcr external memory bus control interface circuitry peripheral devices many low power features innovative architecture demonstrated high performance w65c02s cpu well instruction simplicity result system cost-effectiveness wide range computational power features make w65c134s leading candidate hi-rel microcomputer applications product description assumes reader familiar w65c02s cpu hardware programming capabilities refer w65c02s data sheet additional information | [
7960,
4846,
804,
5208,
468,
7531,
3365,
5296,
6720,
7730,
1556,
7905,
7654,
6919,
2237,
4532,
6753,
7668,
7222,
1237,
3918,
5087
] | Train |
7,520 | 3 | Palmtop_PC:palmtop pc palmtop pc approximately pocket calculator-sized battery-powered computer compatible ibm personal computer horizontal clamshell design integrated keyboard display could used like subnotebook light enough comfortably used handheld well palmtop pcs small enough stored user shirt jacket pocket palmtop pcs distinguish palmtop computers using mostly ibm-compatible pc architecture bios well intel-compatible x86 processor devices dos-based dos stored rom many palmtop pcs came number pda office applications pre-installed rom could also run generic off-the-shelf pc software little modifications could also run operating systems geos windows 1.0-3.0 real mode minix 2.0 palmtop pcs based static hardware design low power consumption instant-on/off without need reboot depending model battery could power device several hours several days running week year standby mode combined instant-on/off feature battery would typically last week several months practical use pda first palmtop pc dip pocket pc aka atari portfolio 1989 palmtop pcs include touch-screen computers may also counted category clamshell design now-discontinued ultra-mobile pcs umpc seen successors class example | [
1023,
5060,
6380,
7132,
2498,
352,
4277,
4627,
740
] | Test |
7,521 | 2 | Nokia_N86_8MP:nokia n86 8mp nokia n86 8mp high-end smartphone announced 17 february 2009 released may 2009 runs symbian os 9.3 s60 3rd edition fp2 part nseries shares similar design features n97 one main selling points carl zeiss photography features nokia first camera phone 8 megapixel sensor although late compared manufacturers features multiple aperture settings mechanical shutter uncommon features standards camera phones carl zeiss lens wide angle view 28 mm equivalent also auto focus dual led flash 3rd generation dual-leds af assist light video capture resolution 640 × 480 pixels vga 30 frames per second n86 continuous form factor nokia n95 n85 dual-sliding form factor whilst adding toughened glass front cover metal detailing keypad making look feel premium 2.6-inch amoled display fast 434 mhz processor 8 gb internal memory also kickback stand n85 possible use small standalone screen possible configure opening stand launch applications video player also supports n-gage gaming platform n86 8mp regarded spiritual successor n95 8gb due feature set sliding form factor commercial failure n96 regard successor n82 due camera n86 8mp 3.5g 3.75g 3gpp device dual-band hsdpa support quad-band gsm wi-fi a-gps receiver links location-based services via nokia maps photographs automatically geo-tagged also built-in digital compass fm radio also fm transmitter rated give 6 hours talktime 25 hours music playback 11 days standby full charge optional dvb-h nokia mobile tv receiver su-33w possible watch television screen phone ovi maps 3.03 free navigation released 17 march 2010 nokia n86 new version available via sw update application file size 8.24 mb n86 e72 e55 e52 6730 6710 s60 3rd edition feature pack 2 nokia symbian^1 s60 5th edition devices get experience beta-testing free navigation 6 july 2009 nokia n86 8mp received big firmware upgrade v11.043 brought official ovi store compatibility ovi web site shortcut option download dedicated client camera tweaks usual early firmware bug fixes improvements 30 september 2009 nokia n86 8mp received v20 firmware upgrade full week ahead schedule 8 mb large air ota update significant changes improved still image video quality close-up focus face detection indicated yellow square red-eye removal added new focus point indication shows scene camera focusing 11 january 2010 nokia n86 8mp got minor update v21 firmware version 21.006 replaced v20.115 maintenance release improving performance fixing number minor bugs 15 april 2010 version 30.009 firmware mainly features latest ovi maps client available via nokia software update 142 mb air 5085 kb includes latest ovi maps 3.03 free navigation sharing location via facebook realplayer interface tweaked d-pad problem playing videos usual minor fixes improvements 20 may 2010 includes latest ovi maps 3.04 new version adds formal support wifi positioning method part overhaul positioning functionality plus significant performance improvements search zooming map panning number consumer-friendly ui tweaks addition qype information places database nokia n87 successor n86 leaked internet full specifications december 2009 early 2010 however never released instead touchscreen nokia n8 introduced november 2010 prototype n87 appeared ebay shows running probably symbian^3 listing removed time seller nokia would never release another high-end non-touchscreen device n86 8mp | [
1066,
5979,
2271,
6517,
372,
1724,
3615,
1453,
4935,
3694,
3524,
3952,
472,
5909,
8072,
2922,
4407,
118,
23,
2564,
3703,
7261,
6440,
7545,
5044,
5493,
740,
1202,
5315,
3029,
5499,
7012,
139,
6465,
5062,
3039,
3653,
1582,
4894,
5068,
597... | Validation |
7,522 | 4 | Forcepoint:forcepoint forcepoint previously known websense raytheon|websense austin-based company owned u.s. defense contractor raytheon private equity firm vista equity partners develops markets cybersecurity software prevent employees viewing inappropriate malicious content leaking confidential data also sells firewall cloud access cross-domain security products forcepoint founded 1994 reseller called netpartners renamed websense 1999 went public following year vista equity partners acquired websense 2013 906 million taking public market raytheon acquired 80 interest websense april 2015 1.9 billion afterwards websense acquired network security vendor stonesoft intel renamed combined company forcepoint websense founded 1994 phil trubey dot-com boom name netpartners company began reseller network security products developed software controlling internet use employees 1998 netpartners raised 6 million venture capital funding 6 million annual revenue later year investors pushed trubey ceo position appointed john carrington replacement 1999 netpartners renamed websense following year websense raised 65.7 million initial public offering 2006 former mcafee ceo gene hodges succeeded carrington websense ceo year websense acquired fingerprint security company called portauthority 90 million followed 400 million acquisition email security vendor surfcontrol 2007 2009 websense acquired defensio spam malware company focused social media undisclosed sum 2009 websense 1,400 employees offices england china australia israel two years later facebook deployed websense check every link users shared site 2013 websense became private company vista equity partners acquired 906 million websense headquarters moved san diego year austin texas 2014 raytheon acquired 80 interest websense april 2015 1.9 billion followed 389 million purchase two companies stonesoft sidewinder october 2015 intel stonesoft network security product previously known mcafee next-generation firewall sidewinder firewall previously known mcafee firewall enterprise january 2016 three companies combined rebranded forcepoint new company also included raytheon cyber products business time forcepoint 2,000 employees one-third customers departments federal government united states forcepoint became smallest five major businesses owned raytheon highest profit margins following year forcepoint began shuffling executives re-organization effort included layoffs company divided four business units cloud security network security data insider threat security global governments february 2017 forcepoint announced acquisition cloud-based access broker casb security product imperva called skyfence undisclosed sum april 2016 matthew moynahan appointed ceo forcepoint august 2017 forcepoint acquired user entity behavior analytics company redowl undisclosed amount company products used block certain websites portions website inspect network traffic filter e-mails control sensitive files accessed forcepoint products also used prevent employees accessing websites deemed inappropriate workplace viewing employer example employers may prevent employees viewing pornographic content work material sex education religion dating politics forcepoint also develops markets firewall products based part technology acquired mcafee former stonesoft business intel security sidewinder product. ref name= http //www.channelweb.co.uk 2017 /ref company develops markets cloud access security broker casb products using technology acquired previously imperva skyfence product also sells analytics software detect insider data leaks several cross domain security products using forcepoint products employees internet browsers usually modified direct traffic proxy server server hosts local copies frequently-visited websites order improve download speed software also checks every url employee visits databases websites identified malware prohibited subject-matter employee url history analyzed identify risky behaviors 1997 three years forcepoint founded company published version 3 software version 3.0 introduced software first graphical web-based administrative user interface time forcepoint software used prevent employees viewing certain types content work 2006 features added detect employees attempting visit websites suspected hosting malicious code 2007 websense introduced product control content user see social media websites endpoint security product website reputation ranker small business version additionally product added websense suite identifies sensitive files un-secure locations corporate network looks records files transmitted websense introduced first appliance product 2009 following year products consolidated triton software became responsible increasingly large portions company revenue february 2012 forcepoint released cloud-based suite security products smartphones tablets laptops usb drives mobile devices upgrades suite 2012 added ability identify confidential information image file three new products revisions introduced 2016 focused security risks caused employees forcepoint policy selling governments isps engage internet censorship however criticized perceived link censorship free speech dissemination knowledge 2009 discovered yemeni government using forcepoint products monitor public internet use block tools allow citizens hide internet use government software alkasir created circumvent forcepoint responded cutting country access forcepoint database updates 2011 forcepoint said would join global network initiative focused privacy internet freedom left initiative 2014 2002 study jama found forcepoint best-performing web-filtering products terms blocking pornography allowing health information contrast 2005 report rhode island branch american civil liberties union said forcepoint blunt instrument public libraries equipped forcepoint people ages still denied access wide range legitimate material 2006 report brennan center justice found forcepoint often blocked websites discussed pornography actually feature pornography forcepoint software also blocked furniture website called the-strippers.com pornographic instead website furniture refinisher author study 0-15 percent sites blocked forcepoint viewable user 10 percent objectionable websites let rather blocked according blogger jillian york forcepoint blocks pages contain pornographic links anywhere content even comments section said malicious attacker could get whole site blocked time simple procedure leaving dangerous malicious pornographic links blog comments approximately 15 minutes 2009 forcepoint classified router company cisco website 'hack sites due one cisco ip addresses named hacking website ip address reviewed deemed threat | [
2488,
7762,
1395,
2746,
8010,
6868,
6842,
2805,
7344,
3426
] | Test |
7,523 | 4 | AssureSign:assuresign assuresign electronic signature software solution deployed software service saas application installed customer premises documents signed using computer internet connection assuresign electronic signature technology first use patent-pending biometric handwritten mouse-based signatures assuresign documentnow documenttrak api tools enable users integrate existing environments assuresign maintains partner program includes integration partners resellers available via microsoft dynamics marketplace salesforce.com appexchange assuresign also integrated third party applications including microsoft sharepoint oracle duck creek technologies insurance applications assuresign electronic signature technology developed 2006 offering third party verification inc. 3pv assuresign llc formed separate company 2008 david brinkman dale combs assuresign 3pv consistently ranked orlando sentinel top 100 companies working families | [
7037,
330,
7120
] | Test |
7,524 | 4 | Anatoly_Kucherena:anatoly kucherena anatoly grigorievich kucherena born 23 august 1960 russian attorney public figure doctor law professor mid-2013 kucherena represented former nsa contractor edward snowden interests russian federation kucherena continues represent snowden pro bono occasional basis 2013 according izvestia known person spoke favour banning anonymizer software advocating prosecution development distribution usage including malware software category view contradicts terminology used industry june 2014 american film director oliver stone acquired rights screen adaptation kucherena novel time octopus story fictional american whistleblower joshua kold threatened government waiting decision request russian asylum cold spends three weeks transit area moscow airport stone said anatoly written 'grand inquisitor'-style russian novel weighing soul fictional whistleblower gravity 1984 tyranny achieved global proportions book first psychological-political thriller trilogy released 3 march 2015 russian 29 january 2017 english moscow times reported kucherena said snowden received copy book liked april 2015 wikileaks revealed oliver stone paid 1 million movie rights kucherena novel different times kucherena also represented | [
2093
] | Test |
7,525 | 4 | Cooperative_Cyber_Defence_Centre_of_Excellence:cooperative cyber defence centre excellence nato ccd coe officially nato cooperative cyber defence centre excellence nato küberkaitsekoostöö keskus one nato centres excellence located tallinn estonia centre established 14 may 2008 received full accreditation nato attained status international military organisation 28 october 2008 nato cooperative cyber defence centre excellence international military organisation mission enhance capability cooperation information sharing among nato member nations partners cyber defence virtue education research development lessons learned consultation 2003 prior country official accession nato estonia proposed creation centre excellence 2006 riga summit listed possible cyber attacks among asymmetric threats common security acknowledged need programs protect information systems long term cyber attacks estonia 2007 highlighted first time potential vulnerability nato countries institutions societies even nato disruption penetration information communications systems estonia proposals nato cyber excellence center received strong support alliance secretary-general jaap de hoop scheffer nato completed assessment situation partly light estonia experience april 2007 approved nato policy cyber defence january 2008 nato summit communiqué bucharest april announced nato readiness provide capability assist allied nations upon request counter cyber attack august 30 2018 colonel jaak tarien replaced merle maigre director organisation cyber defence center tallinn one 21 accredited centres excellence coes training technically sophisticated aspects nato operations funded nationally multi-nationally centers closely linked allied command transformation promote alliance-approved transformation goals main agenda facility centre also responsibilities include currently 22 sponsoring nations joined centre addition centre three contributing participants nato ccd coe founding nations estonia germany italy latvia lithuania slovakia spain hungary poland united states netherlands joined following years 2014 france united kingdom czech republic austria first non-nato country joined centre november 2015 finland greece turkey joined june 2019 bulgaria denmark norway romania joined membership nato ccd coe open nato nations nato ccd coe also establish cooperative relations non-nato nations universities research institutions businesses contributing participants | [
6756
] | Validation |
7,526 | 9 | Big_ball_of_mud:big ball mud big ball mud software system lacks perceivable architecture although undesirable software engineering point view systems common practice due business pressures developer turnover code entropy type design anti-pattern term popularized brian foote joseph yoder 1997 paper name defines term foote yoder credited brian marick originator 'big ball mud term sort architecture programmers control big ball mud project strongly encouraged study understand accomplishes use loose basis formal set requirements well-designed system could replace technology shifts client-server web-based file-based database-based may provide good reasons start scratch discussion lisp programming language term big ball mud used differently case describe malleability lisp system lisp generally possible result confluence features lisp extraordinarily flexible even extent language implementation may completely rewritten runtime i.e reflective metaprogramming result lisp systems becoming muddy time due fluidity ease may extended evolve simple use metalinguistic abstraction prominent characteristic lisp also allows programmers develop entirely new idiosyncratic conceptual vocabularies describe processes functions programs go tackling problem domain combined poor software documentation result lisp systems work quite well indeed quite well-structured design perspective comprehensible original coders anyone else willing invest time sift layers highly recursive code joel moses credited coining phrase 1970s apl like beautiful diamond – flawless beautifully symmetrical ca n't add anything try glue another diamond n't get bigger diamond lisp like ball mud add still ball mud – still looks like lisp moses strongly denies claiming instead called lisp bean bag always returns original shape | [
1774,
7123,
4543,
5022
] | Validation |
7,527 | 3 | Tomasulo_algorithm:tomasulo algorithm tomasulo ’ algorithm computer architecture hardware algorithm dynamic scheduling instructions allows out-of-order execution enables efficient use multiple execution units developed robert tomasulo ibm 1967 first implemented ibm system/360 model 91 ’ floating point unit major innovations tomasulo ’ algorithm include register renaming hardware reservation stations execution units common data bus cdb computed values broadcast reservation stations may need developments allow improved parallel execution instructions would otherwise stall use scoreboarding earlier algorithms robert tomasulo received eckert–mauchly award 1997 work algorithm following concepts necessary implementation tomasulo algorithm common data bus cdb connects reservation stations directly functional units according tomasulo preserves precedence encouraging concurrency two important effects instructions issued sequentially effects sequence instructions exceptions raised instructions occur order would in-order processor regardless fact executed out-of-order i.e non-sequentially tomasulo algorithm uses register renaming correctly perform out-of-order execution general-purpose reservation station registers hold either real value placeholder value real value unavailable destination register issue stage placeholder value initially used placeholder value tag indicating reservation station produce real value unit finishes broadcasts result cdb placeholder replaced real value functional unit single reservation station reservation stations hold information needed execute single instruction including operation operands functional unit begins processing free source operands needed instruction real practically speaking may exceptions enough status information exception available case processor may raise special exception called imprecise exception imprecise exceptions occur non-oooe implementations processor state changed program order see risc pipeline exceptions programs experience precise exceptions specific instruction took exception determined restart re-execute point exception however experience imprecise exceptions generally restart re-execute system determine specific instruction took exception three stages listed stages instruction passes time issued time execution complete issue stage instructions issued execution operands reservation stations ready else stalled registers renamed step eliminating war waw hazards execute stage instruction operations carried instructions delayed step operands available eliminating raw hazards program correctness maintained effective address calculation prevent hazards memory write result stage alu operations results written back registers store operations written back memory concepts reservation stations register renaming common data bus tomasulo algorithm presents significant advancements design high-performance computers reservation stations take responsibility waiting operands presence data dependencies inconsistencies varying storage access time circuit speeds thus freeing functional units improvement overcomes long floating point delays memory accesses particular algorithm tolerant cache misses additionally programmers freed implementing optimized code result common data bus reservation station working together preserve dependencies well encouraging concurrency tracking operands instructions reservation stations register renaming hardware algorithm minimizes read-after-write raw eliminates write-after-write waw write-after-read war computer architecture hazards improves performance reducing wasted time would otherwise required stalls equally important improvement algorithm design limited specific pipeline structure improvement allows algorithm widely adopted multiple-issue processors additionally algorithm easily extended enable branch speculation tomasulo algorithm outside ibm unused several years implementation system/360 model 91 architecture however saw vast increase usage 1990s 3 reasons many modern processors implement dynamic scheduling schemes derivative tomasulo ’ original algorithm including popular intel x86-64 chips | [
5012,
5371,
3948,
7529,
5737,
5042,
1481,
5055,
2226,
1867,
2248,
6148,
441,
4047,
5483,
5487,
6198,
1568,
1570,
6922,
7666,
515,
5521,
3747,
1237,
6236,
534,
7314,
1252,
4847,
4479,
895,
4864,
216,
4154,
5939,
4524,
5243,
6299,
8117,
5... | Train |
7,528 | 2 | List_of_Linux_adopters:list linux adopters linux adopters organizations individuals moved operating systems linux local governments come pressure institutions world trade organization international intellectual property alliance turned linux free software affordable legal alternative pirated software expensive proprietary computer products microsoft apple commercial companies spread linux affords leverage countries companies developed world bid government contracts since low-cost option exists furnishing alternative path development countries like india pakistan many citizens skilled computer applications afford technological investment first world prices cost factor one considered though – many governmental institutions public military sectors north america european union make transition linux due superior stability openness source code turn leverages information security linux often used technical disciplines universities research centres due several factors including linux available free charge includes large body free/open-source software extent technical competence computer science software engineering academics also contributor stability maintainability upgradability ibm ran advertising campaign entitled linux education featuring young boy supposed linux examples large scale adoption linux education include following linux used extensively servers businesses long time linux also used corporate environments desktop platform employees commercially available solutions including red hat enterprise linux suse linux enterprise desktop ubuntu | [
1807,
3256,
2182,
3938,
3613,
6422,
6086,
3271,
7532,
2559,
1100,
5744,
6443,
2942,
7555,
6117,
4341,
5762,
412,
415,
3996,
2240,
2601,
3666,
2970,
6865,
7956,
5453,
5803,
5460,
7242,
462,
1535,
1924,
6892,
4400,
1176,
1933,
5829,
3384,
... | Test |
7,529 | 3 | Hazard_(computer_architecture):hazard computer architecture domain central processing unit cpu design hazards problems instruction pipeline cpu microarchitectures next instruction execute following clock cycle potentially lead incorrect computation results three common types hazards data hazards structural hazards control hazards branching hazards several methods used deal hazards including pipeline stalls/pipeline bubbling operand forwarding case out-of-order execution scoreboarding method tomasulo algorithm instructions pipelined processor performed several stages given time several instructions processed various stages pipeline fetch execute many different instruction pipeline microarchitectures instructions may executed out-of-order hazard occurs two simultaneous possibly order instructions conflict data hazards occur instructions exhibit data dependence modify data different stages pipeline ignoring potential data hazards result race conditions also termed race hazards three situations data hazard occur consider two instructions occurring program order read write raw data hazard refers situation instruction refers result yet calculated retrieved occur even though instruction executed prior instruction prior instruction processed partly pipeline example first instruction calculating value saved register second going use value compute result register however pipeline operands fetched 2nd operation results first yet saved hence data dependency occurs data dependency occurs instruction dependent completion instruction write read war data hazard represents problem concurrent execution example situation chance may finish i.e. concurrent execution must ensured result register stored chance fetch operands write write waw data hazard may occur concurrent execution environment example write back wb must delayed finishes executing structural hazard occurs part processor hardware needed two instructions time canonical example single memory unit accessed fetch stage instruction retrieved memory memory stage data written and/or read memory often resolved separating component orthogonal units separate caches bubbling pipeline detected using hazard control unit branching hazards also termed control hazards occur branches many instruction pipeline microarchitectures processor know outcome branch needs insert new instruction pipeline normally fetch stage bubbling pipeline also termed pipeline break pipeline stall method preclude data structural branch hazards instructions fetched control logic determines whether hazard could/will occur true control logic inserts pipeline thus next instruction would cause hazard executes prior one sufficient time finish prevent hazard number equals number stages pipeline processor cleared instructions proceed free hazards forms stalling introduce delay processor resume execution flushing pipeline occurs branch instruction jumps new memory location invalidating prior stages pipeline prior stages cleared allowing pipeline continue new instruction indicated branch several main solutions algorithms used resolve data hazards case out-of-order execution algorithm used task removing data dependencies delegated compiler fill appropriate number instructions dependent instructions ensure correct operation re-order instructions possible example write value 3 register 1 already contains 6 add 7 register 1 store result register 2 i.e following execution register 2 contain value 10 however i1 write 3 register 1 fully exit pipeline i2 starts executing means r1 contain value 3 i2 performs addition event i2 adds 7 old value register 1 6 register 2 contains 13 instead i.e error occurs i2 reads register 1 i1 committed/stored result write operation register 1 i2 reading contents register 1 register 1 still contains 6 3 forwarding described helps correct errors depending fact output i1 3 used subsequent instructions value 3 committed to/stored register 1 forwarding applied example means wait commit/store output i1 register 1 example output 3 making output available subsequent instruction case i2 effect i2 uses correct recent value register 1 commit/store made immediately pipelined forwarding enabled instruction decode/execution id/ex stage pipeline two inputs value read register specified example value 6 register 1 new value register 1 example value 3 sent next stage instruction execute/memory access ex/mem added control logic used determine input use avoid control hazards microarchitectures event branch causes pipeline bubble incorrect instructions entered pipeline care must taken prevent wrongly-loaded instructions effect processor state excluding energy wasted processing discovered loaded incorrectly memory latency another factor designers must attend delay could reduce performance different types memory different accessing time memory thus choosing suitable type memory designers improve performance pipelined data path | [
5012,
1447,
5371,
3948,
7527,
7533,
5737,
4318,
7541,
2567,
4694,
5042,
1481,
5055,
2226,
1867,
2248,
6148,
441,
2266,
4047,
5483,
1556,
5487,
6198,
1568,
1570,
6922,
7666,
515,
8024,
5521,
3747,
1237,
6236,
534,
7314,
1252,
1254,
4847,
... | Train |
7,530 | 2 | Object_resurrection:object resurrection object-oriented programming languages garbage collection object resurrection object comes back life process object destruction side effect finalizer executed object resurrection causes number problems particularly possibility object resurrection – even occur – makes garbage collection significantly complicated slower major reason finalizers discouraged languages deal object resurrection various ways solutions problems rare circumstances object resurrection used implement certain design patterns notably object pool circumstances resurrection undesired bug caused error finalizers general resurrection discouraged object resurrection occurs via following process first object becomes garbage longer reachable program may collected destroyed deallocated object destruction garbage collector deallocates object finalizer method may run may turn make object another garbage object reachable object finalizer reachable creating references finalizer may contain arbitrary code happens referenced object – necessarily finalized object – longer garbage deallocated otherwise references would become dangling references cause errors used generally program crash unpredictable behavior instead order maintain memory safety object returned life resurrected order detect garbage collector generally two-phase collection presence finalizers first finalize garbage finalizer re-check garbage garbage reachable objects finalizers case finalizers resurrected garbage adds overhead delays memory reclamation resurrected object may treated objects may treated specially many languages notably c java python python 3.4 objects finalized avoid possibility object repeatedly resurrected even indestructible c objects finalizers default finalized re-registered finalization cases resurrected objects considered errors notably objective-c treated identically objects notably python prior python 3.4 resurrected object sometimes called zombie term used various object states related object destruction usage depending language author zombie object specialized meaning objective-c however detailed zombie objects somewhat analogous zombie processes undergone termination state change close deallocation details significantly different .net framework notably c vb.net object resurrection instead refers state object finalization object brought back life inaccessible finalizer run returned inaccessible longer registered future finalization .net objects need finalization tracked object-by-object instead stored finalization queue rather notion resurrected objects sense article one speaks objects queued finalization objects re-enqueued finalization via codice_1 taking care multiply enqueue objects two main ways object resurrect another object creating reference object reach garbage reachable garbage reference non-garbage objects creating reference environment global variables cases static variables variables closure python examples follow object resurrecting also possible object resurrect objects collected given garbage collection cycle mechanisms resurrects creating reference object reach resurrects creating reference global environment examples cpython prior 3.4 run finalizers repeatedly objects garbage-collected cpython 3.4 later finalizers called objects garbage-collected second time become unreachable object resurrection causes large number problems languages adopted several different methods coping object resurrection commonly two-phase garbage collection presence finalizers prevent dangling references finalizing objects particularly marking objects finalized via flag ensure objects destroyed java free object proven object unreachable run finalizer python prior python 3.4 standard cpython implementation would treat resurrected objects identically objects never finalized making indestructible objects possible would garbage collect cycles contained object finalizer avoid possible problems object resurrection starting python 3.4 behavior largely java objects finalized marked already finalized garbage collection cycles two phases second phase checking resurrected objects objective-c 2.0 put resurrected objects zombie state log messages sent nothing else see also automatic reference counting zeroing weak references handling weak references .net framework notably c vb.net object finalization determined finalization queue checked object destruction objects finalizer placed queue creation dequeued finalizer called manually dequeued prior finalization codice_3 re-enqueued codice_4 thus default objects finalizers finalized finalization suppressed objects finalized multiple times resurrected made accessible re-enqueued finalization weak references default track resurrection meaning weak reference updated object resurrected called short weak references weak references track resurrection called long weak references object resurrection useful handle object pool commonly used objects obscures code makes confusing used objects may frequently used construction/destruction time-consuming example could array random numbers large number created destroyed short time actually small number use time object resurrection pooling technique would reduce unnecessary overhead creation destruction pool manager would get onto object stack information form reference object currently destructed pool manager keep object reuse later | [
1616,
1363,
3351,
1191,
2530,
379
] | Test |
7,531 | 3 | Ricoh_2A03:ricoh 2a03 ricoh 2a03 rp2a03 ntsc version ricoh 2a07 rp2a07 pal version 8-bit microprocessor manufactured ricoh nintendo entertainment system video game console contained second sourced mos technology 6502 core modified disable 6502 binary-coded decimal mode 22 memory-mapped i/o registers controlled apu rudimentary dma game controller polling also used sound chip secondary cpu nintendo arcade games punch-out donkey kong 3 pal versions nes sold europe asia australia used ricoh 2a07 rp2a07 processor identical 2a03 except different clock divider 50 hz vertical refresh rate used pal television standard exception 16 hard-coded sampling rates delta modulation-encoded sample playback unit changes made order sampled sounds maintain original pitch rp2a03 new clock divider | [
7960,
7519,
463,
468,
5296,
2925,
7730,
2036,
1864,
2237,
4532,
7668,
4815,
7222,
1237,
3918,
5087
] | Test |
7,532 | 2 | Smack_(software):smack software smack full name simplified mandatory access control kernel linux kernel security module protects data process interaction malicious manipulation using set custom mandatory access control mac rules simplicity main design goal officially merged since linux 2.6.25 release main access control mechanism meego mobile operating system also used sandbox html5 web applications tizen architecture commercial wind river linux solutions embedded device development philips digital tv products. intel ostro os iot devices since 2016 smack required automotive grade linux agl implementations provides association linux facilities base agl security framework smack consists three components smack criticized written new lsm module instead selinux security policy provide equivalent functionality selinux policies proposed none demonstrated smack author replied would practical due selinux complicated configuration syntax philosophical difference smack selinux designs | [
3256,
2182,
3613,
7528,
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,
1596,
165,
7312,
1607,
5884,
1991,
890,
3084,
6984,
... | Test |
7,533 | 3 | NOP_(code):nop code computer science nop no-op noop pronounced op short operation assembly language instruction programming language statement computer protocol command nothing computer instruction sets include instruction whose explicit purpose change state programmer-accessible registers status flags memory often takes well-defined number clock cycles execute instruction sets nop simulated executing instruction operands cause effect e.g sparc processor instruction codice_1 recommended solution nop commonly used timing purposes force memory alignment prevent hazards occupy branch delay slot render void existing instruction jump place-holder replaced active instructions later program development replace removed instructions reorganizing would problematic time-consuming cases nop minor side effects example motorola 68000 series processors nop opcode causes synchronization pipeline listed nop instruction cpu architectures hardware design point view unmapped areas bus often designed return zeroes since nop slide behavior often desirable gives bias coding all-zeroes opcode nop sometimes used description action performed function sequence programming language statements function code effect might also called redundant code common compiler optimization detection removal kind code code may required grammar programming language allow blank ada codice_2 statement serves nop syntax forbids control statements functions empty codice_2 statement must used specify action required thus programmer forgets write sequence statements program fail compile second line example single c statement behaves like nop practice compilers generate code statement statement performs addition discards result indeed statement without side effects affect control flow e.g. break return removed result computation discarded simplest possible statement c behaves like nop so-called null statement semi-colon context requiring statement compiler required generate nop instruction case typically instructions whatsoever would generated alternatively empty block compound statement may used may legible cases body function block must used empty c statements empty – simple statements must end semicolon compound statements enclosed braces need following semicolon thus contexts statement grammatically required null statement used null statement useless syntactic use wider context e.g. within context loop alternatively tersely note last form may confusing generates warning compilers compiler options semicolon usually indicates end function call instruction placed round parenthesis end line code continues calling function getchar returns \n newline character essentially fast-forwarding current reading location standard input beginning next line fortran codice_4 statement used contexts last statement loop although used anywhere functionality c used used null statement fact due specification language begin end block semicolon optional end statement thus semicolon used superfluous also block consisting codice_5 may used placeholder indicate action even placed inside another begin end block python programming language codice_6 statement effect executed thus serves nop primarily used ensure correct syntax due python indentation-sensitive syntax example syntax definition class requires indented block class logic expressed codice_6 empty jquery library provides function codice_8 nothing angular framework provides angular.noop function performs operations 'codice_9 colon character shell builtin similar effect nop do-nothing operation technically nop changes special parameter exit status last command 0 may considered synonym shell builtin 'true exit status true 0 lodash library provides function codice_10 returns undefined nothing many computer protocols telnet include nop command client issue request response server without requesting actions command used ensure connection still alive server responsive noop command part following protocols partial list note unlike protocols listed imap4 noop command specific purpose allows server send pending notifications client telnet ftp servers respond noop command ok +ok programmers added quirky responses client example codice_11 daemon minix responds noop message nops often involved cracking software checks serial numbers specific hardware software requirements presence absence hardware dongles etc accomplished altering functions subroutines bypass security checks instead simply return expected value checked instructions security check routine unused would replaced nops thus removing software security functionality without attracting attention nop opcode used form nop slide allows code execute exact value instruction pointer indeterminate e.g. buffer overflow causes function return address stack overwritten | [
5893,
364,
6078,
6079,
7331,
8064,
895,
1630,
2281,
3944,
5208,
6177,
7529,
4942,
3100,
5381,
304,
1938,
7541,
5225,
1556,
2929,
6908,
7990,
1852,
1854,
5055,
4611,
5947,
5948,
6922,
5680,
5243,
8117,
2237,
5190,
514,
336,
2621,
4542,
5... | Test |
7,534 | 4 | Promiscuous_mode:promiscuous mode computer networking promiscuous mode mode wired network interface controller nic wireless network interface controller wnic causes controller pass traffic receives central processing unit cpu rather passing frames controller specifically programmed receive mode normally used packet sniffing takes place router computer connected wired network one part wireless lan interfaces placed promiscuous mode software bridges often used hardware virtualization ieee 802 networks ethernet ieee 802.11 frame includes destination mac address non-promiscuous mode nic receives frame drops unless frame addressed nic mac address broadcast multicast addressed frame promiscuous mode however nic allows frames thus allowing computer read frames intended machines network devices many operating systems require superuser privileges enable promiscuous mode non-routing node promiscuous mode generally monitor traffic nodes within broadcast domain ethernet ieee 802.11 ring token ring computers attached ethernet hub satisfy requirement network switches used combat malicious use promiscuous mode router may monitor traffic routes promiscuous mode often used diagnose network connectivity issues programs make use feature show user data transferred network protocols like ftp telnet transfer data passwords clear text without encryption network scanners see data therefore computer users encouraged stay away insecure protocols like telnet use secure ones ssh promiscuous mode used malicious way capture private data transit network computer security professionals might interested detecting network devices promiscuous mode promiscuous mode software might send responses frames even though addressed another machine however experienced sniffers prevent e.g. using carefully designed firewall settings example sending ping icmp echo request wrong mac address right ip address adapter operating normal mode drop frame ip stack never sees responds adapter promiscuous mode frame passed ip stack machine mac address meaning respond would ping sniffer prevent configuring firewall block icmp traffic following applications applications classes use promiscuous mode | [
5194,
4295,
1353,
2466,
5571,
588,
5241,
7476,
6929,
1403,
6220,
4631,
6574,
7214,
7216,
7765,
7220,
1237,
5181,
2894,
1805
] | Test |
7,535 | 3 | OpenSPARC:opensparc opensparc open-source hardware project started december 2005 initial contribution project sun microsystems register-transfer level rtl verilog code full 64-bit 32-thread microprocessor ultrasparc t1 processor march 21 2006 sun released source code t1 ip core gnu general public license v2 full opensparc t1 system consists 8 cores one capable executing four threads concurrently total 32 threads core executes instruction order logic split among 6 pipeline stages december 11 2007 sun also made ultrasparc t2 processor rtl available via opensparc project also released gnu general public license v2 opensparc t2 8 cores 16 pipelines 64 threads | [
6329,
1254,
1258,
1923,
6505,
6270,
908,
1185,
2299,
4418,
7453,
2033,
4703,
5936,
4967,
4885,
5587,
1023,
418,
7114,
3820,
949,
7681,
8138,
4999,
3673,
5705,
7313,
7777,
7781,
971
] | Validation |
7,536 | 4 | NuFW:nufw nufw software package extends netfilter linux kernel-internal packet filtering firewall module nufw adds authentication filtering rules nufw also provided hardware firewall edenwall firewalling appliance nufw restarted ffi renamed ufwi nufw ufwi extension netfilter brings notion user ip filtering nufw ufwi nufw ufwi refuses idea ip == user ip address easily spoofed thus uses algorithm perform authentication depends two subsystems nufw connected netfilter nuauth connected clients nufw algorithm following algorithm realizes posteriori authentication connection time-based association ensures identity user sent packet nufw real authentication firewall never associates user machine | [
1249,
3165,
1809,
4759,
806,
994,
3185,
4492,
4590,
7351,
4138,
385,
2296,
2746,
5571,
6107,
578,
3637,
3794,
8100,
6456,
3551,
1291,
2944,
7275,
7744,
3394,
6560,
4977,
7289,
7478,
3223,
3484,
4091,
2790,
7683,
6235,
6149,
6951,
7597,
... | Test |
7,537 | 8 | Libwww:libwww libwww library world wide web modular client-side web api unix windows also name reference implementation libwww api used applications varying sizes including web browsers editors internet bots batch tools pluggable modules provided libwww add support http/1.1 caching pipelining post digest authentication deflate purpose libwww serve testbed protocol experiments software developers reinvent wheel libcurl considered modern replacement libwww 1991 1992 tim berners-lee student cern named jean-françois groff rewrote various components original worldwideweb browser nextstep operating system portable c code order demonstrate potential world wide web beginning libwww referred common library available separate product becoming generally available libwww integrated cern program library cernlib july 1992 library ported decnet may 1993 world wide web newsletter berners-lee announced common library called libwww licensed public domain encourage development web browsers initially considered releasing software gnu general public license rather public domain decided due concerns large corporations ibm would deterred using restrictions gpl rapid early development library caused robert cailliau problems integrating macwww browser 25 november 1994 version 2.17 henrik frystyk nielsen responsible libwww 21 march 1995 release version 3.0 cern put full responsibility libwww world wide web consortium w3c 1995 onwards line mode browser longer released separately part libwww package w3c created arena web browser testbed testing tool html3 css png features like libwww beta 3 arena replaced amaya 2 september 2003 w3c stopped development library due lack resources expectation development would come open source community libwww supports following protocols features include libwww supports plug-ins 19 applications used libwww integrated applications libwww developers libcurl criticised libwww portable thread-safe lacking several http authentication types neither libcurl libwww lightweight enough projects | [
4655,
6802,
5378,
2205,
6809,
393,
3291,
2574,
5762,
4352,
4725,
1136,
80,
2973,
4743,
2261,
84,
87,
445,
1152,
4759,
2281,
7628,
5821,
3363,
5127,
3383,
8006,
3043,
1970,
6221,
520,
3057,
3060,
3412,
1989,
7315,
1609,
5887,
5542,
4126,... | Test |
7,538 | 7 | Content_addressable_network:content addressable network content addressable network distributed decentralized p2p infrastructure provides hash table functionality internet-like scale one original four distributed hash table proposals introduced concurrently chord pastry tapestry like distributed hash tables designed scalable fault tolerant self-organizing architectural design virtual multi-dimensional cartesian coordinate space type overlay network multi-torus n-dimensional coordinate space virtual logical address completely independent physical location physical connectivity nodes points within space identified coordinates entire coordinate space dynamically partitioned among nodes system every node possesses least one distinct zone within overall space node maintains routing table holds ip address virtual coordinate zone neighbors node routes message towards destination point coordinate space node first determines neighboring zone closest destination point looks zone node ip address via routing table join joining node must find node already overlay network bootstrapping nodes may used inform joining node ip addresses nodes currently overlay network joining node receives ip address node already attempt identify zone joining node randomly picks point coordinate space sends join request directed random point one received ip addresses nodes already overlay network route join request correct device via zone-to-ip routing tables node managing destination point zone receives join request may honor join request splitting zone half allocating first half allocating joining node second half honor join request joining node keeps picking random points coordinate space sending join requests directed random points successfully joins network zone split allocation complete neighboring nodes updated coordinates two new zones corresponding ip addresses routing tables updated updates propagated across network handle node departing must detecting node departure done instance via heartbeat messages periodically broadcast routing table information neighbors predetermined period silence neighbor neighboring node determined failed considered departing node alternatively node willingly departing may broadcast notice neighbors departing node identified zone must either merged taken first departed node zone analyzed determine whether neighboring node zone merge departed node zone form valid zone example zone 2d coordinate space must either square rectangle l-shaped validation test may cycle neighboring zones determine successful merge occur one potential merges deemed valid merge zones merged none potential merges deemed valid neighboring node smallest zone takes control departing node zone take-over take-over node may periodically attempt merge additionally controlled zones respective neighboring zones merge successful routing tables neighboring zones nodes updated reflect merge network see subsection overlay network one single zone merge treat routing processing mindset effectuate take-over take-over node updates neighboring zones nodes routing tables requests either zone resolve take-over node network still sees subsection overlay network two separate zones treats routing processing mindset sylvia ratnasamy paul francis mark handley richard karp scott shenker | [
6025,
5447,
3798
] | Test |
7,539 | 0 | Noisy_text_analytics:noisy text analytics noisy text analytics process information extraction whose goal automatically extract structured semistructured information noisy unstructured text data text analytics growing mature field great value huge amounts data produced processing noisy text gaining importance lot common applications produce noisy text data noisy unstructured text data found informal settings online chat text messages e-mails message boards newsgroups blogs wikis web pages also text produced processing spontaneous speech using automatic speech recognition printed handwritten text using optical character recognition contains processing noise text produced circumstances typically highly noisy containing spelling errors abbreviations non-standard words false starts repetitions missing punctuations missing letter case information pause filling words “ um ” “ uh ” texting speech disfluencies text seen large amounts contact centers chat rooms optical character recognition ocr text documents short message service sms text etc documents historical language also considered noisy respect today knowledge language text contains important historical religious ancient medical knowledge useful nature noisy text produced contexts warrants moving beyond traditional text analysis techniques missing punctuation use non-standard words often hinder standard natural language processing tools part-of-speech tagging parsing techniques learn noisy data able process noisy data developed | [
4089,
1314,
5429,
1444,
3651,
5885,
7372
] | Test |
7,540 | 3 | Semantic_heterogeneity:semantic heterogeneity semantic heterogeneity database schema datasets domain developed independent parties resulting differences meaning interpretation data values beyond structured data problem semantic heterogeneity compounded due flexibility semi-structured data various tagging methods applied documents unstructured data semantic heterogeneity one important sources differences heterogeneous datasets yet multiple data sources interoperate one another essential reconcile semantic differences decomposing various sources semantic heterogeneities provides basis understanding map transform data overcome differences one first known classification schemes applied data semantics william kent two decades ago kent approach dealt structural mapping issues differences meaning pointed data dictionaries potentially solving one comprehensive classifications pluempitiwiriyawej hammer classification scheme semantic schematic heterogeneities xml data sources classify heterogeneities three broad classes moreover mismatches conflicts occur set elements population mismatch attributes description mismatch michael bergman expanded upon schema adding fourth major explicit category language also added examples kind semantic heterogeneity resulting 40 distinct potential categories table shows combined 40 possible sources semantic heterogeneities across sources different approach toward classifying semantics integration approaches taken sheth et al concept split semantics three forms implicit formal powerful implicit semantics either largely present easily extracted formal languages though relatively scarce occur form ontologies description logics powerful soft semantics fuzzy limited rigid set-based assignments sheth et al main point first-order logic fol description logic inadequate alone properly capture needed semantics besides data interoperabiity relevant areas information technology depend reconciling semantic heterogeneities include data mapping semantic integration enterprise information integration among many others conceptual actual data differences perspective vocabularies measures conventions two data sources brought together explicit attention semantic heterogeneities one means get information integrate interoperate mere twenty years ago information technology systems expressed stored data multitude formats systems internet web protocols done much overcome sources differences large number categories semantic heterogeneity categories also patterned anticipated corrected patterned sources inform kind work must done overcome semantic differences still reside | [
30,
2087,
5016
] | Test |
7,541 | 3 | Branch_(computer_science):branch computer science branch instruction computer program cause computer begin executing different instruction sequence thus deviate default behavior executing instructions order branch branching branched may also refer act switching execution different instruction sequence result executing branch instruction branch instructions used implement control flow program loops conditionals i.e. executing particular sequence instructions certain conditions satisfied branch instruction either unconditional branch always results branching conditional branch may may cause branching depending condition also depending specifies address new instruction sequence target address branch instruction generally classified direct indirect relative meaning instruction contains target address specifies target address found e.g. register memory location specifies difference current target addresses mechanically branch instruction change program counter pc cpu program counter stores memory address next instruction executed therefore branch cause cpu begin fetching instructions different sequence memory cells branch taken cpu program counter set argument jump instruction next instruction becomes instruction address memory therefore flow control changes branch taken cpu program counter unchanged therefore next instruction executed instruction branch instruction therefore flow control unchanged term branch used referring programs high level languages well programs written machine code assembly language high-level programming languages branches usually take form conditional statements various forms encapsulate instruction sequence executed conditions satisfied unconditional branch instructions goto used unconditionally jump begin execution different instruction sequence machine level branch instructions sometimes called jump instructions machine level jump instructions typically unconditional conditional forms latter may taken taken depending condition usually distinct forms one-way jumps often called jump subroutine invocations known call automatically save originating address return address stack allowing single subroutine invoked multiple locations code cpus flag registers earlier instruction sets condition flag register earlier instruction may arithmetic logic instruction often close branch though necessarily instruction immediately branch stored condition used branch jump overflow-flag set temporary information often stored flag register may also located elsewhere flag register design simple slower simple computers fast computers flag register place bottleneck speed instructions could otherwise operate parallel several execution units need set flag bits particular sequence also machines particular instructions condition may checked jump instruction branch label register x negative simple computer designs comparison branches execute arithmetic use power flag register branches fast computer designs comparison branches run faster flag register branches comparison branches access registers parallelism using cpu mechanisms calculation early simple cpu architectures still found microcontrollers may implement conditional jump rather conditional skip next instruction operation conditional jump call thus implemented conditional skip unconditional jump call instruction depending computer architecture assembly language mnemonic jump instruction typically shortened form word jump word branch often along informative letters extra parameter representing condition sometimes details included well range jump offset size special addressing mode used locate actual effective offset table lists machine level branch jump instructions found several well-known architectures achieve high performance modern processors pipelined consist multiple parts partially process instruction feed results next stage pipeline start working next instruction program design expects instructions execute particular unchanging sequence conditional branch instructions make impossible know sequence conditional branches cause stalls pipeline restarted different part program several techniques improve speed reducing stalls conditional branches historically branch prediction took statistics used result optimize code programmer would compile test version program run test data test code counted branches actually taken statistics test code used compiler optimize branches released code optimization would arrange fastest branch direction taken would always frequently taken control flow path permit cpus must designed least predictable branch timing cpus instruction sets power isa designed branch hints compiler tell cpu branch taken problem software branch prediction requires complex software development process run software hardware branch predictors moved statistics electronics branch predictors parts processor guess outcome conditional branch processor logic gambles guess beginning execute expected instruction flow example simple hardware branch prediction scheme assume backward branches i.e smaller program counter taken part loop forward branches larger program counter taken leave loop better branch predictors developed validated statistically running simulation variety test programs good predictors usually count outcomes previous executions branch faster expensive computers run faster investing better branch prediction electronics cpu hardware branch prediction branch hints let compiler presumably superior branch prediction override hardware simplistic branch prediction logic written without branches fewer branches often possible use bitwise operations conditional moves branch predication instead branches another technique branch delay slot approach one instruction branch always executed therefore computer use instruction useful work whether pipeline stalls approach historically popular risc computers family compatible cpus complicates multicycle cpus pipeline faster cpus longer-than-expected pipelines superscalar cpus execute instructions order | [
2448,
5893,
1252,
6078,
6079,
4847,
4220,
5636,
895,
5988,
7331,
5208,
467,
14,
7529,
7533,
3782,
5737,
648,
6687,
5225,
1556,
3967,
7990,
7693,
5055,
4251,
6922,
5680,
4719,
8117,
514,
336,
1041,
4985,
5079,
4543,
5082,
2888,
3747,
315... | Test |
7,542 | 9 | PHP_Standard_Recommendation:php standard recommendation php standard recommendation psr php specification published php framework interop group similar java specification request java serves standardization programming concepts php aim enable interoperability components provide common technical basis implementation proven concepts optimal programming testing practices php-fig formed several php frameworks founders psr suggested members voted according established protocol act consistently line agreed upon processes php-fig official website psr documentation follows nowiki rfc 2119 /nowiki written scott bradner march 1997 harvard university | [
6248,
6029
] | Test |
7,543 | 5 | Optical_add-drop_multiplexer:optical add-drop multiplexer optical add-drop multiplexer oadm device used wavelength-division multiplexing systems multiplexing routing different channels light single mode fiber smf type optical node generally used formation construction optical telecommunications networks add drop refer capability device add one new wavelength channels existing multi-wavelength wdm signal and/or drop remove one channels passing signals another network path oadm may considered specific type optical cross-connect traditional oadm consists three stages optical demultiplexer optical multiplexer method reconfiguring paths demultiplexer multiplexer set ports adding dropping signals demultiplexer separates wavelengths input fiber onto ports reconfiguration achieved fiber patch panel optical switches direct wavelengths multiplexer drop ports multiplexer multiplexes wavelength channels continue demultiplexer ports add ports onto single output fiber lightpaths directly pass oadm termed cut-through lightpaths added dropped oadm node termed added/dropped lightpaths oadm remotely reconfigurable optical switches example 1×2 middle stage called reconfigurable oadm roadm ones without feature known fixed oadms term oadm applies types often used interchangeably roadm physically several ways make oadm variety demultiplexer multiplexer technologies including thin film filters fiber bragg gratings optical circulators free space grating devices integrated planar arrayed waveguide gratings switching reconfiguration functions range manual fiber patch panel variety switching technologies including microelectromechanical systems mems liquid crystal thermo-optic switches planar waveguide circuits although add/drop functionality oadms distinct add-drop multiplexers former function photonic domain wavelength-division multiplexing latter implicitly considered function traditional sonet/sdh networks | [
3724,
2652,
1374,
2117,
4378
] | Test |
7,544 | 8 | Caudium_(web_server):caudium web server caudium open source web server originally created fork roxen challenger server server written c pike pike also used create extensions server caudium different apache configuration process different directory structure different generally languages used program server extensions dynamic pages different although support php according caudium website caudium offers different performance profile apache n't fork external processes making better suited cope sudden spikes traffic | [
3168,
5369,
1349,
5206,
5820,
5214,
2646,
6270,
1834,
2291,
8182,
6536,
26,
7988,
4701,
1392,
7786,
417,
3135,
2506,
1686,
3408,
1602,
6061,
7411,
7952,
1435,
2807
] | Test |
7,545 | 2 | Nokia_C5-03:nokia c5-03 nokia c5-03 budget resistive touchscreen smartphone wlan cseries released december 2010 phone shazam music identification software social networking software included available download assisted gps ovi maps 3.0 integrated | [
1066,
5979,
2271,
6517,
372,
1724,
463,
7521,
3615,
1453,
4935,
3694,
3524,
3952,
472,
5909,
8072,
2922,
4407,
118,
23,
2564,
3703,
7261,
5044,
5493,
740,
1202,
5315,
3029,
5499,
7012,
139,
6465,
5062,
3039,
3653,
1582,
4894,
5068,
597,... | Validation |
7,546 | 2 | VP/CSS:vp/css vp/css time-sharing operating system developed national css began life 1968 copy ibm cp/cms time distributed ibm customers charge source code form without support part ibm type-iii library extensive in-house development today would termed software fork national css took vp/css different direction cp/cms although two systems would eventually share many capabilities technical implementations diverged substantive ways vp/css ran ibm ibm plug compatible hardware owned ncss customers site licenses including bank america standard oil california initial period running ibm system/360-67 platform used cp/cms vp/css ported system/370 series made possible ibm added virtual memory capabilities s/370 series 1972 vp/css notable supporting large numbers interactive users per machine compared ibm mainframe operating systems technical operations commercial factors played role making national css commercially viable service business vp/css shared basic architecture concepts cp/cms revolutionary time control program called cp cp/cms vp vp/css created multiple independent virtual machines vms implementing full virtualization underlying hardware – meaning time-sharing user provided private virtual machine appeared entire stand-alone computer capable running software could run bare machine including operating systems concept pioneered ibm research system cp-40 first version cp/cms design departure ibm monolithic operating systems isolating users improved system stability bug one user software could crash another user virtual machine underlying control program approach made cp/cms superior choice commercial time-sharing thus strong foundation national css broke new ground would become important new industry vm created vp ran simple single-user operating system called css derived ibm cambridge monitor system css allowed users run programs manipulate file system manage virtual devices since vp css began life cp cms respectively closely resembled systems particularly early days continuous development introduction new features vp/css ibm vm led significant differences time systems retained obvious family resemblance ibm decision add virtualization virtual memory features s/370 reflects success virtual machine approach time-sharing credit belated decision attributed ibm awareness commercial success national css 1968 founders national css saw cp/cms operating system would good foundation time-sharing business – system technical merits ability share mainframe resources among many interactive users availability source code form cost another firm interactive data corporation reached conclusion firm lured away key cp/cms technical personnel csc mit union carbide national css quickly discovered however cp/cms initial performance adequate sustain profitable operations – literally selling every available minute interactive time would pay 50k/month equipment lease crash technical project began improve performance led number fundamental enhancements soon allowed business make money thus began lengthy reimplementation effort would occupy large development team course fifteen years end lifespan vp/css diverged long way cp/cms roots boasted surprising array features would considered quite modern even today key enhancements original cp/cms system included changes dispatching algorithm paging system virtual memory course new concept time ibm system/360-67 address translation technology enabled various technical approaches ultimately vp/css page migration algorithm three-queue dispatcher became well-known ncss personnel eventually joined ibm thomas j. watson research center work vm technologies another area throughput improvement performance css single-user operating system one important change replacing channel command words ccws expensive simulated instructions something like today termed bios calls simulating complex s/360 i/o architecture virtualization amazing feat – done cp complex innermost core routine called ccwtrans i/o operations trapped within virtual machine however proved enormously cheaper make direct hypervisor calls targeted functions rather simulating operation low-level i/o commands vp/css done using paravirtualization via non-virtualized diag diagnose instruction technique used ibm cp/cms release 3.1 carried forward vm/370 unclear implementation came first – whether invented independently early national css technical efforts quickly established vp/css commercially viable version cp/cms vp/css reputed much better performance ibm reimplementation cp/cms vm/370 – turn reputed substantial performance advantage ibm preferred timesharing solution tso unfortunately documented period performance statistics hard find today however several data points support claims following relative performance believed accurate although documented sources remain located described history cp/cms ibm primary emphasis mvs successors core mainframe operating system led ibm waste substantial technical advantage represented vm/370 made possible independent vendor like ncss strike new territory industry observers pointed hardware vendor natural preference selling hardware increasing number users per machine ncss gained technical advantages ultimately became successful commercially despite fact optimization techniques used enhance vp css performance well understood well-documented literature day ultimately amdahl corporation publicized sales wins several large vp/css data centers ibm began pay public attention ncss technical innovations long thereafter time-sharing industry began feel pressure personal computer revolution need super-optimized multiuser mainframe operating system waned ncss moved away vp/css mid 80s retargeting nomad vm platforms unknown long ncss site-license customers continued use vp/css equipment though seems unlikely could continue long without ongoing ncss operating system support | [
4670,
5021,
13,
3271,
3626,
5041,
5396,
7550,
402,
405,
65,
6849,
4366,
5783,
5088,
6500,
785,
1516,
2266,
788,
1522,
7605,
4759,
6518,
4397,
5116,
5481,
2300,
4786,
839,
4428,
6922,
850,
5161,
5865,
861,
3751,
1992,
1994,
7325,
190,
... | Test |
7,547 | 2 | Cleanup_stack:cleanup stack cleanup stack concept widely used symbian os suitable use places dynamic memory used allocated programming problem dynamic memory sole discretion underlying os whether request memory allocation shall succeed applications requester memory must prepared handle rejection large programs dynamic memory used almost everywhere application frequently adds code handle failure increase code size significantly symbian used mostly phones increase code size amplify memory allocation failures symbian features ingenious solution problem application notes memory allocation may fail places earlier allocated memory address location symbian aware location called cleanup stack event failure symbian knows whatever resource placed cleanup stack needs freed way resources freed program crashes leaves freeing performed automatically symbian os applications die peacefully without worrying would clean mess left cleanup stack make idea keep copy pointer allocated memory elements cleanup stack popped destroyed using push pop popanddestroy example | [
5571
] | Validation |
7,548 | 4 | Meet-in-the-middle_attack:meet-in-the-middle attack meet-in-the-middle attack mitm generic space–time tradeoff cryptographic attack encryption schemes rely performing multiple encryption operations sequence mitm attack primary reason double des used triple des key 168-bit bruteforced attacker 2 space 2 operations trying improve security block cipher tempting idea encrypt data several times using multiple keys one might think doubles even n -tuples security multiple-encryption scheme depending number times data encrypted exhaustive search possible combination keys simple brute-force would take 2 attempts data encrypted k -bit keys n times mitm generic attack weakens security benefits using multiple encryptions storing intermediate values encryptions decryptions using improve time required brute force decryption keys makes meet-in-the-middle attack mitm generic space–time tradeoff cryptographic attack mitm attack attempts find keys using range ciphertext domain plaintext composition several functions block ciphers forward mapping first functions backward mapping inverse image last functions quite literally meeting middle composed function example although double des encrypts data two different 56-bit keys double des broken 2 encryption decryption operations multidimensional mitm md-mitm uses combination several simultaneous mitm attacks like described meeting happens multiple positions composed function diffie hellman first proposed meet-in-the-middle attack hypothetical expansion block cipher 1977 attack used space–time tradeoff break double-encryption scheme twice time needed break single-encryption scheme 2011 bo zhu guang gong investigated multidimensional meet-in-the-middle attack presented new attacks block ciphers gost ktantan hummingbird-2 assume someone wants attack encryption scheme following characteristics given plaintext p ciphertext c enc encryption function dec decryption function defined enc inverse mapping k k two keys naive approach brute-forcing encryption scheme decrypt ciphertext every possible k decrypt intermediate outputs every possible k total 2 2 2 operations meet-in-the-middle attack uses efficient approach decrypting c k one obtains following equivalence attacker compute enc p values k dec c possible values k total 2 2 2 k k size operations result enc p operations matches result dec c operations pair k k possibly correct key potentially-correct key called candidate key attacker determine candidate key correct testing second test-set plaintext ciphertext mitm attack one reasons data encryption standard des replaced triple des double des attacker use mitm attack bruteforce double des 2 operations 2 space making small improvement des triple des uses triple length 168-bit key also vulnerable meet-in-the-middle attack 2 space 2 operations considered secure due size keyspace compute following match found keep k k candidate key-pair table test pairs new pair confirm validity key-pair work new pair mitm new pair keysize k attack uses 2encryptions decryptions 2 memory case look-up table built set forward computations contrast naive attack needs 2 encryptions 1 space 1d-mitm efficient sophisticated attack developed multidimensional meet-in-the-middle attack also abbreviated md-mitm preferred data encrypted using 2 encryptions different keys instead meeting middle one place sequence md-mitm attack attempts reach several specific intermediate states using forward backward computations several positions cipher assume attack mounted block cipher encryption decryption defined plaintext p encrypted multiple times using repetition block cipher md-mitm used cryptanalysis among many gost block cipher shown 3d-mitm significantly reduced time complexity attack compute following possible guess intermediate state formula_18 compute following whether matches formula_38 case use found combination sub-keys formula_39 another pair plaintext/ciphertext verify correctness key note nested element algorithm guess every possible value done guess previous make element exponential complexity overall time complexity md-mitm attack time complexity attack without brute force formula_40⋅formula_41⋅formula_42 regarding memory complexity easy see formula_43 much smaller first built table candidate values formula_44 increases candidate values contained formula_45 must satisfy conditions thereby fewer candidates pass end destination formula_38 upper bound memory complexity md-mitm denotes length whole key combined data complexity depends probability wrong key may pass obtain false positive formula_48 intermediate state first mitm phase size intermediate state block size often considering also many keys left testing first mitm-phase formula_49 therefore first mitm phase formula_50 |⋅| denotes length main memory consumption restricted construction sets b much smaller others data complexity see subsection complexity md-mitm | [
1811,
4930,
464,
807,
1353,
2918,
3100,
119,
1283,
6637,
1480,
6647,
7200,
4805,
5765,
5327,
6657,
7928,
1587,
5333,
6763,
6049,
161,
433,
1320,
613,
1146,
4917,
3426
] | Validation |
7,549 | 5 | Query_flooding:query flooding query flooding method search resource p2p network simple scales poorly thus rarely used early versions gnutella protocol operated query flooding newer versions use efficient search algorithms p2p network generally consists large number nodes connected nodes small subset nodes node wants find resource network may node know could simply broadcast search query immediate neighbours neighbours resource asks neighbours forward query neighbours turn repeated resource found nodes contacted perhaps network-imposed hop limit reached query flooding simple implement practical small networks requests contacts reachable nodes network precisely determine whether resource found network freenet example returns probabilistic result hand every request may cause every node contacted node might generate small number queries however query floods network thus larger network would generate far traffic per node smaller one making inherently unscalable additionally node flood network simply issuing request nonexistent resource could possible launch denial-of-service attack network version 0.6 gnutella protocol mandates query routing query routing specification explains ideas original research implemented file sharing networks kad network use distributed hash tables index files keyword searches bittorrent creates individual overlay networks sharing individual files archives searches performed mechanisms locating torrent files indexed web site similar mechanism use gnutella network magnet links instance bitzi provides web interface search magnet links earlier p2p networks napster used centralized database locate files scaling problem central server single point failure | [
6025,
1691,
5447,
2984
] | Train |
7,550 | 3 | Exokernel:exokernel exokernel operating system kernel developed mit parallel distributed operating systems group also class similar operating systems operating systems generally present hardware resources applications high-level abstractions virtual file systems idea behind exokernels force abstractions possible application developers enabling make many decisions possible hardware abstractions exokernels tiny since functionality limited ensuring protection multiplexing resources considerably simpler conventional microkernels implementation message passing monolithic kernels implementation high-level abstractions implemented applications called library operating systems may request specific memory addresses disk blocks etc kernel ensures requested resource free application allowed access low-level hardware access allows programmer implement custom abstractions omit unnecessary ones commonly improve program performance also allows programmers choose level abstraction want high low exokernels seen application end-to-end principle operating systems force application program layer abstractions top abstractions designed different requirements mind example mit exokernel project cheetah web server stores preformatted internet protocol packets disk kernel provides safe access disk preventing unauthorized reading writing disk abstracted application libraries application uses traditionally kernel designers sought make individual hardware resources invisible application programs requiring programs interact hardware via abstraction model models include file systems disk storage virtual address spaces memory schedulers task management sockets network communication abstractions hardware make easier write programs general limit performance stifle experimentation new abstractions security-oriented application might need file system leave old data disk reliability-oriented application might need file system keeps data failure recovery one option remove kernel completely program directly hardware entire machine would dedicated application written conversely entire application codebase would dedicated machine exokernel concept compromise let kernel allocate basic physical resources machine e.g disk blocks memory pages processor time multiple application programs let program decide resources program link support library implements abstractions needs implement mit developed two exokernel-based operating systems using two kernels aegis proof concept limited support storage xok applied exokernel concept thoroughly essential idea mit exokernel system operating system act executive small programs provided application software constrained requirement exokernel must able guarantee use hardware safely mit exokernel manages hardware resources follows available library operating systems exokernel include custom exos system emulator bsd addition exokernel team created cheetah web server uses kernel directly exokernel concept around since least 1994 exokernels still research effort used major commercial operating systems concept operating exokernel system nemesis written university cambridge university glasgow citrix systems swedish institute computer science mit also built several exokernel-based systems including exos | [
1807,
4297,
4670,
5021,
13,
3271,
3276,
3626,
5041,
7546,
405,
1855,
4347,
65,
7581,
4733,
5783,
6853,
5088,
6500,
785,
2266,
788,
3682,
1522,
7605,
7611,
4759,
7242,
4397,
6892,
5116,
2300,
126,
6907,
4786,
4423,
6197,
4061,
1208,
1574... | Train |
7,551 | 1 | Threat_Matrix_(database):threat matrix database threat matrix intelligence-based measure thorough assessments database program pakistani government officials military science circles use evaluating perceived external internal threats challenge national security pakistan development began 2011 government prime minister yousaf raza gillani program identifies military operational priorities goes beyond comprehensively describing existential non-existential threats country threat matrix program viewed become permanent fixture national security policy pakistan database comprehensive existence revealed political scientist dr. farrukh saleem work published news international 2013 earlier mentioned ispr press briefing given media published thesis saleem critically opined source existential threats always state actor non-state armed forces threat matrix two defined dimensions conventional threats sub-conventional threats conventional threats external threats national security outside country sub-conventional threats refer internal threats national security within country january 2013 major-general asif salim inter-services public relations ispr briefed news media new recent studies conducted pakistan military according ispr armed forces programmed conventional warfare current situation necessitated change forces fighting front-line tribal regions program according requirements sub-conventional warfare interview military scientist talat masood noted new doctrine india viewed 1 enemy first time realised pakistan faces real threat within threat concentrated areas along western borders conflict northwest closely tied war afghanistan factors like militant insurgency future us pullout afghanistan intertwined effect conflict pakistan according lieutenant-general khalid rabbani commander xi corps peshawar withdrawal foreign combat troops afghanistan since 2014 may trigger challenging ramifications pakistan terms threat matrix afghanistan leaving giving notion success taliban afghanistan notion success may snowballing effect threat matrix afghanistan along challenges posed western front india still retains important focus threat assessments pakistan civil-military foreign policy doctrine according express tribune editorial potential threat arch-rival india east effect state threat matrix western front dwindling capacity state cope terrorism owed pakistan 'vigilance eastern border pakistan static 'threat matrix expects india attack occupy pakistan never accepted creation pakistan harsh v. pant outlook india thinks pakistan fast-growing nuclear arsenal expanding greater rate india charged sociopolitical atmosphere country rapidly changing dynamics nuclear matrix region tactically underscores pakistani military establishment india-centric threat matrix 2016 pakistan navy revealed developing maritime doctrine response evolving conventional subconventional threat matrix region indian ocean doctrine would aim protect pakistan maritime interests region according j. berkshire miller diplomat military establishment pakistan meanwhile still views threat matrix india-centric lens—pakistan genuinely believes rightly wrongly india continues work aggressively strategic interests bribery espionage afghanistan comprehensive thesis minimum deterrence pakistan dilemma published royal united services institute rusi nuclear strategist theorist brigadier-general retired feroz hassan khan states pakistan threat matrix dramatically changed events 1971 war india nuclear bomb test 1974 country threat perception became dominated twin threat india conventional force superiority nuclear weapons capability acquisition nuclear weapons hence became pakistan highest national security objective unanimity across parts political spectrum augmented strong perception outside powers could relied upon moments crisis war term also economic connotations instance us secretary state hillary clinton outlined downturn global financial crisis effect pakistan especially context war militancy economic crisis left unresolved create massive unemployment upend governments unfortunately breed instability ... appreciated putting context threat matrix look pakistan country know stabilized benefit south asia beyond june 2013 pakistan armed forces started joint-war game exercise codenamed azm-i-nau iv aim update military readiness strategy dealing complex security threat environment objective exercise assess military tactics procedures techniques event emerging threat environment explore joint operations strategies response combating threat three branches military army air force navy exercise took place amid renewed fears situation afghanistan post-withdrawal coalition forces 2014 well continuing internal threat terrorism india growing regional ambitions newspaper dawn reported senior military official said war games meant coming comprehensive response threats explained threat matrix evolving transforming includes internal challenge terror groups various shades conventional threat external aggression 2009 azm-i-nau exercises aimed preempting india cold start doctrine improving joint armed forces response conventional threat work published dr. farrukh saleem current threat matrix five major elements military nuclear terrorism cyber economic according saleem first two threats military nuclear existential nature threaten basis state physical existence existential threats essentially threaten unity demography integrity nation-state pakistan last three threats terrorism cyber economic non-existential nature asymmetric sense belligerents possess unequal military resources weaker opponent uses unconventional weapons tactics exploit vulnerabilities enemy government military science officials describing threat matrix program legally morally sound recent joint military exercises conducted rapidly respond threat matrix falls category low-intensity conflict confronted areas country soon revelation program international media ispr international media quoted change policy seen paradigm shift country policy however pakistani political science scholar ghazi salahuddin remains uncertain described paradigm shift | [] | Test |
7,552 | 2 | Hybrid_array:hybrid array hybrid array form hierarchical storage management combines hard disk drives hdds solid-state drives ssds i/o speed improvements hybrid storage arrays aim mitigate ever increasing price-performance gap hdds dram adding non-volatile flash level memory hierarchy hybrid arrays thus aim lower cost per i/o compared using ssds storage hybrid architectures simple involving single ssd cache desktop laptop computers complex configurations data centers cloud computing commercial products building hybrid arrays include | [
2961,
1640,
5805,
7242,
1447,
578,
6505
] | Validation |
7,553 | 2 | Sticky_Notes:sticky notes sticky notes desktop notes application included windows 7 windows 8 windows 10 present windows vista gadget windows sidebar originated windows xp tablet edition 2002 program allows users take notes using post-it note–like windows desktop according microsoft employee eight million monthly sticky notes users april 2016 original sticky notes gadget one many included vista although gadgets continued windows 7 sticky notes removed list made standalone app built win32 platform could still open startup version directly support pen input default color yellow five colors offered sticky notes jumplists taskbar preview shows notes stack sticky notes automatically saved version reused windows 8 initial releases windows 10 windows 10 anniversary update new version built universal windows platform introduced launched standalone app part windows ink workspace latter method causes space behind notes become blurred new version directly accepts pen input recognize words letters handwritten text new sticky notes provides stock information ticker typed written provides flight info flight number typed written cortana integration create reminders notes include date unlike windows 7 version version taskbar preview shows stock image rather notes user created originally jump list added back version 1.6.2 february 6 2017 sticky notes sync notes across multiple devices windows 10 also ios android devices running microsoft onenote web client edit sticky notes also available onenote website obscure codice_1 location | [
7879,
3937,
3263,
378,
2198,
6096,
1475,
7195,
5410,
7564,
2953,
422,
6844,
2245,
435,
5442,
4377,
5090,
3340,
5794,
7602,
6164,
4759,
1534,
6885,
7619,
2999,
5475,
6528,
2290,
4774,
1181,
3711,
5134,
7272,
1571,
5850,
140,
6558,
6575,
... | Test |
7,554 | 3 | L4_microkernel_family:l4 microkernel family l4 family second-generation microkernels generally used implement unix-like operating systems also used variety systems l4 like predecessor l3 microkernel created german computer scientist jochen liedtke response poor performance earlier microkernel-based operating systems liedtke felt system designed start high performance rather goals could produce microkernel practical use original implementation hand-coded intel i386-specific assembly language code 1993 sparked intense interest computer industry since introduction l4 developed platform independence also improving security isolation robustness various re-implementations original binary l4 kernel interface abi successors including l4ka :pistachio uni karlsruhe l4/mips unsw fiasco tu dresden wrmos wrmlab reason name l4 generalized longer refers liedtke original implementation applies whole microkernel family including l4 kernel interface different versions l4 widely deployed one variant okl4 open kernel labs shipped billions mobile devices specifying general idea microkernel liedtke states concept tolerated inside microkernel moving outside kernel i.e. permitting competing implementations would prevent implementation system required functionality spirit l4 microkernel provides basic mechanisms address spaces abstracting page tables providing memory protection threads scheduling abstracting execution providing temporal protection inter-process communication controlled communication across isolation boundaries operating system based microkernel like l4 provides services servers user space monolithic kernels like linux older generation microkernels include internally example order implement secure unix-like system servers must provide rights management mach included inside kernel poor performance first-generation microkernels mach led number developers re-examine entire microkernel concept mid-1990s asynchronous in-kernel-buffering process communication concept used mach turned one main reasons poor performance induced developers mach-based operating systems move time-critical components like file systems drivers back inside kernel somewhat ameliorated performance issues plainly violates minimality concept true microkernel squanders major advantages detailed analysis mach bottleneck indicated among things working set large ipc code expresses poor spatial locality results many cache misses in-kernel analysis gave rise principle efficient microkernel small enough majority performance-critical code fits first-level cache preferably small fraction said cache jochen liedtke set prove well designed thinner ipc layer careful attention performance machine-specific opposed platform independent design could yield massive real-world performance improvements instead mach complex ipc system l3 microkernel simply passed message without additional overhead defining implementing required security policies considered duties user space servers role kernel provide necessary mechanism enable user-level servers enforce policies l3 developed 1988 proved safe robust operating system used many years example tüv süd experience using l3 liedtke came conclusion several mach concepts also misplaced simplifying microkernel concepts even developed first l4 kernel primarily designed high performance mind order wring every bit performance entire kernel written assembly language ipc 20 times faster mach dramatic performance increases rare event operating systems liedtke work triggered new l4 implementations work l4-based systems number universities research institutes including ibm liedtke started work 1996 tu dresden unsw ibm thomas j. watson research center liedtke colleagues continued research l4 microkernel based systems general especially sawmill os 1999 liedtke took systems architecture group university karlsruhe continued research microkernel systems proof concept high performance microkernel could also constructed higher level language group developed l4ka :hazelnut c++ version kernel ran ia-32- arm-based machines effort success — performance still acceptable — release pure assembly language versions kernels effectively discontinued parallel development l4ka :hazelnut 1998 operating systems group tud os tu dresden dresden university technology started develop c++ implementation l4 kernel interface called l4/fiasco contrast l4ka :hazelnut allow concurrency kernel successor l4ka :pistachio allows interrupts kernel specific preemption points l4/fiasco fully preemptible exception extremely short atomic operations achieve low interrupt latency considered necessary l4/fiasco used basis drops hard real-time capable operating system also developed tu dresden however complexities fully preemptible design prompted later versions fiasco return traditional l4 approach running kernel interrupts disabled except limited number preemption points release l4ka :pistachio newer versions fiasco l4 microkernels inherently tied close underlying cpu architecture next big shift l4 development development platform-independent api still retained high performance characteristics despite higher level portability although underlying concepts kernel new api provided many significant changes relative previous l4 versions including better support multi-processor systems looser ties threads address spaces introduction user-level thread control blocks utcbs virtual registers releasing new l4 api version x.2 a.k.a version 4 early 2001 system architecture group university karlsruhe implemented new kernel l4ka :pistachio completely scratch focus high performance well portability released two-clause bsd license l4/fiasco microkernel also extensively improved years supports several hardware platforms ranging x86 amd64 several arm platforms notably version fiasco fiasco-ux run user-level application top linux l4/fiasco implements several extensions l4v2 api exception ipc enables kernel send cpu exceptions user-level handler applications help alien threads possible perform fine-grained control system calls x.2-style utcbs added furthermore fiasco contains mechanisms controlling communication rights well kernel-level resource consumption top fiasco collection basic user level services developed called l4env amongst others used para-virtualise current linux version 4.19 may 2019 called l4linux development also took place university new south wales unsw developers implemented l4 several 64-bit platforms work resulted l4/mips l4/alpha resulting liedtke original version retrospectively named l4/x86 like liedtke original kernels unsw kernels written mixture assembly c unportable implemented scratch release highly portable l4ka :pistachio unsw group abandoned kernels favor producing highly tuned ports l4ka :pistachio including fastest-ever reported implementation message passing 36 cycles itanium architecture group also demonstrated user-level device drivers perform well in-kernel drivers developed wombat highly portable version linux l4 runs x86 arm mips processors xscale processors wombat demonstrates context-switching costs 50 times lower native linux later unsw group new home nicta forked l4ka :pistachio new l4 version called nicta :l4-embedded name implies aimed use commercial embedded systems consequently implementation trade-offs favored small memory footprints aimed reduce complexity api modified keep almost system calls short enough need preemption points ensure high real-time responsiveness november 2005 nicta announced qualcomm deploying nicta l4 version mobile station modem chipsets led use l4 mobile phone handsets sale late 2006 august 2006 ertos leader unsw professor gernot heiser spun company called open kernel labs ok labs support commercial l4 users develop l4 commercial use brand name okl4 close collaboration nicta okl4 version 2.1 released april 2008 first generally available version l4 featured capability-based security okl4 3.0 released october 2008 last open-source version okl4 recent versions closed source based rewrite support native hypervisor variant called okl4 microvisor ok labs also distributed paravirtualized linux called ok linux descendant wombat well paravirtualized versions symbianos android ok labs also acquired rights sel4 nicta okl4 shipments exceeded 1.5 billion early 2012 mostly qualcomm wireless modem chips deployments include automotive infotainment systems apple mobile application processors beginning a7 contain secure enclave coprocessor running l4 operating system based l4-embedded kernel developed nicta 2006 implies l4 shipping ios devices total shipment estimated 310 million year 2015 2006 nicta group commenced from-scratch design third-generation microkernel called sel4 aim providing basis highly secure reliable systems suitable satisfying security requirements common criteria beyond beginning development aimed formal verification kernel ease meeting sometimes conflicting requirements performance verification team used middle-out software process starting executable specification written haskell sel4 uses capability-based access control enable formal reasoning object accessibility formal proof functional correctness completed 2009 proof provides guarantee kernel implementation correct specification implies free implementation bugs deadlocks livelocks buffer overflows arithmetic exceptions use uninitialised variables sel4 claimed first-ever general-purpose operating-system kernel verified sel4 takes novel approach kernel resource management exporting management kernel resources user level subjects capability-based access control user resources model also adopted barrelfish simplifies reasoning isolation properties enabler later proofs sel4 enforces core security properties integrity confidentiality nicta team also proved correctness translation c executable machine code taking compiler trusted computing base sel4 implies high-level security proofs hold kernel executable sel4 also first published protected-mode os kernel complete sound worst-case execution-time wcet analysis prerequisite use hard real-time systems 29 july 2014 nicta general dynamics c4 systems announced sel4 end end proofs released open-source licenses kernel source proofs gplv2 libraries tools 2-clause bsd license researchers state cost formal software verification lower cost engineering traditional high-assurance software despite providing much reliable results specifically cost one line code development sel4 estimated around compared traditional high-assurance systems darpa high-assurance cyber military systems hacms program nicta together project partners rockwell collins galois inc university minnesota boeing developed high-assurance drone based sel4 along assurance tools software planned technology transfer onto optionally piloted autonomous unmanned little bird helicopter development boeing final demonstration hacms technology took place sterling va april 2017 darpa also funded several small business innovative research sbir contracts related sel4 program started dr. john launchbury small businesses receiving sel4-related sbir included dornerworks techshot wearable inc real time innovations critical technologies osker os written haskell targeted l4 specification although project focused use functional programming language os development microkernel research per se codezero l4 microkernel targeting embedded systems focus virtualization implementation native os services gpl-licensed version version relicensed developers closed source forked 2010 f9 microkernel bsd-licensed l4 implementation built scratch deeply embedded devices performance arm cortex-m3/m4 processors power consumption memory protection mind fiasco.oc third generation microkernel evolved predecessor l4/fiasco fiasco.oc capability based supports multi-core systems hardware assisted virtualization completely redesigned user-land environment running top fiasco.oc called l4 runtime environment l4re provides framework build multi-component systems including client/server communication framework common service functionality virtual file-system infrastructure popular libraries c library libstdc++ pthreads platform also offers l4linux multi-architecture virtualized linux system l4re fiasco.oc run x86 ia-32 amd64 arm powerpc wip supersede previous system l4env l4/fiasco nova os virtualization architecture research project focus constructing secure efficient virtualization environment small trusted computing base nova consists microhypervisor user level virtual-machine monitor unprivileged componentised multi-server user environment running top called nul nova runs x86-based multi-core systems wrmos open source real time operating system rtos based l4 microkernel implementations kernel standard libraries network stack following architectures supported sparc arm x86 x86_64 wrmos kernel based l4 kernel reference manual version x.2 paravirtualized linux kernel w4linux working top wrmos | [
180,
1522,
2090,
6874,
5275,
2182,
5279,
4479,
7711,
3849,
5021,
4399,
4771,
1361,
6984,
7072,
2740,
7823,
6725,
5571,
578,
1284,
3544,
5232,
7554,
2859,
5055,
2226,
6208,
1959,
6921,
5504,
8111,
7570,
6472,
4175,
6385,
336,
3905,
4537,
... | Test |
7,555 | 2 | Package_format:package format package format type archive containing computer programs additional metadata needed package managers archive file format may unchanged package formats bear additional metadata manifest file certain directory layouts packages may contain either source code executable files packages may converted one type another software alien arch linux pacman slackware use tar archives generic naming specific internal structures | [
1807,
2179,
3938,
5017,
3613,
5726,
6422,
4675,
7528,
3271,
2559,
1471,
1100,
6443,
2581,
7555,
6117,
2589,
7201,
2594,
2240,
7584,
781,
5092,
7956,
5453,
5803,
7242,
462,
1535,
7619,
6892,
4400,
1176,
3366,
5480,
4778,
4059,
1955,
3384,
... | Validation |
7,556 | 2 | DOS_XL:dos xl dos xl discontinued disk operating system dos written paul laughton mark rose bill wilkinson mike peters published optimized systems software atari 8-bit family home computers designed compatible atari dos came shipped atari inc. disk drives direct descendant os/a+ dos xl provided additional features atari equipped floppy disk drives included single double density support command-line mode called command processor cp menu mode executable loaded memory batch file support support xl extended memory oss supercartridge banked memory later versions included axlon ramdisk support mosaic ramdisk support bit-3 support bug/65 addition supporting auto-booting codice_1 files dos xl batch features provided auto-booting batch feature naming batch file codice_2 would execute batch commands startup os/a+ unfortunately feature n't compatible programs e.g atariwriter dos xl distributed flippy disk one side single-density version double-density version features add-ons included placed double-density side due lack disk space manual dos xl subset os/a+ oss considered manual addendum os/a+ 150+ pages bound spine loose-leaf form like os/a+ manual dos xl came two versions 2.20 2.30 2.20 users pay 20 upgrade 2.30 last version 2.30p dos xl originally sold 30 price later increased 39 file writing verify turned dos xl due oss experience resulted faster writes virtually risk errors command file verify.com included reenable writes verify atari dos 2.0s default verified file writes disk several disk drive manufacturers shipped dos xl drives trak percom astra indus amdek rana c copy files p protect files version 2.30p newer version 2.30 fix two problems patch dos xl 2.30 make 2.30p plans dos xl 4 scrapped due low demand competition oss reissued os/a+ 4.1 mainly double-sided support dos xl along oss products became part icd catalog atari products january 1988 however dos xl dropped favor icd spartados | [
2076,
3748
] | Test |
7,557 | 9 | Comparison_of_multi-paradigm_programming_languages:comparison multi-paradigm programming languages programming languages grouped number types paradigms supported concise reference programming paradigms listed article | [
1445,
1450,
718,
6428,
3966,
1102,
4705,
6116,
422,
1889,
1892,
6497,
6498,
1901,
2619,
5091,
6507,
1908,
6886,
6888,
6172,
5117,
3368,
5482,
486,
4067,
4070,
5506,
4078,
5171,
160,
5190,
180,
3772,
8082,
2740,
3120,
7382,
8122,
5965,
2... | Test |
7,558 | 4 | Department_of_Defense_Information_Assurance_Certification_and_Accreditation_Process:department defense information assurance certification accreditation process dod information assurance certification accreditation process diacap united states department defense dod process means ensure companies organizations apply risk management information systems diacap defines dod-wide formal standard set activities general tasks management structure process certification accreditation c dod maintains information assurance ia posture throughout system life cycle note march 12 2014 though official transition take place may 2015 diacap replaced risk management framework rmf dod information technology although re-accreditations continue late 2016 systems yet started accreditation may 2015 transition rmf processes dod rmf aligns national institute standards technology nist risk management framework rmf diacap resulted nsa directed shift underlying security approaches interim version diacap signed july 6 2006 superseded interim ditscap guidance final version called department defense instruction 8510.01 signed march 12 2014 previous version november 28 2007 dodi 8500.01 cybersecurity http //www.dtic.mil/whs/directives/corres/pdf/850001_2014.pdf dodi 8510.01 risk management framework rmf dod information technology http //www.dtic.mil/whs/directives/corres/pdf/851001_2014.pdf diacap differs ditscap several ways—in particular embrace idea information assurance controls defined dodd 8500.1 dodi 8500.2 primary set security requirements automated information systems aiss ia controls determined based system mission assurance category mac confidentiality level cl | [
5568,
7567,
1301,
4036,
4440
] | Test |
7,559 | 2 | Federico_Heinz:federico heinz federico heinz argentinian programmer free software advocate living london co-founder current president fundación vía libre non-profit organization promotes free flow knowledge motor social progress use development free software helped legislators argentina ing dragan dr. conde peru dr. villanueva draft defend legislation demanding use free software areas public administration works google uk office speaks fluent spanish english german | [
707,
3938,
1822,
2559,
5757,
3981,
5759,
412,
761,
2599,
5787,
2260,
4020,
1523,
2985,
6876,
462,
4401,
5829,
1192,
1563,
4070,
4435,
2689,
3404,
5515,
2698,
3084,
1637,
6981,
3780,
4872,
578,
7740,
589,
3133,
6674,
966,
968,
8149,
8158... | Test |
7,560 | 4 | Cyber_Essentials:cyber essentials cyber essentials uk government information assurance scheme operated national cyber security centre ncsc encourages organisations adopt good practice information security includes assurance framework simple set security controls protect information threats coming internet developed collaboration industry partners including information security forum isf information assurance small medium enterprises consortium iasme british standards institution bsi endorsed uk government launched 2014 department business innovation skills organisations earn two levels certification badges annual recertification recommended certifying bodies turn licensed accreditation bodies appointed uk government five current accreditation bodies apmg crest iasme irm security qg council registered ethical security testers crest developed assessment framework iasme incorporated cyber essentials wider iasme information assurance standard iso/iec 27001 organisations may choose limit scope certification certain subset business five main technical controls cyber essentials guidance breaks finer details controls mapped controls required iso/iec 27001 standard good practice iasme governance although cyber essentials narrower focus emphasising technical controls rather governance risk policy cyber essentials scheme launched 5 june 2014 several organisations quickly certified end june since october 2014 cyber essentials certification required suppliers central uk government handle certain kinds sensitive personal information intended encourage adoption businesses wishing bid government contracts insurers suggested certified bodies may attract lower insurance premiums 6,000 cyber essentials certificates awarded businesses organisations wannacry ransomware attack nhs digital refused finance £1 billion estimated cost meeting cyber essentials plus standard saying would constitute value money invested £60 million planned plan spend £150 million address key cyber security weaknesses next two years | [
7815,
3454,
4648,
284,
308,
4440,
6526
] | Validation |
7,561 | 9 | MIVA_Script:miva script miva script proprietary computer scripting language mainly used internet applications e-commerce 2015 developed maintained owned miva merchant inc. based san diego california many web hosting companies support miva script servers significantly less widespread popular web languages language first developed name htmlscript joe austin others 1995 company htmlscript corporation formed following year origins miva script began 1993 david haldy joseph austin built first version htmlscript first version written programming language perl called logic enhanced html lehtml joseph austin wrote wrapper programming language c let start root process downgrade immediately ownership permissions owner script file wrapper made suitable use hosting service called volant turnpike time joseph austin eventually sold volant turnpike dave haldy perl allowed self-executing code lehtml expression analyzer parsed expression perl syntax passed perl volant turnpike users liked using lehtml joseph austin ron ahern wrote expression analyzer re-implemented lehtml syntax c language joseph austin called end result htmlscript registered name united states patent trademark office uspto joseph austin troy mccasland derek finley founders company called htmlscript corporation htmlscript concept loop low server processing power time would enough bring whole server even one program ran away joseph austin implement loop make impossible htmlscript server process run away also implemented macro first version htmlscript would allow self-executing code macro powerful eventually security issues 1997 jon burchmore extensively rewrote language make syntactically consistent although new engine supported old htmlscript new named mivascript syntaxes jon burchmore rewrote htmlscript syntax joe developed help softquad using emerging xml standard jon burchmore wrote replacement koolkat became miva merchant new end-product supported old htmlscript syntax new named miva script syntaxes october 14 1997 htmlscript ’ name changed miva script company name changed miva soon afterward miva merchant followed suit name product name miva comes egyptian hieroglyphics word cat word cat combination two symbols milk basin followed quail milk basin pronounced mee quail pronounced waa combined say cat joseph austin thought clever called koolkat “ electronic cat alog. ” joseph showed german friend could pronounce waa sound instead kept pronouncing va joseph austin registered domain miva.com filed trademark 1998 firm renamed miva corporation 1998 first version miva merchant came 2002 miva script compiler delivered htmlscript syntax macros dropped engine miva corporation sold 2003 mid-cap public company called findwhat subsequently findwhat bought name miva 2007 russell carroll group investors bought original miva technologies customer base miva started miva merchant inc. miva script often described 'xml-like although something misnomer consists tags may interspersed html xhtml start mv paired stand-alone empty tags version 4.14 miva script interpreted miva script engine empresa version 4.00 introduced compiler boosting performance significantly one distinguishing features miva script native support variation dbase database platform dbf iii tables proprietary index format support sql many installations today running mysql database variables untyped pre-declared miva script uses file extensions .mv .mvc .mvt common file extension runtime compiled template source files empresa underlying engine miva script versions numbered less 4.0 miva merchant empresa script interpreter available web servers running *nix microsoft windows operating systems recent interpreter version 3.9705 interpreted miva script still widely supported many web hosts versions numbered 3.9x transitional form language implementing new features found version 4 arrays since 4.0 miva merchant empresa virtual machine running compiled miva script available versions *nix microsoft windows current version level 5.x added new language constructs native sql support new access-methodology dbase3 tables called miva-sql new templating syntax empresa virtual machine compile fly version 5.08 later support gd graphics library miva merchant mia version empresa engine designed run windows pc localhost server watching specified port usually 8000 8080 server software needed unless post office protocol pop smtp functions used provides portable stand-alone development environment miva merchant mia updated miva merchant empresa release like empressa versions pre-4 interpreters post-4.0 work compiled script minor differences miva merchant script compiler introduced mid-2002 claiming offer better performance closure application source code compilability required changes language support old htmlscript syntax macros evaluated runtime often considered security risk dropped compiler produces platform-independent bytecode runs miva merchant empresa miva merchant mia virtual machines minor variations exist empresa mia virtual machines may 2005 miva corporation made script compiler available free 2011 built licensing code removed simplifying installation august 2007 miva merchant separated parent company due management buy-out ref press release miva script 5.0 introduced page template compiler command basis miva merchant storemorph trade page template system compiler within compiler offers simplified subset full language suitable end user creation editing web page templates storemorph trade pages allow modular components created mivascript added template extending capabilities february 2011 introduced new mivascript.com website fully documenting latest version language including gd graphics library | [
1361,
6507,
3255,
5983,
8137,
3915,
4759,
5571,
6908,
1435
] | Test |
7,562 | 4 | LAIM_Working_Group:laim working group laim log anonymization information management working group nsf onr funded research group national center supercomputing applications direction adam slagell work group focuses upon log anonymization internet privacy laim group established 2005 released 3 different log anonymization tools canine scrub-pa flaim flaim tool still active development | [] | Test |
7,563 | 7 | Bracket_Computing:bracket computing bracket computing cloud computing company founded 2011 tom gillis jason lango previously ironport systems based mountain view california 2015 company raised 45 million investment round led fidelity goldman sachs bringing funding total 130 million primary software offering called computing cell october 2015 company employed 70 people planned hire software engineers 1 may 2018 vmware announced tom gillis lead vmware network security business unit vmware intends acquire bracket computing intellectual property members bracket staff bracket computing website redirects 403 forbidden page | [
4295,
2961
] | Test |
7,564 | 2 | Mandatory_Integrity_Control:mandatory integrity control context microsoft windows family operating systems mandatory integrity control mic core security feature introduced windows vista implemented subsequent desktop line windows operating systems adds integrity levels il -based isolation running processes il represents level trustworthiness object mechanism goal use pre-existing integrity control policies involved objects il selectively restrict access permissions contexts considered potentially less trustworthy compared contexts running user account trusted mandatory integrity control defined using new access control entry ace type represent object il security descriptor windows access control lists acls used grant access rights read write execute permissions privileges users groups il assigned subject access token initialized subject tries access object example file security reference monitor compares integrity level subject access token integrity level object security descriptor windows restricts allowed access rights depending whether subject il higher lower object depending integrity policy flags new access control entry ace security subsystem implements integrity level mandatory label distinguish discretionary access user control acls provide windows vista defines four integrity levels low sid s-1-16-4096 medium sid s-1-16-8192 high sid s-1-16-12288 system sid s-1-16-16384 default processes started regular user gain medium il elevated processes high il introducing integrity levels mic allows classes applications isolated enabling scenarios like sandboxing potentially-vulnerable applications internet-facing applications processes low il called low-integrity processes less access processes higher ils access control enforcement windows objects access control lists named objects including files registry keys even processes threads entry system access control list governing access defines minimum integrity level process use object windows makes sure process write delete object integrity level equal higher requested integrity level specified object additionally privacy reasons process objects higher il out-of-bounds even read access processes lower il consequently process interact another process higher il process perform functions inject dll higher il process using codice_1 api function send data different process using codice_2 function processes inherit integrity level process spawned integrity level customized time process creation well defining boundary window messages user interface privilege isolation uipi technology mandatory integrity control used applications like adobe reader google chrome internet explorer windows explorer isolate documents vulnerable objects system internet explorer 7 introduces mic-based protected mode setting control whether web page opened low-integrity process provided operating system supports mic based security zone settings thereby preventing classes security vulnerabilities since internet explorer case runs low il process modify system level objects—file registry operations instead virtualized adobe reader 10 google chrome two notable applications introducing technology order reduce vulnerability malware microsoft office 2010 introduced protected view isolated sandbox environment excel powerpoint word prohibits potentially unsafe documents modifying components files resources system protected view operates low-integrity process windows vista later versions windows uses mic uipi restrict sandbox however cases higher il process need execute certain functions lower il process lower il process need access resources higher il process access example viewing webpage protected mode save file downloaded internet folder specified user high il low il processes still communicate using files named pipes lpc shared objects shared object must integrity level low low il process shared low il high il processes since mic prevent low il process sharing objects higher il process trigger flaws higher il process work behalf low il process thereby causing squatting attack shatter attacks however prevented using user interface privilege isolation takes advantage mic | [
7879,
3937,
3263,
378,
2198,
5378,
6096,
3962,
1475,
2577,
7553,
7195,
5410,
2953,
422,
6844,
2245,
435,
5442,
4377,
5090,
3340,
7602,
6164,
2631,
4759,
1534,
6885,
7619,
2999,
5475,
6528,
2290,
4774,
1181,
3711,
5134,
7272,
1571,
5850,
... | Test |
7,565 | 8 | Devices_Profile_for_Web_Services:devices profile web services devices profile web services dpws defines minimal set implementation constraints enable secure web service messaging discovery description eventing resource-constrained devices objectives similar universal plug play upnp addition dpws fully aligned web services technology includes numerous extension points allowing seamless integration device-provided services enterprise-wide application scenarios dpws specification initially published may 2004 submitted standardization oasis july 2008 dpws 1.1 approved oasis standard together ws-discovery 1.1 soap-over-udp 1.1 june 30 2009 dpws defines architecture devices run two types services hosting services hosted services hosting services directly associated device play important part device discovery process hosted services mostly functional depend hosting device discovery addition hosted services dpws specifies set built-in services dpws builds following core web services standards wsdl 1.1 xml schema soap 1.2 ws-addressing comprises ws-metadataexchange ws-transfer ws-policy ws-security ws-discovery ws-eventing microsoft windows vista windows embedded ce6r2 platforms natively integrate dpws stack called wsdapi included part windows rally technologies support osgi way dpws supports dynamic discovery part evolving vision distributed applications leverage ws-* standards application automation environments clear 2007 consumer electronics show “ next gen ” home highlighted automation system life|ware exceptional innovation uses dpws communicate lighting system audio distribution system security system motorized shades security cameras thermostats washers dryers motorized television mount show demonstrated tremendous consumer interest prospect bringing controllable devices environment digital entertainment manufacturers taking notice many manufacturers first step towards dpws adoption creation small “ device bridge ” native usually proprietary code web services least 117 automation av products 37 different vendors currently support dpws either natively bridge international security controls isc trade show major security company demonstrated security system supported dpws kitchen bath show kbis saw two major appliance manufacturers demonstrating washers dryers communicated using dpws communicative oven demonstrated international building show past two years even greater sign drive towards market acceptance dpws introduced-in-2006 connectedlife.home home automation package offered us retailer best buy package uses automation software controllable devices leverage dpws communications within sirena project auspices european research initiative itea schneider electric produced early dpws implementation targeted embedded devices implementation open-sourced soa4d.org soa devices website dpws stack c java versions add-ons like ws-management ws-security implementations freely downloaded also stemming sirena project web services devices ws4d.org website provides information downloads news three dpws implementations one c implementation integrating gsoap one java implementation using axis another java implementation use different java editions including java following sirena project new european research project itea named soda service oriented device delivery architecture went development implementation embedded dpws stack devices associated tools eu research project socrades composed heavyweights like abb sap schneider electric siemens focusing implementing testing piloting prototypes dpws-enabled devices industrial automation domain extending work eu aesop project several proposals and/or projects worked integration dpws osgi i.e mainly providing implementation java framework | [
5631,
5111,
4770,
7252,
6986,
302,
1760,
5500,
5850,
1409,
3498,
7136,
7315
] | Test |
7,566 | 5 | XSwitch:xswitch xswitch interconnect used xcore processor interconnect protocol defined xmos based around routing messages comprising 9-bit tokens cores network protocol specifically designed on-chip board-level communication using lvds drivers also run longer cables interconnect routes sequences messages message consists header specifies core address sequence tokens end-token 512 tokens 256 data tokens 256 control tokens data tokens used transport data e.g audio data stream control tokens used send in-band control data order implement protocols interconnect message routed sequence switches interconnected xlinks two control tokens used end message end ends message pause suspends message tokens free route switches difference end pause end token delivered receiver whereas pause token silently thrown away last switch since messages terminated token rather packet length sender may choose terminate message creates open circuit guaranteed bandwidth latency applications use example one series links form circuit stream audio use another series links small packets containing control data circuits guarantee order delivery tokens transmitted messages may delivered order multiple paths circuits permanently occupy series links whereas messages occupy links short periods time xswitch interconnect architecture implements media layer osi model physical layer signal either transmitted using serial protocol two wires using fast protocol five wires cases signal transmitted series transitions using 1 code two-wire system transition wire 0 signals 0 bit transition wire 1 signals 1 bit token transmitted sequence exactly 10 transitions first eight signal eight data bits msb first one bit signal whether control token finally return-to-zero bit returns wires zero nine transitions one wire high five-wire system four data wires 0 1 2 3 transition 0 signals '00 transition 1 signals '01 etc sequence four transitions transmits eight data bits fifth wire escape wire used transmit control tokens unlike two-wire system even number wires high token wires return zero end message modes degree asynchronous clock transitions signal data order transitions signal order bits transmitter must transmit data faster receiver interpret data must make sure sufficient gaps edges overtake pads data transmission suspended time link layer protocol relies use credits order signal whether data transmitted receivers always issue credits transmitter transmitter allowed send data link give 8 32 64 credits never issue 127 credits guarantees side always record credits using 7 bit counters conversely large numbers credits given link needs large receive buffers minimum size receive buffer 8 tokens 72 bits network layer routes messages interconnect nodes network identified means 16-bit address messages routed successively matching bits destination address every node message brought closer destination taking first non matching bit looking set links used destination message routed link route rolled end pause control token found given header precedes packet implements wormhole routing routing set deadlock free free starvation interconnects arbitrate incoming messages without locking link switches xcore xs1-g4 xcore xs1-l1 xcore-200 processors implementations xswitch implementations differ terms number internal external links supported xs1-g4 switch 32 links 16 links external links operate speed 400 mbits per second 16 links connected four cores four links per core internal links operate 3.2 gbits per second maximum throughput implementation xswitch 57.6 gbits per second 6.4 gbit per second external links 51.2 gbits per second internal links xs1-l1 switch 12 links eight links external links operate speed 400 mbits per second four links connected internally core internal links operate 3.2 gbits per second maximum throughput implementation xswitch 16 gbits per second 3.2 gbit per second external links 12.8 gbits per second internal links xcore200 switch 17 links eight input links links external links operate speed 400 mbits per second eight links internal connected cores four core internal links operate 4 gbits per second final link connected on-chip usb phy maximum throughput implementation xswitch 35.25 gbits per second 3.2 gbit per second external links 32 gbits per second internal links plus 0.05 gbit/s final internal link | [
5492,
1988
] | Test |
7,567 | 4 | Public_key_infrastructure:public key infrastructure public key infrastructure pki set roles policies hardware software procedures needed create manage distribute use store revoke digital certificates manage public-key encryption purpose pki facilitate secure electronic transfer information range network activities e-commerce internet banking confidential email required activities simple passwords inadequate authentication method rigorous proof required confirm identity parties involved communication validate information transferred cryptography pki arrangement binds public keys respective identities entities like people organizations binding established process registration issuance certificates certificate authority ca depending assurance level binding may carried automated process human supervision pki role assures valid correct registration called registration authority ra ra responsible accepting requests digital certificates authenticating entity making request microsoft pki registration authority usually called subordinate ca entity must uniquely identifiable within ca domain basis information entity third-party validation authority va provide entity information behalf ca x.509 standard defines commonly used format public key certificates public key cryptography cryptographic technique enables entities securely communicate insecure public network reliably verify identity entity via digital signatures public key infrastructure pki system creation storage distribution digital certificates used verify particular public key belongs certain entity pki creates digital certificates map public keys entities securely stores certificates central repository revokes needed pki consists broadly speaking traditionally three approaches getting trust certificate authorities cas web trust wot simple public key infrastructure spki primary role ca digitally sign publish public key bound given user done using ca private key trust user key relies one trust validity ca key ca third party separate user system called registration authority ra may may separate ca key-to-user binding established depending level assurance binding software human supervision term trusted third party ttp may also used certificate authority ca moreover pki often used synonym ca implementation model trust relationships ca trusted third party – trusted subject owner certificate party relying upon certificate according netcraft industry standard monitoring active transport layer security tls certificates states that- although global tls ecosystem competitive dominated handful major cas — three certificate authorities symantec comodo godaddy account three-quarters issued tls certificates public-facing web servers top spot held symantec verisign purchased symantec ever since survey began currently accounting third certificates illustrate effect differing methodologies amongst million busiest sites symantec issued 44 valid trusted certificates use — significantly overall market share approach involves server acts offline certificate authority within single sign-on system single sign-on server issue digital certificates client system never stores users execute programs etc temporary certificate common find solution variety x.509-based certificates alternative approach problem public authentication public key information web-of-trust scheme uses self-signed certificates third party attestations certificates singular term web trust imply existence single web trust common point trust rather one number potentially disjoint webs trust examples implementations approach pgp pretty good privacy gnupg implementation openpgp standardized specification pgp pgp implementations allow use e-mail digital signatures self-publication public key information relatively easy implement one web trust one benefits web trust pgp inter-operate pki ca fully trusted parties domain internal ca company willing guarantee certificates trusted introducer web trust completely trusted nature web trust trusting one certificate granting trust certificates web pki valuable standards practices control issuance certificates including pgp personally instituted web trust could significantly degrade trustworthiness enterprise domain implementation pki web trust concept first put forth pgp creator phil zimmermann 1992 manual pgp version 2.0 another alternative deal public authentication public key information simple public key infrastructure spki grew three independent efforts overcome complexities x.509 pgp web trust spki associate users persons since key trusted rather person spki use notion trust verifier also issuer called authorization loop spki terminology authorization integral design emerging approach pki use blockchain technology commonly associated modern cryptocurrency since blockchain technology aims provide distributed unalterable ledger information qualities considered highly suitable storage management public keys cryptocurrencies support storage different public key types ssh gpg rfc 2230 etc provides open source software directly supports pki openssh servers blockchain technology approximate proof work often underpinning confidence trust relying parties pki issues remain administrative conformance policy operational security software implementation quality certificate authority paradigm issues regardless underlying cryptographic methods algorithms employed pki seeks endow certificates trustworthy properties must also address issues list known blockchain-based pki developments pki occurred early 1970s british intelligence agency gchq james ellis clifford cocks others made important discoveries related encryption algorithms key distribution however developments gchq highly classified results work kept secret publicly acknowledged mid-1990s public disclosure secure key exchange asymmetric key algorithms 1976 diffie hellman rivest shamir adleman changed secure communications entirely development high-speed digital electronic communications internet predecessors need became evident ways users could securely communicate consequence ways users could sure actually interacting assorted cryptographic protocols invented analyzed within new cryptographic primitives could effectively used invention world wide web rapid spread need authentication secure communication became still acute commercial reasons alone e.g. e-commerce online access proprietary databases web browsers sufficient taher elgamal others netscape developed ssl protocol 'https web urls included key establishment server authentication prior v3 one-way pki structure thus created web users/sites wishing secure communications vendors entrepreneurs saw possibility large market started companies new projects existing companies began agitate legal recognition protection liability american bar association technology project published extensive analysis foreseeable legal aspects pki operations see aba digital signature guidelines shortly thereafter several u.s. states utah first 1995 jurisdictions throughout world began enact laws adopt regulations consumer groups raised questions privacy access liability considerations taken consideration jurisdictions others enacted laws regulations differed technical operational problems converting pki schemes successful commercial operation progress much slower pioneers imagined would first years 21st century underlying cryptographic engineering clearly easy deploy correctly operating procedures manual automatic easy correctly design even designed execute perfectly engineering required standards existed insufficient pki vendors found market quite market envisioned mid-1990s grown slowly somewhat different ways anticipated pkis solved problems expected several major vendors gone business acquired others pki success government implementations largest pki implementation date defense information systems agency disa pki infrastructure common access cards program pkis one type another several vendors many uses including providing public keys bindings user identities used argue purchasing certificates securing websites ssl securing software code signing costly venture small businesses however emergence free alternatives let encrypt changed presently symantec holds major share pki certificate market sold one third certificates issued globally 2013 http/2 latest version http protocol allows unsecured connections theory practice major browser companies made clear would support state-of-art protocol pki secured tls connection web browser implementation http/2 including edge microsoft chrome google firefox mozilla opera supports http/2 tls using alpn extension tls protocol would mean get speed benefits http/2 website owners would forced purchase ssl certificates controlled corporations symantec current web browsers carry pre-installed intermediary certificates issued signed certificate authority means browsers need carry large number different certificate providers increasing risk key compromise key known compromised could fixed revoking certificate compromise easily detectable huge security breach browsers issue security patch revoke intermediary certificates issued compromised root certificate authority practical security vulnerabilities x.509 certificates known cases keys stolen major certificate authority listed | [
363,
6795,
2193,
1460,
2566,
5399,
38,
5052,
6458,
7558,
2587,
7925,
2598,
2239,
5773,
7214,
6489,
84,
1513,
2620,
7953,
794,
3350,
458,
1168,
1173,
6894,
2644,
112,
6179,
5824,
1186,
6540,
496,
6553,
5850,
4071,
516,
2691,
3057,
3426,
... | Test |
7,568 | 4 | Joseph_Wenger:joseph wenger joseph numa wenger june 7 1901 – september 2 1970 rear-admiral united states navy served first deputy director armed forces security agency afsa later first vice director national security agency december 1952 november 1953 separate divisions afsa merged nsa wenger one leaders responsible development nsa native patterson louisiana wenger one architects centralized cryptology february 1942 navy power struggles led ousting laurance safford op-20-g two new sections headed wenger communications decryption translation john r. redman communications combat intelligence safford removed current intelligence support research role safford sidelined remainder war ultimately joseph rochefort wenger integral starting afsa armed forces security agency predecessor nsa world war ii suggested navy spend 2 million build 360 four wheel bombes break effective british monopoly bombe died 1970 | [
202,
4730,
4988,
7191,
7895,
228,
4666,
258,
3335,
4727
] | Test |
7,569 | 5 | Serial_communication:serial communication telecommunication data transmission serial communication process sending data one bit time sequentially communication channel computer bus contrast parallel communication several bits sent whole link several parallel channels serial communication used long-haul communication computer networks cost cable synchronization difficulties make parallel communication impractical serial computer buses becoming common even shorter distances improved signal integrity transmission speeds newer serial technologies begun outweigh parallel bus advantage simplicity need serializer deserializer serdes outstrip disadvantages clock skew interconnect density migration pci pci express example many serial communication systems originally designed transfer data relatively large distances sort data cable practically long-distance communication transmits data one bit time rather parallel reduces cost cable cables carry data serial cable computer ports plug usually referred specific name reduce confusion keyboard mouse cables ports almost invariably serial—such ps/2 port apple desktop bus usb cables carry digital video almost invariably serial—such coax cable plugged hd-sdi port webcam plugged usb port firewire port ethernet cable connecting ip camera power ethernet port fpd-link etc cables ports transmitting data one bit time include serial ata serial scsi ethernet cable plugged ethernet ports display data channel using previously reserved pins vga connector dvi port hdmi port many communication systems generally designed connect two integrated circuits printed circuit board connected signal traces board rather external cables integrated circuits expensive pins reduce number pins package many ics use serial bus transfer data speed important examples low-cost serial buses include rs-232 spi i²c dc-bus uni/o 1-wire pci express ic serial bus may typically implemented using multiplexer utilizes technique called multiplexing communication links across computers parts computers talk one another may either serial parallel parallel link transmits several streams data simultaneously along multiple channels e.g. wires printed circuit tracks optical fibers whereas serial link transmits single stream data although serial link may seem inferior parallel one since transmit less data per clock cycle often case serial links clocked considerably faster parallel links order achieve higher data rate several factors allow serial clocked higher rate many cases serial cheaper implement parallel many ics serial interfaces opposed parallel ones fewer pins therefore less expensive | [
8063,
5208,
4768,
2099,
3362,
1836,
4321,
2114,
1374,
6014,
2117,
831,
7905,
4786,
5492,
7834,
3207,
4062,
4970,
1022,
2236,
8015,
6754,
1778,
1317,
5175,
8139,
3828,
5880,
3918,
3755,
6786
] | Validation |
7,570 | 4 | Principle_of_least_privilege:principle least privilege information security computer science fields principle least privilege polp also known principle minimal privilege principle least authority requires particular abstraction layer computing environment every module process user program depending subject must able access information resources necessary legitimate purpose principle means giving user account process privileges essential perform intended function example user account sole purpose creating backups need install software hence rights run backup backup-related applications privileges installing new software blocked principle applies also personal computer user usually work normal user account opens privileged password protected account superuser situation absolutely demands applied users terms least user access least-privileged user account lua also used referring concept user accounts times run privileges possible also launch applications privileges possible principle least privilege widely recognized important design consideration enhancing protection data functionality faults fault tolerance malicious behavior computer security benefits principle include practice exist multiple competing definitions true least privilege program complexity increases exponential rate number potential issues rendering predictive approach impractical examples include values variables may process addresses need precise time things required object capability systems allow instance deferring granting single-use privilege time used currently closest practical approach eliminate privileges manually evaluated unnecessary resulting set privileges typically exceeds true minimum required privileges process another limitation granularity control operating environment privileges individual process practice rarely possible control process access memory processing time i/o device addresses modes precision needed facilitate precise set privileges process require original formulation jerome saltzer peter j. denning paper fault tolerant operating systems set broader perspective among four fundamental principles fault tolerance dynamic assignments privileges earlier discussed roger needham 1972 historically oldest instance least privilege probably source code login.c begins execution super-user permissions and—the instant longer necessary—dismisses via setuid non-zero argument demonstrated version 6 unix source code kernel always runs maximum privileges since operating system core hardware access one principal responsibilities operating system particularly multi-user operating system management hardware availability requests access running processes kernel crashes mechanisms maintains state also fail therefore even way cpu recover without hard reset security continues enforced operating system properly respond failure possible detect failure kernel execution either halted program counter resumed execution somewhere endless and—usually—non-functional loop would akin either experiencing amnesia kernel execution failure trapped closed maze always returns starting point closed loops execution picks crash loading running trojan code author trojan code usurp control processes principle least privilege forces code run lowest privilege/permission level possible means code resumes code execution-whether trojan simply code execution picking unexpected location—would ability perform malicious undesirable processes one method used accomplish implemented microprocessor hardware example intel x86 architecture manufacturer designed four ring 0 ring 3 running modes graduated degrees access-much like security clearance systems defence intelligence agencies implemented operating systems processes execute potential privilege set active privilege set privilege sets inherited parent determined semantics fork executable file performs privileged function—thereby technically constituting component tcb concomitantly termed trusted program trusted process—may also marked set privileges logical extension notions set user id set group id inheritance file privileges process determined semantics exec family system calls precise manner potential process privileges actual process privileges file privileges interact become complex practice least privilege practiced forcing process run privileges required task adherence model quite complex well error-prone trusted computer system evaluation criteria tcsec concept trusted computing base tcb minimization far stringent requirement applicable functionally strongest assurance classes viz b3 a1 evidentiarily different functionally identical least privilege often associated privilege bracketing assuming necessary privileges last possible moment dismissing soon longer strictly necessary therefore ostensibly reducing fallout erroneous code unintentionally exploits privilege merited least privilege also interpreted context distribution discretionary access control dac permissions example asserting giving user u read/write access file f violates least privilege u complete authorized tasks read permission | [
180,
4469,
2090,
4759,
7334,
5904,
5021,
5814,
6427,
4771,
2105,
7072,
3368,
123,
1743,
5571,
2577,
2486,
5401,
6823,
7554,
2859,
5149,
5504,
6748,
8111,
1217,
2326,
6136,
2879,
7213,
5962,
3493,
2251,
6770,
1237,
2615,
4834,
4913,
7414,
... | Test |
7,571 | 4 | Justine_Tunney:justine tunney justine alexandra roberts tunney born c. 1985 software developer former occupy movement activist blogger like many former black hat hackers kevin mitnick tunney participated sides cybersecurity black hat white hat tunney case first computer hacker later life volunteer fixing security vulnerabilities open source software 1999 age 14 operating online name oogle tunney built rampage toolz 2.o exploiting security vulnerabilities aol sending spam tunney said rampage toolz popular third-party aol prog time ran ads site height dot-com boom earned hundreds dollars month teenager know tunney stated never heard google time similar name oogle coincidence tunney published screenshots rampage toolz oogle.net website source code tool statute limitations expired 2016 employee google tunney discovered open source projects github vulnerable security vulnerability discovered five months previously software library projects used called apache commons collections started raising pull requests github fix problems recruiting volunteers scale problem became apparent team volunteers swelled 50 google employees working 20 time ultimately tunney coworkers used bigquery discover vulnerable github software projects discovered 2,600 projects time directly indirectly vulnerable sent pull requests close security holes also raised public awareness severe cybersecurity threat posed continued use vulnerable versions libraries subsequent post google open source blog effort noting san francisco municipal transportation agency recently hacked ransomware due usage vulnerable version apache commons collections 2011 kalle lasn founder left-wing magazine adbusters put call activists occupy wall street response perceived political corruption american democracy wall street context 2008 financial crisis aftermath tunney one first individuals respond lasn call quickly creating occupywallst twitter handle occupywallst.org web site july 14 2011 became main online hub occupy movement february 2014 tunney took back exclusive control occupy wall street twitter account originally created removing posting access activists previously access stated founding organizer movement wrote locked twitter account partly order keep mouthpiece democratic party also said large number twitter users misogynist transphobic tunney described occupy wall street far-left movement former comrades described technocratic fascist written viewed activists within occupy wall street disagreed taking initiative ows movement sat meetings trying devise ways boss around unskilled unintelligent parasites tunney vocal supporter gamergate movement contributed unsuccessful crowdfunding campaign create gamergate movement website posted support gamergate movement occupy wall street twitter account tunney prolific blogger twitter user often writes political topics twitter personal blogs websites political writing sometimes controversial extreme degree daily dot vice various twitter users speculated might trolling performing online performance art might expressing sincerely held views daily dot cited tunney saying free speech rights respected techies progressives hopefully 'll live see day muckraking progressive reporters/bloggers sent prisons tunney characterised activities trolling multiple times since march 2014 response question put askfm regards asker suspicion tunney trying deliberately piss liberals tunney wrote answer included sentence favorite tactic trolling progressives simply use newspeak tunney also said trolling way get away saying certain things current regime tunney said entirely different person offline 2014 tunney petitioned us government people hold referendum asking support retire government employees full pensions transfer administrative authority technology industry appoint google chairman eric schmidt ceo america tunney works software engineer google petition expired failed meet people signature threshold doctors found tumor 2012 since removed | [
1376,
3932,
2317
] | Test |
7,572 | 3 | Macintosh_Quadra_660AV:macintosh quadra 660av macintosh quadra 660av originally called macintosh centris 660av personal computer designed manufactured sold apple computer inc. july 1993 september 1994 introduced alongside quadra 840av av model numbers signifies video input output capabilities enhanced audio 660av discontinued months introduction power macintosh 6100/60av apple also sold power macintosh upgrade card upgraded 660av match 6100/60av specifications users ready move powerpc quadra 630 also suitable replacement 660av uses pizza box form factor earlier centris 610 660av full motorola 68040 instead 610 fpu-less 68lc040 like 840av 660av features video input/output capability onboard 3210 digital signal processor clocked 55 mhz make video handling less burden cpu 660av also first macintosh include geoport optional geoport telecom adapter enables fax modem capabilities earliest centris 660avs older auto-inject floppy drive opening similar 610 centris models quadra models drive similar power macintosh 6100 lacking ‘ auto-inject ’ feature models deep round indent center floppy drive slot make possible insert disk way quadra av macs introduced new universal rom codenamed supermario would later used powerpc systems includes scsi manager 4.3 sound manager 3.0 also vectorized making easier patch introduced july 29 1993 introduced october 1 1993 | [
7890,
5732,
722,
1094,
2926,
5037,
5752,
2954,
6482,
6142,
4373,
7226,
2978,
7601,
4749,
3346,
5100,
6165,
4389,
5463,
102,
5469,
4768,
3008,
5477,
6200,
6202,
3387,
3390,
1216,
2331,
4820,
4453,
1234,
1237,
7311,
889,
550,
552,
5916,
3... | Validation |
7,573 | 9 | McCLIM:mcclim mcclim free software implementation common lisp interface manager project named mike mcdonald person started | [
7878,
1445,
6796,
6087,
6428,
5734,
1840,
2568,
1478,
4704,
405,
6116,
1116,
6471,
2600,
5077,
1889,
5786,
1895,
5787,
4017,
5091,
1152,
1154,
4759,
6886,
6888,
2639,
3368,
1557,
486,
5494,
5501,
6210,
144,
3398,
6933,
7298,
5515,
8025,
... | Test |
7,574 | 4 | White_Ops:white ops white ops ad verification bot detection cybersecurity firm white ops cofounded chief scientist dan kaminsky 2012 white ops president michael tiffany ash kalb tamer hassan ceo company gene fay company ’ coo headquartered new york city international offices 2016 discovered methbot network bots six thousand online publishers platforms affected including facebook generating 3- 5 million fraudulent ad revenue per day 2017 white ops uncovered 3ve bot network one largest ad fraud enterprises yet discovered 1.7 infected computers leading thirteen department justice indictments 2018 investigation network google fbi originally operating prevent ad fraud online 2018 white ops expanded ad fraud activities include television detects bots bot networks uses human verification part process processes trillion transactions per month 2018 white ops produced reports ad fraud association national advertisers since 2014 2017 white ops began partnering trade desk block fraudulent impressions advertisers make bids following year 2018 whiteops began similar partnership beachfront media video management platform telaria white ops also partners adobe advertising cloud provide independent third-party bot detection 2019 white ops began partnering media.net | [] | Validation |
7,575 | 2 | Adaptive_replacement_cache:adaptive replacement cache adaptive replacement cache arc page replacement algorithm better performance lru least recently used accomplished keeping track frequently used recently used pages plus recent eviction history algorithm developed ibm almaden research center 2006 ibm granted patent adaptive replacement cache policy basic lru maintains ordered list cache directory resource entries cache sort order based time recent access new entries added top list bottom entry evicted cache hits move top pushing entries arc improves basic lru strategy splitting cache directory two lists t1 t2 recently frequently referenced entries turn extended ghost list b1 b2 attached bottom two lists ghost lists act scorecards keeping track history recently evicted cache entries algorithm uses ghost hits adapt recent change resource usage note ghost lists contain metadata keys entries resource data i.e entry evicted ghost list data discarded combined cache directory organised four lru lists t1 b1 together referred l1 combined history recent single references similarly l2 combination t2 b2 whole cache directory visualised single line inner brackets indicate actual cache although fixed size move freely across b1 b2 history l1 displayed right left starting top indicated marker indicates target size t1 may equal smaller larger actual size indicated entries re- entering cache t1 t2 cause move towards target marker free space exists cache marker also determines whether either t1 t2 evict entry arc currently deployed ibm ds6000/ds8000 storage controllers sun microsystems scalable file system zfs uses variant arc alternative traditional solaris filesystem page cache virtual memory modified allow locked pages currently use vacated postgresql used arc buffer manager brief time version 8.0.0 quickly replaced another algorithm citing concerns ibm patent arc vmware vsan formerly virtual san hyper-converged software-defined storage sds product developed vmware uses variant arc caching algorithm | [
4295,
1575,
5956,
6505
] | Test |
7,576 | 4 | Layered_security:layered security layered security also known layered defense describes practice combining multiple mitigating security controls protect resources data like security methods layered security designed protect assets asset anything want protect include people property data etc layered security used environment military operations individuals community residents homeowners neighborhood watch groups etc words layered security practice using many different security controls different levels protect assets provides strength depth reduce effects threat goal create redundancies backups case security measures fail bypassed defeated placing assets innermost perimeter provide layers security measures increasing distances protected asset number layers security measures use depend threat importance asset term bears similarity defense depth term adopted military strategy involves multiple layers defense resist rapid penetration attacker yield rather exhaust too-rigid tactics incursion progresses resources consumed progress slowed halted turned back information assurance use term defense depth assumes merely technical security tools deployment also implies policy operations planning user training physical access security measures direct information assurance personnel involvement dealing attempts gain unauthorized access information resources within defense depth security strategy layered security regarded merely delaying tactic used buy time bring security resources bear deal malicious security cracker activities layered security example swiss cheese model cumulative act effect used risk analysis risk management model security systems likened multiple slices swiss cheese stacked side side risk threat becoming reality mitigated fact must pass holes defenses i.e trapped detected different defense defenses different kinds locations layered behind therefore theory lapses weaknesses one defense easily allow risk materialize since defenses also exist prevent single point weakness every category threat effective control deployed mitigate threat security vendors sometimes cite differing solutions grouped consumer enterprise categories ad hoc security strategy numerous vendors abundance different sometimes incompatible security solutions products leave gaps protection whereas vertically integrated vendor stack could provide comprehensive defense single-vendor solutions improve interoperability components complete security strategy may offer performance price benefits multi-vendor approach contrasting commercial security product argument best breed approach provides effective protection single vendor vertically integrated product stack may offering choice vendors want monopolize client customer business could also argued component comprehensive security strategy evaluated performance within niche open compatibility non-integrated components whole | [
2087,
6162,
5568
] | Validation |
7,577 | 4 | Collateral_circulation:collateral circulation collateral circulation alternate circulation around blocked artery vein via another path nearby minor vessels may occur via preexisting vascular redundancy analogous engineered redundancy circle willis brain may occur via new branches formed adjacent blood vessels neovascularization eye retinal embolism formation may provoked pathological conditions high vascular resistance ischaemia example usefulness collateral circulation systemic thromboembolism cats thrombotic embolus lodges external iliac artery common iliac artery blocking external internal iliac arteries effectively shutting blood supply hind leg even though main vessels leg blocked enough blood get tissues leg via collateral circulation keep alive blood flow brain humans animals maintained via network collateral arteries anastomose join circle willis lies base brain circle willis so-called communicating arteries exist front anterior back posterior parts circle willis well left right side circle willis another example humans animals acute myocardial infarction heart attack collateral circulation heart tissue sometimes bypass blockage main artery supply enough oxygenated blood enable cardiac tissue survive recover central retinal vein occlusion neovascularization may restore blood flow retina new vessels bulk also presents risk causing acute glaucoma blocking drainage aqueous humour hepatic cirrhosis arising congestion hepatic portal vein may give rise collateral circulation branches portal caval veins liver two caval veins consequences newly established venous collaterals arising portal hypertension include esophageal varices hemorrhoids portocaval collateral circulation | [] | Train |
7,578 | 0 | Document_structuring:document structuring document structuring subtask natural language generation involves deciding order grouping example paragraphs sentences generated text closely related content determination nlg task assume four sentences want include generated text 24 4 orderings messages including orderings better others example texts shown human readers prefer 1234 2314 4321 ordering also many ways sentences grouped paragraphs higher-level structures sections example 8 2**3 ways sentences 1234 grouped paragraphs including ordering human readers prefer groupings others example 12 34 preferred 1 23 4 document structuring task choose ordering grouping sentences results coherent well-organised text reader perspective three basic approaches document structuring schemas corpus-based heuristic schemas templates explicitly specify sentence ordering grouping document well content determination information typically constructed manually analysing corpus human-written texts target genre extracting document template texts schemas work well practice texts short 5 sentences less and/or standardised structure problems generating texts longer fixed structure corpus-based structuring techniques use statistical corpus analysis techniques automatically build ordering and/or grouping models techniques common automatic summarisation computer program automatically generates summary textual document principle could applied text generated non-linguistic data work infancy part challenge texts generated natural language generation systems generally expected fairly high quality always case texts generated automatic summarisation systems final approach heuristic-based structuring algorithms perform structuring task based heuristic rules come theories rhetoric psycholinguistic models and/or combination intuition feedback pilot experiments potential users heuristic-based structuring appealing intellectually difficult get work well practice part heuristics often depend semantic information sentences relate always available hand heuristic rules focus best text readers whereas approaches focus imitating authors many human-authored texts well structured perhaps ultimate document structuring challenge generate good narrative—in words text starts setting scene giving introduction/overview describes set events clear fashion readers easily see individual events related link together concludes summary/ending note narrative sense applies factual texts well stories current nlg systems good job generating narratives major source user criticism generating good narratives challenge aspects nlg fundamental challenge probably document structuring | [
1718,
5304,
3651,
2590
] | Test |
7,579 | 9 | SHAZAM_(software):shazam software shazam comprehensive econometrics statistics package estimating testing simulating forecasting many types econometrics statistical models shazam originally created 1977 kenneth white shazam version 11 available windows platforms server workstation desktop windows xp later shazam editions read write fixed free format text formats using read format statements data stored observation row variable column without variable names supplied windows environment formats comma-separated values csv microsoft excel xls xlsx may also read written shazam professional edition contains comprehensive data import capabilities data connector sql editor allowing import machine data source tab space comma separated text formats file-based proprietary binary formats including various microsoft excel formats well microsoft access lan wan internet data source user driver system addition shazam import data database management systems dbms shazam ships drivers common data database management systems shazam extensible development shazam procedures included reused shazam command files numerous shazam procedures written available shazam website many sites throughout internet shazam currently available four editions shazam command line edition shazamd shazamq text user interface versions allow batch processing operate double quad precisions shazam standard edition shazamw adds native windows application incorporates multiple document interface mdi interface including command data matrix graph editors workspace viewer along integrated online help samples examples shazam professional edition shazamp adds menu wizard driven facilities executing shazam techniques data connector sql editor well integrated debugger main guide available using shazam offers detailed descriptions shazam features commands options well providing guidance statistical techniques performed algorithms used construction shazam techniques contains numerous theoretical explanations practical examples sample code | [
3606,
2820,
1626,
4759,
5548,
1731,
5288,
5117,
5571,
4872,
4705,
4067,
3981,
3388,
4070,
3807,
1398,
6934,
1879,
5252,
3410,
4366,
256,
3915,
2530
] | Train |
7,580 | 1 | Result_set:result set sql result set set rows database well metadata query column names types sizes column depending database system number rows result set may may known usually number known front result set built on-the-fly result set effectively table codice_1 clause used query impose certain sort condition rows without clause guarantee whatsoever order rows returned | [
6462,
7921,
1891,
2054,
3776
] | Test |
7,581 | 2 | Comparison_of_open-source_operating_systems:comparison open-source operating systems tables compare free software open-source operating systems versions support feature first version supports listed | [
1438,
7159,
2549,
5021,
6085,
1454,
6428,
3955,
2566,
5047,
7550,
3299,
4705,
7554,
5055,
6117,
2226,
2585,
3981,
753,
7201,
415,
7214,
6489,
1139,
6149,
4012,
4375,
6500,
788,
6505,
1522,
4759,
1534,
7975,
2285,
1547,
4408,
3368,
1556,
... | Test |
7,582 | 7 | PaizaCloud_Cloud_IDE:paizacloud cloud ide paizacloud cloud ide cloud ide online integrated development environment supports programming languages including c c++ php ruby perl python javascript node.js go enables developers get started coding immediately browser-based development environment written almost entirely javascript uses node.js back-end editor component uses ace dec 2017 uses docker containers workspaces gino inc. company actively maintains paizacloud cloud ide company offices tokyo | [
5629,
2451,
5983,
993,
6428,
4315,
3368,
3543,
6029,
5965,
2079,
2619,
1435
] | Validation |
7,583 | 3 | Tetris:tetris tetris portmanteau tetromino tennis tile-matching puzzle video game originally designed programmed soviet russian game designer alexey leonidovich pajitnov first playable version completed june 6 1984 working dorodnitsyn computing centre academy science soviet union moscow derived name greek numerical prefix tetra- game pieces contain four segments tennis pajitnov favorite sport name also used in-game refer play four lines cleared tetris first entertainment software exported soviet union united states published spectrum holobyte commodore 64 ibm pc game popular use tetrominoes four-element case polyominoes used popular puzzles since least 1907 name figures given mathematician solomon w. golomb 1953 game one many variants available nearly every video game console computer operating system well devices graphing calculators mobile phones portable media players pdas network music players easter egg non-media products like oscilloscopes inspired tetris serving dishes even played sides various buildings versions tetris sold range 1980s home computer platforms well arcades successful handheld version game boy launched 1989 established game one popular video games ever electronic gaming monthly 100th issue tetris first place greatest game time 2007 came second place ign 100 greatest video games time 2019 moved 7th january 2010 announced games franchise sold 170 million copies—approximately 70 million physical copies 100 million copies cell phones—making second best selling paid-downloaded game time behind minecraft tetriminos game pieces shaped like tetrominoes geometric shapes composed four square blocks random sequence tetriminos fall playing field rectangular vertical shaft called well matrix objective game manipulate tetriminos moving one sideways and/or rotating quarter-turns form solid horizontal line without gaps line formed disappears blocks fall fill space certain number lines cleared game enters new level game progresses level causes tetriminos fall faster game ends stack tetriminos reaches top playing field new tetriminos able enter games also end finite number levels lines tetriminos fill clear singles doubles j l able clear triples tetrimino capacity clear four lines simultaneously referred tetris may vary depending rotation compensation rules specific tetris implementation instance super rotation system used recent implementations certain situations allow z 'snap tight spots clear triples pajitnov original version electronika 60 computer used green brackets represent blocks versions tetris original game boy/game boy color dedicated handheld games use monochrome grayscale graphics popular versions use separate color distinct shape prior tetris company standardization early 2000s colors varied widely implementation implementation scoring formula majority tetris products built idea difficult line clears awarded points example single line clear tetris zone worth 100 points clearing four lines known tetris worth 800 subsequent back-to-back tetris worth 1,200 conjunction players awarded combos exist certain games reward multiple line clears quick succession exact conditions triggering combos amount importance assigned vary game game nearly tetris games allow player press button increase speed current piece descent cause piece drop lock place immediately known soft drop hard drop respectively performing soft drop player also stop piece increased speed releasing button piece settles place games allow either soft drop hard drop others separate buttons many games award number points based height piece fell locking using hard drop generally awards points although first tetris game feature new kind tetris easy spin see next tetris also called infinite spin critics tetris worlds first game fall major criticisms easy spin refers property tetrimino stop falling moment left right movement rotation effectively allowing someone suspend tetrimino thinking place feature implemented tetris company official guideline type play differs traditional tetris takes away pressure higher level speed reviewers went far say mechanism broke game goal tetris worlds however complete certain number lines fast possible ability hold piece placement make achieving goal faster later gamespot received easy spin openly saying infinite spin issue honestly really affects single-player gameplay modes tetris ds competitive mode requires lay pieces quickly humanly possible response issue henk rogers stated interview infinite spin intentional part game design allowing novice players expend available scoring time decide best placement piece rogers observed gratuitous spinning occur competitive play expert players require much time think piece placed limitation placed infinite lock delay later games franchise certain amount inputs i.e rotations movements piece instantly lock defaulted 15 inputs tetris created june 1984 alexey pajitnov artificial intelligence researcher working soviet academy sciences computer center moscow tasked testing capabilities new hardware pajitnov would writing simple games initially considered creating game around pentominoes featured puzzle games enjoyed child felt might complicated twelve different shape variations concept switched tetrominoes seven variants electronika 60 working text-based display tetrominoes formed letter characters realizing completed lines resulted screen filling quickly pajitnov decided delete creating key part tetris gameplay pajitnov game proved popular colleagues academy sciences co-workers dmitry pavlovsky vadim gerasimov ported game ibm pc gerasimov reports pajitnov chose name tetris combination 'tetromino 'tennis pc game became popular began spreading around moscow gerasimov removed 1988 version game website october 2003 response demand counsel tetris company resumed making available august 2006 pc version made way budapest hungary ported various platforms discovered british software house andromeda attempted contact pajitnov secure rights pc version deal firmly settled already sold rights spectrum holobyte failing settle deal pajitnov andromeda attempted license hungarian programmers instead meanwhile legal rights settled spectrum holobyte ibm pc version tetris contained background graphics featuring russian scenes released united states 1987 game popularity tremendous computer gaming world called game deceptively simple insidiously addictive details licensing issues uncertain point 1987 andromeda managed obtain copyright licensing ibm pc home computer system commodore 64 release 1988 26-minute soundtrack composed game musician wally beben amiga atari st two different versions mirrorsoft 1987 spectrum holobyte 1988 became available mirrorsoft version feature background graphics spectrum holobyte version similar pc version contained similar images also distributed infogrames regions games sold budget titles due game simplicity spectrum apple ii package contained three diskettes three different versions game apple ii+ apple iie separate dos 3.3 prodos diskettes apple iigs diskette none copy-protected included documentation specifically charged purchaser honor give away copy extra diskettes unsure publish game fearful response soviet regime pajitnov took opportunity offered perestroika gave rights soviet government ten years 1988 soviet government began market rights tetris following promotional trip country gerald hicks one-time united states champion game organization called elektronorgtechnica elorg short time elorg still paid andromeda andromeda licensing sub-licensing rights game different version tetris originally released late 1988 bullet-proof software bps several japanese home computers well msx family computer japan predating nintendo version unlicensed arcade version released south korea well unlicensed master system titled super tetris 슈퍼 테트리스 syupeo teteuriseu 1989 half dozen different companies claimed rights create distribute tetris software home computers game consoles handheld systems elorg meanwhile held none companies legally entitled produce arcade version signed rights atari games signed non-japanese console handheld rights nintendo tetris show january 1988 consumer electronics show las vegas picked dutch games publisher henk rogers based japan eventually led agreement brokered nintendo saw tetris bundled every game boy rogers later stated tetris made game boy game boy made tetris tengen console software division atari games regardless applied copyright tetris game nintendo entertainment system loosely based arcade version proceeded market distribute name tetяis soviet mind game faux cyrillic typography incorporating cyrillic letter ya disregarding nintendo license elorg nintendo contacted atari games claiming stolen rights tetris whereupon atari games sued believing rights four weeks shelf courts ruled nintendo company rights tetris home game systems tengen tetяis recalled unknown number copies sold lawsuits tengen nintendo nes version carried 1993 tengen version tetяis considered rare nintendo released version tetris nintendo entertainment system nes developed gunpei yokoi nes version sold 8 million copies worldwide nintendo nes version lacked side-by-side 2-player option featured tengen version nintendo power reviewed version november december 1989 edition classic tetris world championship commenced 2010 uses nintendo version tetris nintendo released game super nintendo entertainment system snes along dr mario new version used different colors older versions makes squares look connected version similar version released nes february 13 2019 nintendo announced released new version classic game called tetris 99 tetris 99 features battle royale-style game mode 99 players play match addition complying tetris guideline version game features unique mechanic known badges badges lessen severity attacks received amplifies attacks sent players gain badges knocking others tetris 99 available nintendo switch 1988 arcade version released sega japan sega system 16 system e arcade boards japanese gamest award game year following year version sega mega drive originally planned release japan pulled following licensing issues resulting less ten copies printed new port arcade version m2 unrelated rare mega drive version included sega genesis mini microconsole scheduled release september 2019 sega arcade version commercially successful japanese arcades famicom tsūshin arcade earnings chart number-three august 1989 september 1989 rose number two october 1989 overtaking namco racing video game winning run 2014 conjunction 30th anniversary series sega released puyo puyo tetris multi-platform game blends gameplay elements tetris puyo puyo franchises 1996 rights game reverted russian state pajitnov previously made little money game year tetris company founded claiming hold copyright registrations tetris products u.s. taking trademark registrations tetris almost every country world licensed brand number companies u.s. court international trade u.s. customs times issued seizure orders preclude unlicensed tetris -like games imported u.s. though bulletins circulated u.s copyright office state copyright apply rules game late 1997 mid-2006 ttc legal counsel sent cease desist letters web sites basis tetris -type games infringing tetris trademark trade dress and/or look feel copyright around 2009 ttc tetris holding llc brought legal action biosocia inc. grounds biosocia blockles game infringed proprietary rights held ttc tetris holding llc september 10 2009 legal case biosocia resolved biosocia agreeing discontinue making blockles game available public may 2010 ttc legal counsel sent cease desist letters google insisting 35 tetris clones removed android market us district court judge ruled june 2012 tetris clone mino xio interactive infringed tetris company copyrights replicating elements playfield dimensions shapes blocks addition ruled tetris holding llc trade dress infringed mino replicated form brightly colored style tetris tetriminos higher-than-wide rectangular tetris playfield based success tetris 99 tetris company n3twork developing tetris royale ios android version tetris include battle royale mode 100 players along solo multiplayer modes expected release 2019 tetris subject many changes throughout releases since 1980s newer tetris games emphasized pace rather endurance older releases game boy nes tetris offer records according points since meter points restricted specific number digits games records maxed experienced player next big game boy release tetris tetris dx marathon mode—comparable mode previous releases—allowed additional digit point meter even players still maxed 9,999,999 points hours play new tetris world record competitors spent 12 hours playing game tetris dx new tetris new modes sprint ultra added modes require player act timer either gain lines points time releases like tetris worlds removed point records particular game kept records fast certain number lines could cleared depending level critics tetris worlds said flawed virtue ability piece hover bottom long player needs many different modes play added recent years modes appearing one major release include classic marathon game sprint otherwise game b 40 lines ultra square cascade field dimension tetris perhaps least deviated among releases almost always 10 cells wide 20 high releases handheld platforms small screens smaller fields example tetris jr. keychain game 8 12 tetris game boy 10 18 traditionally blocks spawn within four central columns two highest rows tetrimino occupies columns 4 5 6 7 tetrimino occupies columns 5 6 remaining 5 tetriminos occupy columns 4 5 6 especially older versions 5 6 7 recent games pieces spawn visible playfield traditional games level-up would occur every ten lines cleared newer games tetris worlds number lines required varies upon new level level-up points awarded increased blocks fall slightly faster example nes tetris operates 60 frames per second level 0 piece falls one step every 48 frames level 19 piece falls one step every 2 frames level increments either terminate certain point game boy tetris tops level 20 increase forever yet speed certain point nes tetris level speed level 29 due limitations game engine pieces capable dropping faster tool-assisted emulation show level indicator increases indefinitely—eventually leading glitch meter displays non-numeric characters modern games tetris grand master tetris worlds highest levels opt drop piece one row per frame pieces appear reach bottom soon spawn result games delay lets player slide piece bottom moment help deal otherwise unplayable fall speed games hover time regenerated piece moved rotated soft drops first implemented nintendo releases tetris pieces would able drop faster locking slide gaps option hard dropping originated early pc games microsoft tetris game developed dave edson bundled microsoft entertainment pack hard dropping piece falls locks one frame newer tetris games feature options games locking roles reversed soft dropping making pieces drop faster locking hard dropping making pieces drop instantly lock single direction rotation older restriction since ruled nearly every new official release favor separate buttons clockwise one counter clockwise rotation traditional games unsymmetrical vertical orientation i- z- s-pieces fill columns clockwise counter clockwise rotation games vary allowing two possible column orientations one counter clockwise one clockwise rotations double rotation—only seen progressive clones quadra dtet —rotates piece 180° one features appreciated skilled players wall kick ability rotate pieces even touch left right walls nes version example z piece vertically aligned falling touching left wall player rotate piece giving impression rotate buttons locked situation player move piece one position right rotating losing precious time proper implementations wall kick first appeared arcade version tetris atari games piece preview allows look next piece enter field feature implemented since earliest games though early games preview turned made score increase slowly several tetris variants exist feature alternate rules pieces feature alternate topologies dimensions others completely different gameplay popular variant called grand master eventually becomes fast players use every second time optimally even mode dubbed invisible tetris blocks shown falling – revealed game popularity relatively simple code required produce game game nearly rules tetris often used hello world project programmers coding new system programming language resulted availability large number ports different platforms instance µtorrent gnu emacs contain similar shape-stacking games easter eggs players lose typical game tetris longer keep increasing speed player find appropriate solution tetriminos 've given tetriminos stack top playing field commonly referred topping question would possible play forever first considered thesis john brzustowski 1992 conclusion reached game statistically doomed end reason z tetriminos player receives sufficiently large sequence alternating z tetriminos naïve gravity used standard game eventually forces player leave holes board holes necessarily stack top ultimately end game pieces distributed randomly sequence eventually occur thus game example ideal uniform uncorrelated random number generator played long enough player top practice occur tetris variants variants allow player choose play z tetriminos good player may survive well 150 consecutive tetriminos way implementation ideal uniform randomizer probability given time next 150 tetriminos z approximately implementations use pseudorandom number generator generate sequence tetriminos s–z sequence almost certainly contained sequence produced 32-bit linear congruential generator many implementations roughly states evil algorithm bastet unofficial variant often starts game series seven z pieces modern versions tetris released 2001 use bag-style randomizer guarantees players never receive four z pieces row one indispensable rules enforced tetris guideline officially licensed tetris games must follow recent versions tetris tetris worlds allow player repeatedly rotate block hits bottom playfield without locking place see easy spin dispute permits player play infinite amount time though necessarily land infinite number blocks computer science common analyze computational complexity problems including real life problems games proven offline version tetris player knows complete sequence pieces dropped i.e hidden information following objectives np-complete also difficult even approximately solve first second fourth problem np-hard given initial gameboard sequence p pieces approximate first two problems within factor constant np-hard approximate last problem within factor constant prove np-completeness shown polynomial reduction 3-partition problem also np-complete tetris problem atari arcade version tetris nes port subsidiary tengen original pieces composed brad fuller well traditional russian tunes also arranged fuller according research dr. richard haier et al prolonged tetris activity also lead efficient brain activity play first playing tetris brain function activity increases along greater cerebral energy consumption measured glucose metabolic rate tetris players become proficient brains show reduced consumption glucose indicating efficient brain activity task moderate play tetris half-an-hour day three months boosts general cognitive functions critical thinking reasoning language processing increases cerebral cortex thickness january 2009 oxford university research group headed dr. emily holmes reported plos one healthy volunteers playing tetris soon viewing traumatic material laboratory reduced number flashbacks scenes following week believe computer game may disrupt memories retained sights sounds witnessed time later re-experienced involuntary distressing flashbacks moment group hopes develop approach potential intervention reduce flashbacks experienced post-traumatic stress disorder emphasized preliminary results professor jackie andrade jon may plymouth university cognition institute ph.d. student jessica skorka-brown conducted research shows playing tetris could give quick manageable fix people struggling stick diets quit smoking drinking another notable effect according canadian study april 2013 playing tetris found treat older adolescents amblyopia lazy eye better patching victim well eye train weaker eye dr. robert hess research team said much better patching – much enjoyable faster seems work better. tested united kingdom experiment also appears help children problem game noted cause brain involuntarily picture tetris combinations even player playing tetris effect although occur computer game situation showcasing repeated images scenarios jigsaw puzzle debates tetris cognitive benefits continue least researchers view milestone gamification education 2013 tetris company signed contract hasbro make bop jenga themed version tetris games shown new york toy fair bop tetris sold amazon.com june 2013 jenga tetris like jenga using tetris shapes bop tetris audio game several game modes including marathon pass marathon mode player four lives complete puzzles square lights game unit three actions slam slams top part device slide screen rotate left right spin device spin player fails complete puzzle voice buddy rubino make santa claus type laugh encourage player comment squares man 're squares shapes hard buddy say life lost one four squares top screen disappear every stage completed buddy tell player comment level 45-second bonus round player score two bonus points pass mode marathon mode except buddy rubino say pass let people join compute called ibm version tetris one addictive computer games side berlin wall ... game start work appointment keep consider warned orson scott card joked game proves russia still wants bury us shudder think blow economy computer productivity drops 0 noting tetris copy-protected wrote obviously game meant find way onto every american machine ibm version game reviewed 1988 dragon 135 hartley patricia kirk lesser role computers column reviewers gave game 4.5 5 stars lessers later reviewed spectrum holobyte macintosh version tetris 1989 dragon 141 giving version 5 5 stars 1993 zx spectrum version game voted number 49 sinclair official top 100 games time 1996 tetris pro ranked 38th best game time amiga power entertainment weekly picked game 8 greatest game available 1991 saying thanks nintendo ’ endless promotion tetris become one popular video games computer gaming world gave tetris 1989 compute choice award arcade game describing far addictive game ever game three software publishers association excellence software awards 1989 including best entertainment program critic choice award consumers computer gaming world 1996 ranked 14th magazine list innovative computer games year next generation listed number 2 top 100 games time commenting something perfect zen falling blocks tetris game captured interest everyone ever played march 12 2007 new york times reported tetris named list ten important video games time so-called game canon announced 2007 game developers conference library congress took video game preservation proposal began 10 games including tetris 2007 video game website gamefaqs hosted sixth annual character battle users nominate favorite video game characters popularity contest characters participate l-shaped tetris piece l-block called entered contest joke character november 4 2007 contest june 6 2009 google honored tetris 25-year anniversary changing logotype version drawn tetris blocks – l letter long tetris block lowering place seen 2009 game informer put tetris 3rd list top 200 games time saying game could considered ageless tetris game informer staff also placed third 2001 list 100 best games ever electronic gaming monthly 100th issue tetris first place greatest game time 2007 tetris came second place ign 100 greatest video games time january 2010 announced tetris franchise sold 170 million copies approximately 70 million physical copies 100 million copies cell phones making best-selling paid-downloaded game time 1991 pc format named tetris one 50 best computer games ever editors called incredibly addictive one best games time guinness world records recognized game ported history video gaming appearing excess 65 different platforms 2011 tetris subject academic research vladimir pokhilko first clinical psychologist conduct experiments using tetris subsequently used research several fields including theory computation algorithmic theory cognitive psychology game tetris blocks appear adsorb onto lower surface window led scientists use tetrominoes proxy molecules complex shape model adsorption flat surface study thermodynamics nanoparticles threshold entertainment teamed tetris company develop film adaptation tetris threshold ceo describes film epic sci-fi adventure film says story big 'll part trilogy 2016 sources reported press release claiming film would shot china 2017 80 million budget however 2017 later sources confirm film ever actually went production tetris appeared 2010 short animated film pixels 2015 movie pixels inspired former | [
6789,
1740,
5571,
6440,
2934,
6914,
6113,
6119,
6380,
3039,
8015,
683,
2600,
5421,
339,
2338,
4454,
4191,
5526
] | Test |
7,584 | 2 | Apple_Disk_Image:apple disk image apple disk image disk image format commonly used macos operating system opened apple disk image mounted volume within macintosh finder apple disk image structured according one several proprietary disk image formats including universal disk image format udif new disk image format ndif apple disk image file name usually .dmg extension apple disk image files published mime type application/x-apple-diskimage different file systems contained inside disk images also support creating hybrid optical media images contain multiple file systems file systems supported include hierarchical file system hfs hfs plus file allocation table fat iso9660 universal disk format udf apple disk images created using utilities bundled mac os x specifically disk copy mac os x v10.2 earlier disk utility mac os x v10.3 later utilities also use apple disk image files images burning cds dvds disk image files may also managed via command line interface using hdiutil utility mac os x v10.2.3 apple introduced compressed disk images internet-enabled disk images use apple utility disk copy later integrated disk utility 10.3 disk copy application ability display multi-lingual software license agreement mounting disk image image mounted unless user indicates agreement license apple disk image allows secure password protection well file compression hence serves security file distribution functions disk image commonly used distribute software internet apple originally created disk image formats resource fork used mac applications could easily transferred mixed networks make internet even use resource forks declined mac os x disk images remained standard software distribution format disk images allow distributor control finder presentation window commonly used instruct user copy application correct folder previous version format intended floppy disk images usually referred disk copy 4.2 format version disk copy utility used handle images similar format supported compression floppy disk images called dart new disk image format ndif previous default disk image format mac os 9 disk images format generally .img confused raw .img disk image files .smi file extension files .smi extension actually applications mount embedded disk image thus self mounting image intended mac os 9 earlier universal disk image format udif native disk image format mac os x disk images format typically .dmg extension apple released documentation format attempts reverse engineer parts format successful encrypted layer reverse engineered implementation called vilefault spoonerism filevault apple disk image files essentially raw disk images i.e contain block data added metadata optionally one two layers applied provide compression encryption hdiutil layers called cudifencoding cencryptedencoding udif supports adc old proprietary compression format apple zlib bzip2 mac os x v10.4 lzfse mac os x v10.11 compression internally trailer described using following c structure values big-endian powerpc byte ordering explanation options available extract files mount proprietary apple disk image format cross-platform conversion utilities windows dmg images opened using several programs ultraiso isobuster macdrive also mount simple dmg files drives windows sparse disk encrypted dmgs free apple dmg disk image viewer also exists linux possibly unix flavors .dmg files burned cd/dvd using cd-burner program using cdrecord directly front-end k3b brasero directly mounted mountpoint e.g darling-dmg fuse module enabling easy dmg file mounting linux | [
7789,
5983,
6885,
1352,
569,
1471,
8092,
2749,
5660,
578,
7555,
1955,
7746,
2589,
7201,
510,
3219,
5158,
1675,
5069,
6940,
7584,
6232,
169,
3413,
7306,
1435,
5191
] | Test |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.