node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4 values |
|---|---|---|---|---|
5,685 | 8 | Fuse_Mediation_Router:fuse mediation router fuse mediation router open source tool integrating services using enterprise integration patterns based apache camel use enterprise organizations certified productized fully supported people wrote code fuse mediation router uses standard method notation go diagram implementation without coding fuse mediation router rule-based routing process mediation engine combines ease basic pojo development clarity standard enterprise integration patterns deployed inside container used stand-alone works directly kind transport messaging model rapidly integrate existing services applications fuse mediation router part red hat jboss fuse fusesource offers graphical eclipse-based tooling apache camel download | [
6986,
3915,
7921,
5571,
6586
] | Test |
5,686 | 3 | Do!_Run_Run:run run run run known super pierrot スーパーピエロ japan fourth final incarnation mr universal video game mascot returning mr. roots clown bouncing powerball hurl monsters mr. runs along playfield picking dots leaving line behind player encouraged create closed sections precariously balanced log traps rolled downslope crushing enemies resulting game somewhat cross mr congo bongo pac-man qix title reference song da doo ron ron goal run run rack points completing screens screen completed whenever fruits/dots eaten regular monsters alpha-monsters sidekicks defeated using rope follows mr. inscribe dots convert cherries familiar fruit mr. collect cherries worth points dots eating restores powerball quickly eating dots would time mr. inscribes fruit progress higher tier dots become cherries cherries become apples apples become lemons lemons become pineapples eating dot awards 10 points 1/16 powerball recharge eating pineapple worth 160 points 1/4 powerball recharge players additionally encouraged inscribe sections playfield letters e x r constant feature mr games randomly one inscribed fruits turn flashing letter spot corresponding movement alpha-monster top screen mr. runs spot monster sporting letter release top screen three blue henchmen resemble three ghost-like monsters original mr chase mr. defeating alpha-monster lock letter 5 letters earned player earns extra life well progressing next stage also earn 5,000 point bonus points also awarded defeating monsters directly firing powerball monster awards 500 points consumes powerball needs replenished eating fruit points earned powerball bounces surface bounce raises bonus 500 points maximum 3000 points earned smashing monsters rolling log earns 1000 points possible roll multiple monsters earn cumulative bonus 500 per extra monster 1500 2nd 2000 3rd etc. apparently 10,000 point bonus smashing 5 monsters like mr. games monsters nameless except alpha-monsters defy easy description two types monsters attempt foil clown efforts green clam-like monster blue snake-like monster neither particularly sophisticated although clam monsters seemingly clever moments bumble path way powerball blue snakes linger long direct path convert fireball charge across playing field state immune powerball common arcade games contact monsters instantly fatal mr. shown electrocuted complete visible flashing skeleton reappearing black skeleton time stage elapses music changes surviving monsters convert different form clam monsters become blue armored spines snake monsters essentially become different looking snake monsters speed monster willingness chase mr. major changes fairly easily eluded long player simply run away instead mr. climb terrain closely chased monsters lose lot time changing levels playfield whereas mr. gets slight speed going downslope short duration music resumes monsters transform back old selves pattern transformation repeating alpha-monsters summoned letter circle released three henchmen henchmen home mr. typically precede alpha-monster killing alpha-monster rids playfield henchmen although easier lure four path log smash alpha-monsters also released every time score reaches increments 5,000 points unless already alpha-monster playfield configured rom occur infrequently bonus diamond worth 10,000 points show manner letter circles fruit inscribed player collects stage ends awarded bonus credit fashion original mr versions released msx 1987 amiga atari st 1990 ports amstrad cpc commodore 64 zx spectrum cancelled development | [
7944,
6343,
3045,
2148
] | Validation |
5,687 | 4 | Alec_Muffett:alec muffett alec david edward muffett born april 22 1968 anglo-american internet-security evangelist architect software engineer principally known work crack original unix password cracker cracklib password-integrity testing library also active open-source software community muffett joined sun microsystems 1992 working initially systems administrator rose “ ranks ” become principal engineer security position held retrenched many others 2009 shortly oracle acquired sun sun one researchers worked factorization 512 bit rsa challenge number rsa-155 successfully factorized august 1999 muffett also worked sun md5 hash algorithm introduced solaris 9 update 2 new algorithm drew muffett work pluggable crypt implemented many different languages example python algorithm uses complete text famous soliloquy shakespeare hamlet question ... constant data muffett justified choice text exposes programmers shakespeare got good thing sabbatical year muffett began work mine project lead developer subsequently became director consultant green lane security also consults surevine became director open rights group october 2011 muffett blogs professionally computer world unscrewing security personally dropsafe numerous publications credit besides frequent presenter technical conferences muffett co-inventor darren moffat casper dik patent method apparatus implementing pluggable password obscuring mechanism united states patent 7,249,260 issued june 12 2003 2015 muffett named one top 6 influential security thinkers sc magazine october year coauthored rfc 7686 .onion special-use domain name jacob applebaum recently muffett assisted new york times creation tor onion site following created onion wikipedia site accessible tor previously muffett worked software engineer facebook leading team added end-to-end encryption facebook messenger currently works principal engineer infrastructure security deliveroo | [
5965,
6003
] | Test |
5,688 | 4 | Peter_G._Neumann:peter g. neumann peter gabriel neumann born 1932 computer-science researcher worked multics operating system 1960s edits risks digest columns acm software engineering notes communications acm founded acm sigsoft fellow acm ieee aaas 1950 1958 neumann studied harvard university 1961 granted ph.d. completing fulbright scholarship germany 1958–1960 student harvard two-hour breakfast albert einstein 8 november 1952 discussing simplicity design neumann worked bell labs 1960 1970 worked sri international menlo park california since 1971 risks mailing list neumann best known provably secure operating system psos neumann worked dorothy e. denning 1980s develop computer intrusion detection system known ides model later computer security software neumann long served moderator risks digest member accurate project neumann founding editor acm software engineering notes sen fellow acm | [
4969,
6460,
7234,
2611,
1243,
3680,
1805
] | Validation |
5,689 | 4 | Mastering_the_Internet:mastering internet mastering internet mti mass surveillance project led british communications intelligence agency government communications headquarters gchq budgeted £1 billion according reports register sunday times early may 2009 contracts total value £200m already awarded suppliers responding reports gchq issued press release countering claims mass surveillance stating gchq developing technology enable monitoring internet use phone calls britain target everyone uk however 2013 mass surveillance disclosures revealed gchq gathers raw information without filtering communications british citizens web part mastering internet programme mastering internet mti project british government part interception modernisation programme imp system described 2009 register sunday times replacement scrapped plans single central database involving thousands dpi black boxes various internet service providers association gchq base cheltenham funded single intelligence account budget £1.6 bn including £200m contract lockheed martin contract bae systems detica 2013 system capable copying signals 200 fibre-optic cables physical points entry great britain early 2007 john adams chief canada intelligence agency communications security establishment told parliament canada plans five eyes master internet cooperation nsa allies 2013 guardian provided specific details financial contributions made u.s. national security agency nsa mastering internet part five eyes alliance several english-speaking western democracies according documents leaked edward snowden nsa paid gchq £17.2 million towards running programme | [
1344,
803,
3241,
5509
] | Test |
5,690 | 2 | Nat_Friedman:nat friedman nathaniel dourif friedman born august 6 1977 american technology executive 1996 freshman massachusetts institute technology friedman befriended miguel de icaza linuxnet irc network friedman created discuss linux intern microsoft friedman worked iis web server mit studied computer science mathematics graduated bachelor science 1999 friedman co-founded ximian originally called international gnome support helix code de icaza develop applications infrastructure gnome project de icaza started aim producing free software desktop environment company later bought novell 2003 novell friedman chief technology strategy officer open source january 2010 launched hula project began release components novell netmail open source tenure novell began effort migrate 6,000 employees away microsoft windows suse linux microsoft office openoffice.org friedman final project departure work suse studio sabbatical friedman created hosted podcast called hacker medley may 2011 friedman de icaza together founded xamarin friedman made ceo company created offer commercial support mono project de icaza initiated ximian provide free software implementation microsoft .net software stack xamarin focused continuing develop mono monodevelop marketing cross-platform xamarin sdk developers targeting mobile computing devices video game consoles 2016 friedman became employee microsoft upon acquisition xamarin rose position corporate vice president developer services june 2018 announcement microsoft 7.5 billion acquisition github companies simultaneously announced friedman would become github new ceo github co-founder then-current ceo chris wanstrath leading search wanstrath replacement since august 2017 friedman assumed role ceo 29th october 2018 | [
3915,
4759,
2680,
918,
3110,
1674,
2530,
7848,
578,
3135
] | Test |
5,691 | 9 | JDOM:jdom jdom open-source java-based document object model xml designed specifically java platform take advantage language features jdom integrates document object model dom simple api xml sax supports xpath xslt uses external parsers build documents jdom developed jason hunter brett mclaughlin starting march 2000 part java community process jsr 102 though effort since abandoned suppose file foo.xml contains xml document one parse xml file tree java objects jdom like case want create document object file input stream create document object element converse one construct tree elements generate xml file following example | [
3915,
5571
] | Test |
5,692 | 2 | Active_Directory_Federation_Services:active directory federation services active directory federation services ad fs software component developed microsoft run windows server operating systems provide users single sign-on access systems applications located across organizational boundaries uses claims-based access-control authorization model maintain application security implement federated identity claims-based authentication involves authenticating user based set claims user identity contained trusted token token often issued signed entity able authenticate user means trusted entity claims-based authentication part active directory services ad fs identity federation established two organizations establishing trust two security realms federation server one side accounts side authenticates user standard means active directory domain services issues token containing series claims user including identity side resources side another federation server validates token issues another token local servers accept claimed identity allows system provide controlled access resources services user belongs another security realm without requiring user authenticate directly system without two systems sharing database user identities passwords practice user might typically perceive approach follows ad fs integrates active directory domain services using identity provider ad fs interact ws-* saml 2.0-compliant federation services federation partners | [
644,
2341,
2885,
5702,
3180,
59,
4770
] | Test |
5,693 | 5 | Orthogonal_frequency-division_multiplexing:orthogonal frequency-division multiplexing telecommunications orthogonal frequency-division multiplexing ofdm method encoding digital data multiple carrier frequencies ofdm developed popular scheme wideband digital communication used applications digital television audio broadcasting dsl internet access wireless networks power line networks 4g mobile communications coded orthogonal frequency-division multiplexing cofdm forward error correction convolutional coding time/frequency interleaving applied signal transmitted done overcome errors mobile communication channels affected multipath propagation doppler effects cofdm introduced alard 1986 digital audio broadcasting eureka project 147 practice ofdm become used combination coding interleaving terms cofdm ofdm co-apply common applications ofdm frequency-division multiplexing fdm scheme used digital multi-carrier modulation method ofdm introduced chang bell labs 1966 numerous closely spaced orthogonal subcarrier signals overlapping spectra emitted carry data demodulation based fast fourier transform algorithms ofdm improved weinstein ebert 1971 introduction guard interval providing better orthogonality transmission channels affected multipath propagation subcarrier signal modulated conventional modulation scheme quadrature amplitude modulation phase-shift keying low symbol rate maintains total data rates similar conventional single-carrier modulation schemes bandwidth main advantage ofdm single-carrier schemes ability cope severe channel conditions example attenuation high frequencies long copper wire narrowband interference frequency-selective fading due multipath without complex equalization filters channel equalization simplified ofdm may viewed using many slowly modulated narrowband signals rather one rapidly modulated wideband signal low symbol rate makes use guard interval symbols affordable making possible eliminate intersymbol interference isi use echoes time-spreading analog television visible ghosting blurring respectively achieve diversity gain i.e signal-to-noise ratio improvement mechanism also facilitates design single frequency networks sfns several adjacent transmitters send signal simultaneously frequency signals multiple distant transmitters may re-combined constructively sparing interference traditional single-carrier system following list summary existing ofdm-based standards products details see usage section end article ofdm-based multiple access technology ofdma also used several 4g pre-4g cellular networks mobile broadband standards next generation wlan advantages disadvantages listed discussed characteristics principles operation section conceptually ofdm specialized frequency-division multiplexing fdm method additional constraint subcarrier signals within communication channel orthogonal one another ofdm subcarrier frequencies chosen subcarriers orthogonal meaning cross-talk sub-channels eliminated inter-carrier guard bands required greatly simplifies design transmitter receiver unlike conventional fdm separate filter sub-channel required orthogonality requires subcarrier spacing formula_1 hertz seconds useful symbol duration receiver-side window size k positive integer typically equal 1 stipulates carrier frequency undergoes k complete cycles per symbol period previous carrier therefore n subcarriers total passband bandwidth b ≈ n ·δ f hz orthogonality also allows high spectral efficiency total symbol rate near nyquist rate equivalent baseband signal i.e near half nyquist rate double-side band physical passband signal almost whole available frequency band used ofdm generally nearly 'white spectrum giving benign electromagnetic interference properties respect co-channel users ofdm requires accurate frequency synchronization receiver transmitter frequency deviation subcarriers longer orthogonal causing inter-carrier interference ici i.e. cross-talk subcarriers frequency offsets typically caused mismatched transmitter receiver oscillators doppler shift due movement doppler shift alone may compensated receiver situation worsened combined multipath reflections appear various frequency offsets much harder correct effect typically worsens speed increases important factor limiting use ofdm high-speed vehicles order mitigate ici scenarios one shape subcarrier order minimize interference resulting non-orthogonal subcarriers overlapping example low-complexity scheme referred wcp-ofdm weighted cyclic prefix orthogonal frequency-division multiplexing consists using short filters transmitter output order perform potentially non-rectangular pulse shaping near perfect reconstruction using single-tap per subcarrier equalization ici suppression techniques usually increase drastically receiver complexity orthogonality allows efficient modulator demodulator implementation using fft algorithm receiver side inverse fft sender side although principles benefits known since 1960s ofdm popular wideband communications today way low-cost digital signal processing components efficiently calculate fft time compute inverse-fft fft transform take less time symbol example dvb-t means computation done less -point fft may approximated computational demand approximately scales linearly fft size double size fft needs double amount time vice versa comparison intel pentium iii cpu 1.266 ghz able calculate fft using fftw intel pentium 1.6 ghz intel core duo 3.0 ghz one key principle ofdm since low symbol rate modulation schemes i.e. symbols relatively long compared channel time characteristics suffer less intersymbol interference caused multipath propagation advantageous transmit number low-rate streams parallel instead single high-rate stream since duration symbol long feasible insert guard interval ofdm symbols thus eliminating intersymbol interference guard interval also eliminates need pulse-shaping filter reduces sensitivity time synchronization problems cyclic prefix transmitted guard interval consists end ofdm symbol copied guard interval guard interval transmitted followed ofdm symbol reason guard interval consists copy end ofdm symbol receiver integrate integer number sinusoid cycles multipaths performs ofdm demodulation fft standards ultrawideband interest transmitted power cyclic prefix skipped nothing sent guard interval receiver mimic cyclic prefix functionality copying end part ofdm symbol adding beginning portion effects frequency-selective channel conditions example fading caused multipath propagation considered constant flat ofdm sub-channel sub-channel sufficiently narrow-banded i.e. number sub-channels sufficiently large makes frequency domain equalization possible receiver far simpler time-domain equalization used conventional single-carrier modulation ofdm equalizer multiply detected subcarrier fourier coefficient ofdm symbol constant complex number rarely changed value fundamental level simpler digital equalizers better require fewer operations translates fewer round-off errors equalizer round-off errors viewed numerical noise inevitable differential modulation dpsk dqpsk applied subcarrier equalization completely omitted since non-coherent schemes insensitive slowly changing amplitude phase distortion sense improvements fir equalization using ffts partial ffts leads mathematically closer ofdm ofdm technique easier understand implement sub-channels independently adapted ways varying equalization coefficients switching different qam constellation patterns error-correction schemes match individual sub-channel noise interference characteristics subcarriers ofdm symbols may carry pilot signals measurement channel conditions i.e. equalizer gain phase shift subcarrier pilot signals training symbols preambles may also used time synchronization avoid intersymbol interference isi frequency synchronization avoid inter-carrier interference ici caused doppler shift ofdm initially used wired stationary wireless communications however increasing number applications operating highly mobile environments effect dispersive fading caused combination multi-path propagation doppler shift significant last decade research done equalize ofdm transmission doubly selective channels ofdm invariably used conjunction channel coding forward error correction almost always uses frequency and/or time interleaving frequency subcarrier interleaving increases resistance frequency-selective channel conditions fading example part channel bandwidth fades frequency interleaving ensures bit errors would result subcarriers faded part bandwidth spread bit-stream rather concentrated similarly time interleaving ensures bits originally close together bit-stream transmitted far apart time thus mitigating severe fading would happen travelling high speed however time interleaving little benefit slowly fading channels stationary reception frequency interleaving offers little benefit narrowband channels suffer flat-fading whole channel bandwidth fades time reason interleaving used ofdm attempt spread errors bit-stream presented error correction decoder decoders presented high concentration errors decoder unable correct bit errors burst uncorrected errors occurs similar design audio data encoding makes compact disc cd playback robust classical type error correction coding used ofdm-based systems convolutional coding often concatenated reed-solomon coding usually additional interleaving top time frequency interleaving mentioned two layers coding implemented choice reed-solomon coding outer error correction code based observation viterbi decoder used inner convolutional decoding produces short error bursts high concentration errors reed-solomon codes inherently well suited correcting bursts errors newer systems however usually adopt near-optimal types error correction codes use turbo decoding principle decoder iterates towards desired solution examples error correction coding types include turbo codes ldpc codes perform close shannon limit additive white gaussian noise awgn channel systems implemented codes concatenated either reed-solomon example mediaflo system bch codes dvb-s2 system improve upon error floor inherent codes high signal-to-noise ratios resilience severe channel conditions enhanced information channel sent return-channel based feedback information adaptive modulation channel coding power allocation may applied across subcarriers individually subcarrier latter case particular range frequencies suffers interference attenuation carriers within range disabled made run slower applying robust modulation error coding subcarriers term dmt denotes ofdm-based communication systems adapt transmission channel conditions individually subcarrier means so-called bit-loading examples adsl vdsl upstream downstream speeds varied allocating either fewer carriers purpose forms rate-adaptive dsl use feature real time bitrate adapted co-channel interference bandwidth allocated whichever subscriber needs ofdm primary form considered digital modulation technique multi-user channel access method since used transferring one bit stream one communication channel using one sequence ofdm symbols however ofdm combined multiple access using time frequency coding separation users orthogonal frequency-division multiple access ofdma frequency-division multiple access achieved assigning different ofdm sub-channels different users ofdma supports differentiated quality service assigning different number subcarriers different users similar fashion cdma thus complex packet scheduling media access control schemes avoided ofdma used ofdma also candidate access method ieee 802.22 wireless regional area networks wran project aims designing first cognitive radio-based standard operating vhf-low uhf spectrum tv spectrum multi-carrier code division multiple access mc-cdma also known ofdm-cdma ofdm combined cdma spread spectrum communication coding separation users co-channel interference mitigated meaning manual fixed channel allocation fca frequency planning simplified complex dynamic channel allocation dca schemes avoided ofdm-based wide-area broadcasting receivers benefit receiving signals several spatially dispersed transmitters simultaneously since transmitters destructively interfere limited number subcarriers whereas general actually reinforce coverage wide area beneficial many countries permits operation national single-frequency networks sfn many transmitters send signal simultaneously channel frequency sfns use available spectrum effectively conventional multi-frequency broadcast networks mfn program content replicated different carrier frequencies sfns also result diversity gain receivers situated midway transmitters coverage area increased outage probability decreased comparison mfn due increased received signal strength averaged subcarriers although guard interval contains redundant data means reduces capacity ofdm-based systems broadcasting systems deliberately use long guard interval order allow transmitters spaced farther apart sfn longer guard intervals allow larger sfn cell-sizes rule thumb maximum distance transmitters sfn equal distance signal travels guard interval — instance guard interval 200 microseconds would allow transmitters spaced 60 km apart single frequency network form transmitter macrodiversity concept used dynamic single-frequency networks dsfn sfn grouping changed timeslot timeslot ofdm may combined forms space diversity example antenna arrays mimo channels done ieee 802.11 wireless lan standards ofdm signal exhibits high peak-to-average power ratio papr independent phases subcarriers mean often combine constructively handling high papr requires non-linearity signal chain cause intermodulation distortion linearity requirement demanding especially transmitter rf output circuitry amplifiers often designed non-linear order minimise power consumption practical ofdm systems small amount peak clipping allowed limit papr judicious trade-off consequences however transmitter output filter required reduce out-of-band spurs legal levels effect restoring peak levels clipped clipping effective way reduce papr although spectral efficiency ofdm attractive terrestrial space communications high papr requirements far limited ofdm applications terrestrial systems crest factor cf db ofdm system n uncorrelated subcarriers cf crest factor db subcarrier cf 3.01 db sine waves used bpsk qpsk modulation example dvb-t signal 2k mode composed 1705 subcarriers qpsk-modulated giving crest factor 35.32 db many crest factor reduction techniques developed dynamic range required fm receiver dab require comparison extra bit per sample increases dynamic range performance communication system measured terms power efficiency bandwidth efficiency power efficiency describes ability communication system preserve bit error rate ber transmitted signal low power levels bandwidth efficiency reflects efficiently allocated bandwidth used defined throughput data rate per hertz given bandwidth large number subcarriers used bandwidth efficiency multicarrier system ofdm using optical fiber channel defined factor 2 two polarization states fiber formula_9 symbol rate giga symbol per second gsps formula_10 bandwidth ofdm signal saving bandwidth using multicarrier modulation orthogonal frequency division multiplexing bandwidth multicarrier system less comparison single carrier system hence bandwidth efficiency multicarrier system larger single carrier system 1 dbm increase receiver power get 76.7 improvement bandwidth efficiency using multicarrier transmission technique section describes simple idealized ofdm system model suitable time-invariant awgn channel ofdm carrier signal sum number orthogonal subcarriers baseband data subcarrier independently modulated commonly using type quadrature amplitude modulation qam phase-shift keying psk composite baseband signal typically used modulate main rf carrier formula_11 serial stream binary digits inverse multiplexing first demultiplexed formula_12 parallel streams one mapped possibly complex symbol stream using modulation constellation qam psk etc. note constellations may different streams may carry higher bit-rate others inverse fft computed set symbols giving set complex time-domain samples samples quadrature-mixed passband standard way real imaginary components first converted analogue domain using digital-to-analogue converters dacs analogue signals used modulate cosine sine waves carrier frequency formula_13 respectively signals summed give transmission signal formula_14 receiver picks signal formula_15 quadrature-mixed baseband using cosine sine waves carrier frequency also creates signals centered formula_16 low-pass filters used reject baseband signals sampled digitised using analog-to-digital converters adcs forward fft used convert back frequency domain returns formula_12 parallel streams converted binary stream using appropriate symbol detector streams re-combined serial stream formula_18 estimate original binary stream transmitter formula_12 subcarriers used subcarrier modulated using formula_20 alternative symbols ofdm symbol alphabet consists formula_21 combined symbols low-pass equivalent ofdm signal expressed formula_23 data symbols formula_12 number subcarriers formula_25 ofdm symbol time subcarrier spacing formula_26 makes orthogonal symbol period property expressed formula_28 denotes complex conjugate operator formula_29 kronecker delta avoid intersymbol interference multipath fading channels guard interval length formula_30 inserted prior ofdm block interval cyclic prefix transmitted signal interval formula_31 equals signal interval formula_32 ofdm signal cyclic prefix thus low-pass signal either real complex-valued real-valued low-pass equivalent signals typically transmitted baseband—wireline applications dsl use approach wireless applications low-pass signal typically complex-valued case transmitted signal up-converted carrier frequency formula_13 general transmitted signal represented ofdm used key features common ofdm-based systems presented following table ofdm used adsl connections follow ansi t1.413 g.dmt itu g.992.1 standards called discrete multitone modulation dmt dsl achieves high-speed data connections existing copper wires ofdm also used successor standards adsl2 adsl2+ vdsl vdsl2 g.fast adsl2 uses variable subcarrier modulation ranging bpsk 32768qam adsl terminology referred bit-loading bit per tone 1 15 bits per subcarrier long copper wires suffer attenuation high frequencies fact ofdm cope frequency selective attenuation narrow-band interference main reasons frequently used applications adsl modems ofdm used many powerline devices extend digital connections power wiring adaptive modulation particularly important noisy channel electrical wiring medium speed smart metering modems prime g3 use ofdm modest frequencies 30–100 khz modest numbers channels several hundred order overcome intersymbol interference power line environment ieee 1901 standards include two incompatible physical layers use ofdm itu-t g.hn standard provides high-speed local area networking existing home wiring power lines phone lines coaxial cables based phy layer specifies ofdm adaptive modulation low-density parity-check ldpc fec code ofdm extensively used wireless lan man applications including ieee 802.11a/g/n wimax ieee 802.11a/g/n operating 2.4 5 ghz bands specifies per-stream airside data rates ranging 6 54 mbit/s devices use ht mode added 802.11n top 20 mhz per-stream rate increased 72.2 mbit/s option data rates 13.5 150 mbit/s using 40 mhz channel four different modulation schemes used bpsk qpsk 16-qam 64-qam along set error correcting rates 1/2–5/6 multitude choices allows system adapt optimum data rate current signal conditions ofdm also used wimedia/ecma-368 standard high-speed wireless personal area networks 3.1–10.6 ghz ultrawideband spectrum see multiband-ofdm much europe asia adopted ofdm terrestrial broadcasting digital television dvb-t dvb-h t-dmb radio eureka 147 dab digital radio mondiale hd radio t-dmb directive european commission television services transmitted viewers european community must use transmission system standardized recognized european standardization body standard developed codified dvb project digital video broadcasting dvb framing structure channel coding modulation digital terrestrial television customarily referred dvb-t standard calls exclusive use cofdm modulation dvb-t widely used europe elsewhere terrestrial digital tv ground segments digital audio radio service sdars systems used xm satellite radio sirius satellite radio transmitted using coded ofdm cofdm word coded comes use forward error correction fec question relative technical merits cofdm versus 8vsb terrestrial digital television subject controversy especially european north american technologists regulators united states rejected several proposals adopt cofdm-based dvb-t system digital television services instead opted 8vsb vestigial sideband modulation operation one major benefits provided cofdm rendering radio broadcasts relatively immune multipath distortion signal fading due atmospheric conditions passing aircraft proponents cofdm argue resists multipath far better 8vsb early 8vsb dtv digital television receivers often difficulty receiving signal also cofdm allows single-frequency networks possible 8vsb however newer 8vsb receivers far better dealing multipath hence difference performance may diminish advances equalizer design cofdm also used radio standards digital audio broadcasting dab standard digital audio broadcasting vhf frequencies digital radio mondiale drm standard digital broadcasting shortwave medium wave frequencies 30 mhz drm+ recently introduced standard digital audio broadcasting vhf frequencies 30 174 mhz usa uses alternate standard proprietary system developed ibiquity dubbed hd radio however uses cofdm underlying broadcast technology add digital audio medium wave fm broadcasts digital radio mondiale hd radio classified in-band on-channel systems unlike eureka 147 dab digital audio broadcasting uses separate vhf uhf frequency bands instead band-segmented transmission orthogonal frequency division multiplexing bst-ofdm system proposed japan isdb-t isdb-tsb isdb-c broadcasting systems improves upon cofdm exploiting fact ofdm carriers may modulated differently others within multiplex forms cofdm already offer kind hierarchical modulation though bst-ofdm intended make flexible 6 mhz television channel may therefore segmented different segments modulated differently used different services possible example send audio service segment includes segment composed number carriers data service another segment television service yet another segment—all within 6 mhz television channel furthermore may modulated different parameters example audio data services could optimized mobile reception television service optimized stationary reception high-multipath environment ultra-wideband uwb wireless personal area network technology may also use ofdm multiband ofdm mb-ofdm uwb specification advocated wimedia alliance formerly multiband ofdm alliance mboa wimedia alliance two merged one competing uwb radio interfaces fast low-latency access seamless handoff orthogonal frequency division multiplexing flash-ofdm also referred f-ofdm based ofdm also specified higher protocol layers developed flarion purchased qualcomm january 2006 flash-ofdm marketed packet-switched cellular bearer compete gsm 3g networks example 450 mhz frequency bands previously used nmt-450 c-net c450 1g analogue networks mostly decommissioned europe licensed flash-ofdm operators finland license holder digita began deployment nationwide 450 wireless network parts country since april 2007 purchased datame 2011 february 2012 datame announced would upgrade 450 mhz network competing cdma2000 technology slovak telekom slovakia offers flash-ofdm connections maximum downstream speed 5.3 mbit/s maximum upstream speed 1.8 mbit/s coverage 70 percent slovak population flash-ofdm network switched majority slovakia 30 september 2015 t-mobile germany used flash-ofdm backhaul wi-fi hotspots deutsche bahn ice high speed trains 2005 2015 switching umts lte american wireless carrier nextel communications field tested wireless broadband network technologies including flash-ofdm 2005 sprint purchased carrier 2006 decided deploy mobile version wimax based scalable orthogonal frequency division multiple access sofdma technology citizens telephone cooperative launched mobile broadband service based flash-ofdm technology subscribers parts virginia march 2006 maximum speed available 1.5 mbit/s service discontinued april 30 2009 ofdm become interesting technique power line communications plc area research wavelet transform introduced replace dft method creating orthogonal frequencies due advantages wavelets offer particularly useful noisy power lines instead using idft create sender signal wavelet ofdm uses synthesis bank consisting formula_36-band transmultiplexer followed transform function receiver side analysis bank used demodulate signal bank contains inverse transform followed another formula_36-band transmultiplexer relationship transform functions example w-ofdm uses perfect reconstruction cosine modulated filter bank pr-cmfb extended lapped transform elt used wavelet tf thus formula_42 formula_43 given two functions respective inverses used modulate demodulate given input sequence case dft wavelet transform creates orthogonal waves formula_47 formula_48 ... formula_49 orthogonality ensures interfere sent simultaneously receiver formula_50 formula_51 ... formula_52 used reconstruct data sequence w-ofdm evolution standard ofdm certain advantages mainly sidelobe levels w-ofdm lower results less ici well greater robustness narrowband interference two properties especially useful plc lines n't shielded em-noise creates noisy channels noise spikes comparison two modulation techniques also reveals complexity algorithms remains approximately | [
6874,
6335,
7241,
2099,
5994,
3956,
8184,
2117,
4970,
3314,
2149,
768,
255,
5175,
3834
] | Test |
5,694 | 2 | Windows_Driver_Model:windows driver model computing windows driver model wdm also known one point win32 driver model framework device drivers introduced windows 98 windows 2000 replace vxd used older versions windows windows 95 windows 3.1 well windows nt driver model wdm drivers layered stack communicate via i/o request packets irps microsoft windows driver model unified driver models windows 9x windows nt product lines standardizing requirements reducing amount code needed written wdm drivers run operating systems earlier windows 98 windows 2000 windows 95 windows nt 4.0 windows 3.1 conforming wdm drivers binary compatible source-compatible across windows 98 windows 98 second edition windows windows 2000 windows xp windows server 2003 windows vista backwards compatibility x86-based computers wdm drivers designed forward-compatible wdm driver run version windows newer driver initially written would mean driver take advantage new features introduced new version wdm generally backward-compatible wdm driver guaranteed run older version windows example windows xp use driver written windows 2000 make use new wdm features introduced windows xp however driver written windows xp may may load windows 2000 wdm exists intermediary layer windows 2000 kernel-mode drivers introduced increase functionality ease writing drivers windows although wdm mainly designed binary source compatible windows 98 windows 2000 may always desired specific drivers developed either operating system windows drivers model wdm devices microsoft implements approach kernel mode drivers unique windows operating systems wdm implements layered architecture device drivers every device computer served stack drivers however every driver stack chain isolate hardware independent features driver beneath drivers stack need interact directly one another wdm defines architecture device procedures range devices display network card known network driver interface specification ndis ndis architecture layered network drivers include lower-level drivers manage hardware upper-level drivers implement network data transport transmission control protocol tcp wdm defines three types device drivers driver stacks given device contain types device drivers three wdm device driver types bus driver every bus mainboard one bus driver primary responsibility identification devices connected bus responding plug play events microsoft provide bus drivers part operating system pci pnpisa scsi usb firewire function driver principal driver device provides operational interface device handling read write operations function drivers written device vendors interaction hardware depend specific bus driver present windows operating system filter driver driver optional modify behaviour device input output requests drivers implemented lower-level upper-level filter drivers function drivers bus drivers often implemented driver/minidriver pairs practice either class/miniclass port/miniport pair bus drivers devices attached bus implemented class drivers hardware-agnostic support operations certain type device windows operating systems include number class drivers kbdclass.sys driver keyboards miniclass drivers hand supplied vendor device support device specific operations particular device given class port drivers support general input/output i/o operations peripheral hardware interface core functionality port drivers mandated operating system windows operating systems integrate variety port drivers example i8042prt.sys port driver 8042 microcontroller connects ps/2 keyboards mainboard peripheral bus miniport drivers like miniclass drivers supplied hardware vendors support device specific operations peripheral hardware connected port mainboard driver processes i/o request device corresponding object loaded main memory device object created windows operating system associated device class device objects contain structures type device_object store pointers driver run time pointers used locate driver dispatch routine member functions wdm driver stack filter driver device object known upper filter receive i/o request packet irp device i/o manager upper filter driver serve request locate object driver one step driver stack irp passed driver stack calling function iocalldrive processed function driver device object also known functional device object function driver device object turn may pass irp lower filter another filter device object irp may passed bus driver operates physical device object bus driver object bottom driver stack interacts hardware abstraction layer part windows operating system kernel allows windows operating systems run variety processors different memory management unit architectures variety computer systems different i/o bus architectures execution irp finished driver objects stack returns request back i/o manager result status flag wdm framework developed microsoft simplify communication operating system drivers inside kernel windows operating systems drivers implemented dynamic link libraries .dll .sys files wdm compliant drivers must follow rules design initialisation plug-and-play power management memory allocation practice wdm driver programmers reuse large pieces code building new object orientated drivers means drivers wdm stack may contain residual functionality documented specifications drivers passed microsoft quality test digitally signed microsoft microsoft hardware compatibility tests driver development kit include reliability stress tests device driver designed specific hardware component may allow another device function basic functionality hardware device class similar functionality video card class example allows microsoft basic display adapter driver work wide variety video cards however installing wrong driver device mean full functionality device used may result poor performance destabilization windows operating system hardware device vendors may release updated device drivers particular windows operating systems improve performance add functionality fix bugs device working expected latest device drivers downloaded vendor website installed device drivers designed particular windows operating system versions device drivers previous version windows may work correctly versions many device drivers run kernel mode installing drivers previous operating system version may destabilise windows operating system migrating computer higher version windows operating system therefore requires new device drivers installed hardware components finding date device drivers installing windows 10 introduced complications migration process common device driver compatibility issues include 32-bit device driver required 32-bit windows operating system 64-bit device driver required 64-bit windows operating system 64-bit device drivers must signed microsoft run kernel mode unrestricted access computer hardware operating systems prior windows 10 microsoft allowed vendors sign 64-bit drivers assuming vendors undertaken compatibility tests however windows 10 64-bit drivers need signed microsoft therefore device vendors submit drivers microsoft testing approval driver installation package includes files .inf directory files package need installed otherwise installation device driver may fail operating system versions windows 10 files necessary driver installation included package requirement consistently enforced device driver installers user interface gui often requiring user configuration input absence user interface mean installation device driver successful besides windows 10 device drivers allowed include user interface network driver interface specification ndis 10.x used network devices windows 10 operating system network device drivers windows xp use ndis 5.x may work subsequent windows operating systems performance reasons network device drivers implement ndis 6.0 higher similarly wddm driver model windows vista replaces xpdm used graphics drivers device manager control panel applet microsoft windows operating systems allows users view control hardware attached computer allows users view modify hardware device properties also primary tool manager device drivers windows driver model significant improvement vxd windows nt driver model used criticised driver software developers significantly following also number concerns quality documentation samples microsoft provided issues microsoft released new set frameworks top wdm called windows driver frameworks wdf formerly windows driver foundation includes kernel-mode driver framework kmdf user-mode driver framework umdf windows vista supports pure wdm newer wdf kmdf also available download windows xp even windows 2000 umdf available windows xp | [
7149,
6420,
714,
720,
1460,
2204,
2928,
7907,
4697,
5747,
2953,
53,
6840,
422,
425,
7228,
4017,
6504,
4022,
4026,
7607,
1526,
3687,
4759,
7619,
7621,
7971,
2283,
2290,
5479,
7637,
7263,
5850,
150,
6933,
519,
3052,
4448,
3407,
2341,
1232... | Validation |
5,695 | 7 | Distributed_Common_Ground_System:distributed common ground system distributed common ground system dcgs system produces military intelligence multiple military branches u.s. air force use system produces intelligence collected u-2 dragonlady rq-4 global hawk mq-9 reaper mq-1 predator previous system similar use deployable ground station dgs first deployed july 1994 subsequent version dgs developed 1995 2009 although officially designated weapons system consists computer hardware software connected together computer network devoted processing dissemination information images 480th intelligence surveillance reconnaissance wing air combat command operates maintains usaf system plan envisioned 1998 develop interoperable systems army navy addition air force 2006 version 10.6 deployed air force version known dcgs-a developed army 2010 report general michael t. flynn program intended use cloud computing easy use ipad soldiers years commonly using april 2011 project manager colonel charles wells announced version 3 army system code named griffin deployed us war afghanistan january 2012 united states army communications-electronics research development engineering center hosted meeting based dcgs-a early experience brought together technology providers hope developing integrated systems using cloud computing open architectures compared previously specialized custom-built systems major contractor lockheed martin computers supplied silicon graphics international chippewa falls wisconsin office software known analyst notebook originally developed i2 limited included dcgs-a ibm acquired i2 2011 us army personnel reported using palantir technologies product improve ability predict locations improvised explosive devices april 2012 report recommending study initial success palantir software rated easy use flexibility wide number data sources dcgs-a july 2012 congressman duncan d. hunter california state palantir based complained us dod obstacles wider use although limited test august 2011 test evaluation command recommended deployment operation problems dcgs-a included baseline system operationally effective reboots average every 8 hours set improvements identified november 2012 press reported shortcomings uncovered general genaro dellarocco tests ambitious goal integrating 473 data sources 75 million reports proved challenging spending estimated 2.3 billion army system alone may 2013 politico reported palantir lobbyists anonymous returning veterans continued advocate use software despite interoperability limits particular members special forces us marines required use official army system similar stories appeared publications army representatives major general mary a. legere citing limitations various systems congressman hunter member house armed services committee required review program two members congress sent open letter secretary defense leon panetta senate defense appropriations subcommittee included testimony army chief staff general ray odierno 130th engineer brigade united states found system unstable slow friendly major hindrance operations equivalent system united states navy planned initial deployment 2015 within shipboard network called consolidated afloat networks enterprise services canes 2016 early testing announced 2009 aboard aircraft carrier portion software distributed data framework dcgs integration backbone dib version 4 submitted open-source software repository codice foundation github framework new dib version 4 replacing legacy dib portal ozone widget framework interface written java programming language distributed common ground system-army dcgs-a united states army primary system post data process information disseminate intelligence surveillance reconnaissance isr information threat weather terrain echelons dcgs-a provides commanders ability task battle-space sensors receive intelligence information multiple sources august 17 2011 upi article quoted i2 chief executive officer robert griffin commented dcgs-a best-of-breed approach development article detailed army contracting i2 analyst notebook software open architecture analyst notebook supports army strategy employ integrate best-of-breed solutions across industry meet dynamic needs users face field daily basis february 1 2012 article army web page quoted mark kitz dcgs-a technical director dcgs-a uses latest cloud technology rapidly gather collaborate share intelligence data multiple sources deliver common operating picture dcgs-a able rapidly adapt changing operational environments leveraging iterative development model open architecture allowing collaboration multiple government industry academic partners july 2012 article signal magazine monthly publication armed forces communications electronics association promoted dcgs-a taking advantage technological environments young soldiers familiar article quoted dcgs-a program manager col. charles wells systems benefits article also included lockheed martin dcgs-a program manager milwaukee journal sentinel published article may 4 2012 wisconsin-located companies helping dcgs-a cloud computing technology article promoted speed cloud computing processes intelligence cost savings analyzing data field u.s. army released 2011 army posture statement march 2 included statement dcgs-a dcgs-a connects tactical operational theater-level commanders hundreds intelligence intelligence-related data sources classification levels allows focus efforts entire isr community information requirements ground commanders describe dcgs-a unwieldy unreliable hard learn difficult use supporting alternative software palantir technologies palantir software supports small unit situational awareness sufficiently funded support broader role dcgs-a fulfills | [
2961,
4802,
4575,
4482,
7848
] | Test |
5,696 | 1 | Dictionary_of_Scottish_Architects:dictionary scottish architects dictionary scottish architects publicly available online database provides biographical information architects known worked scotland 1840 1980 lists works launched 2006 compiled team led professor david walker emeritus professor school art history university st andrews database includes known works architects based scotland scottish works english irish architects included database available free charge managed fully funded historic environment scotland replaced historic scotland 2015 | [
2054
] | Test |
5,697 | 4 | Heap_overflow:heap overflow heap overflow heap overrun type buffer overflow occurs heap data area heap overflows exploitable different manner stack-based overflows memory heap dynamically allocated application run-time typically contains program data exploitation performed corrupting data specific ways cause application overwrite internal structures linked list pointers canonical heap overflow technique overwrites dynamic memory allocation linkage malloc meta data uses resulting pointer exchange overwrite program function pointer typical example older versions linux two buffers allocated next heap writing beyond boundary first buffer allows overwriting meta data second buffer setting in-use bit zero second buffer setting length small negative value allows null bytes copied program calls free first buffer attempt merge two buffers single buffer happens buffer assumed freed expected hold two pointers fd bk first 8 bytes formerly allocated buffer bk gets written fd used overwrite pointer accidental overflow may result data corruption unexpected behavior process uses affected memory area operating systems without memory protection could process system deliberate exploit may result data specific location altered arbitrary way arbitrary code executed example microsoft jpeg gdi+ buffer overflow vulnerability could allow remote execution code affected machine ios jailbreaking often uses heap overflows gain arbitrary code execution usually kernel exploits achieve ability replace kernel one jailbreak provides buffer overflows primarily three ways protect heap overflows several modern operating systems windows linux provide implementation three since version 2.3.6 gnu libc includes protections detect heap overflows fact example checking pointer consistency calling unlink however protections prior exploits almost immediately shown also exploitable addition linux included support aslr since 2005 although pax introduced better implementation years also linux included support nx-bit since 2004 microsoft included protections heap resident buffer overflows since april 2003 windows server 2003 august 2004 windows xp service pack 2 mitigations safe unlinking heap entry header cookies later versions windows vista server 2008 windows 7 include removal commonly targeted data structures heap entry metadata randomization expanded role heap header cookie randomized heap base address function pointer encoding termination heap corruption algorithm variation normal data execution prevention dep aslr also help mitigate attack | [
643,
1019,
2289,
3407,
5381,
5962,
2885,
651,
4779,
3220,
8064,
5397,
1265
] | Test |
5,698 | 9 | UBot_Studio:ubot studio ubot studio web browser automation tool allows users build scripts complete web-based actions data mining web testing social media marketing scripts created via command window inside ubot studio browser compiled separate executable files “ internet bots ” run computer called “ infrastructural piece botting world ” ubot studio developed seth turin media inc. first released 2009 ubot studio web automation product designed internet marketing automation advanced versions ubot studio contain drag-and-drop user interface designer bots image recognition task scheduler ability automate non web-based applications 2013 company introduced api creation plugins allow addition non-standard functionality software 2015 company released ubot studio stealth new browser using cef framework additional features | [
5571
] | Test |
5,699 | 5 | Waterfox:waterfox waterfox open-source web browser x64 arm64 systems intended speedy ethical maintain support legacy extensions dropped firefox forked official releases windows including portable version macos linux android waterfox based firefox compiled using various compilers using intel math kernel library streaming simd extensions 3 advanced vector extensions linux builds built clang waterfox continuing support long-standing xul xpcom add-on capability firefox removed version 57 features waterfox currently waterfox first released march 27 2011 64-bit windows mac build introduced may 14 2015 release version 38.0 linux build introduced december 20 2016 release version 50.0 android build first introduced version 55.2.2 version 29.0 released july 22 2015 build ios may 7 2019 68.0a1 first alpha version next generation waterfox released may 12 2015 november 12 2015 waterfox exclusive charity search engine called storm ecosia default search engine bing search engine default one | [
4655,
6802,
5378,
7537,
6809,
393,
3291,
2574,
2577,
6452,
6458,
3655,
4352,
4725,
4357,
1136,
7587,
6858,
84,
445,
1152,
1525,
4755,
4759,
7975,
7628,
5821,
5127,
1190,
6540,
3383,
8006,
8009,
5506,
3043,
1970,
6221,
520,
3057,
3060,
3... | Test |
5,700 | 4 | Citizen_Lab:citizen lab citizen lab interdisciplinary laboratory based munk school global affairs university toronto canada founded directed professor ronald deibert citizen lab studies information controls—such network surveillance content filtering—that impact openness security internet pose threats human rights citizen lab collaborates research centres organizations individuals around world uses mixed methods approach combines computer-generated interrogation data mining analysis intensive field research qualitative social science legal policy analysis methods citizen lab founding partner opennet initiative 2002–2013 information warfare monitor 2002–2012 projects organization also developed original design psiphon censorship circumvention software spun lab private canadian corporation psiphon inc. 2008 citizen lab research outputs made global news headlines around world including front page exclusives new york times washington post globe mail tracking ghostnet 2009 researchers uncovered suspected cyber espionage network 1,295 infected hosts 103 countries high percentage high-value targets including ministries foreign affairs embassies international organizations news media ngos seminal study one first public reports reveal cyber espionage network targeted civil society government systems around world shadows cloud 2010 researchers documented complex ecosystem cyber espionage systematically compromised government business academic computer network systems india offices dalai lama united nations several countries million dollar dissident published august 2016 researchers discovered ahmed mansoor one uae five human rights defender united arab emirates targeted software developed israeli cyber war company nso group using chain zero-day exploits operators spyware attempted get mansoor click link socially engineered text message would given access everything phone prior releases report researchers contacted apple released security update patched vulnerabilities exploited spyware operators citizen lab number awards work first canadian institution win macarthur foundation ’ macarthur award creative effective institutions 2014 canadian institution receive new digital age grant 2014 google executive chairman eric schmidt past awards include electronic frontier foundation pioneer award 2015 canadian library association advancement intellectual freedom canada award 2013 canadian committee world press freedom press freedom award 2011 canadian journalists free expression ’ vox libera award 2010 according january 24 2019 ap news report citizen lab researchers targeted international undercover operatives citizen lab independent government corporate interests financial support citizen lab come ford foundation open society institute social sciences humanities research council canada international development research centre idrc canada centre global security studies university toronto ’ munk school global affairs john d. catherine t. macarthur foundation donner canadian foundation open technology fund walter duncan gordon foundation citizen lab received donations software support palantir technologies virustotal oculus info inc citizen lab ’ targeted threats research stream seeks gain better understanding technical social nature digital attacks civil society groups political context may motivate citizen lab conducts ongoing comparative analysis growing spectrum online threats including internet filtering denial-of-service attacks targeted malware targeted threats reports covered number espionage campaigns information operations tibetan community diaspora phishing attempts made journalists human rights defenders political figures international investigators anti-corruption advocates mexico prominent human rights advocate focus government surveillance united arab emirates citizen lab researchers collaborators like electronic frontier foundation also revealed several different malware campaigns targeting syrian activists opposition groups context syrian civil war many findings translated arabic disseminated along recommendations detecting removing malware citizen lab ’ research threats civil society organizations featured front page businessweek covered al jazeera forbes wired among international media outlets group reports work analyzing spyware used target opposition figures south america triggered death threats september 2015 members group received pop-up said opennet initiative tested internet filtering 74 countries found 42 them—including authoritarian democratic regimes—implement level filtering citizen lab continued research area internet censorship lab iclab project aimed developing new systems methods measuring internet censorship collaborative effort citizen lab professor phillipa gill group stony brook university department computer science professor nick feamster network operations internet security group princeton university citizen lab studies censorship surveillance implemented popular applications including social networks instant messaging search engines previous work includes investigations censorship practices search engines provided google microsoft yahoo chinese market along domestic chinese search engine baidu 2008 nart villeneuve found tom-skype chinese version skype time collected stored millions chat records publicly accessible server based china 2013 citizen lab researchers collaborated professor jedidiah crandall ph.d. student jeffrey knockel university new mexico reverse engineering tom-skype sina uc another instant messaging application used china team able obtain urls encryption keys various versions two programs downloaded keyword blacklists daily work analyzed one year half data tracking keyword lists examined social political contexts behind content lists analyzed times list updated including correlations current events current research focuses monitoring information controls popular chinese microblogging service sina weibo chinese online encyclopedias mobile messaging applications popular asia asia chats project utilizes technical investigation censorship surveillance assessment use storage user data comparison terms service privacy policies applications first report released project examined regional keyword filtering mechanisms line applies chinese users analysis popular cellphone app called smart sheriff citizen lab german group cure53 asserted app represented security hole betrayed privacy children meant protect parents south korean law required cellphones sold 18 contain software designed protect children smart sheriff popular government approved app—with 380,000 subscribers citizen lab/cure53 report described smart sheriff security holes catastrophic citizen lab conducts groundbreaking research global proliferation targeted surveillance software toolkits including finfisher hacking team nso group finfisher suite remote intrusion surveillance software developed munich-based gamma international gmbh marketed sold exclusively law enforcement intelligence agencies uk-based gamma group 2012 morgan marquis-boire bill marczak provided first public identification finfisher software citizen lab collaborators done extensive investigations finfisher including revealing use bahraini activists analyzing variants finfisher suite target mobile phone operating systems uncovering targeted spying campaigns political dissidents malaysia ethiopia documenting finfisher command control servers 36 countries citizen lab finfisher research informed inspired responses civil society organizations pakistan mexico united kingdom mexico example local activists politicians collaborated demand investigation state acquisition surveillance technologies uk led crackdown sale software worries misuse repressive regimes hacking team milan italy-based company provides intrusion surveillance software called remote control system rcs law enforcement intelligence agencies citizen lab collaborators mapped rcs network endpoints 21 countries revealed evidence rcs used target human rights activist united arab emirates moroccan citizen journalist organization independent news agency run members ethiopian diaspora following publication hacking team targeting ethiopian journalists electronic frontier foundation privacy international took legal action related allegations ethiopian government compromised computers ethiopian expatriates united states uk 2018 citizen lab released investigation global proliferation internet filtering systems manufactured canadian company netsweeper inc using combination publicly available ip scanning network measurement data technical tests identified netsweeper installations designed filter internet content operational networks 30 countries focused 10 past histories human rights challenges afghanistan bahrain india kuwait pakistan qatar somalia sudan uae yemen websites blocked countries include religious content political campaigns media websites particular interest netsweeper ‘ alternative lifestyles ’ category appears one principal purposes blocking non-pornographic lgbtq content including offered civil rights advocacy organizations hiv/aids prevention organizations lgbtq media cultural groups citizen lab called government agencies abandon act filtering lgbt content since 2016 citizen lab published number reports pegasus spyware mobile devices developed nso group israeli-based cyber intelligence firm citizen lab ten part series nso group ran 2016 2018 august 2018 report timed coordinate amnesty international in-depth report nso group 2017 group released several reports showcased phishing attempts mexico used nso group technology products used multiple attempts gain control mobile devices mexican government officials journalists lawyers human rights advocates anti-corruption workers operations used sms messages bait attempt trick targets clicking links nso group exploit infrastructure clicking links would lead remote infection target phone one case son one journalists—a minor time—was also targeted nso purports sell products governments also came group focus prominent uae human rights defender ahmed mansoor mobile phone targeted report attempts showed first time ios zero day exploits wild prompted apple release security update ios 9.3.5 affecting 1 billion apple users worldwide citizen lab research surveillance software featured front pages washington post new york times covered extensively news media around world including bbc bloomberg cbc slate salon citizen lab research commercial surveillance technologies resulted legal policy impacts december 2013 wassenaar arrangement amended include two new categories surveillance systems dual use control list— intrusion software ip network surveillance systems wassenaar arrangement seeks limit export conventional arms dual-use technologies calling signatories exchange information provide notification export activities goods munitions included control lists amendments december 2013 product intense lobbying civil society organizations politicians europe whose efforts informed citizen lab research intrusion software like finfisher surveillance systems developed marketed blue coat systems citizen lab studies commercial market censorship surveillance technologies consists range products capable content filtering well passive surveillance citizen lab developing refining methods performing internet-wide scans measure internet filtering detect externally visible installations url filtering products goal work develop simple repeatable methodologies identifying instances internet filtering installations devices used conduct censorship surveillance citizen lab conducted research companies blue coat systems netsweeper smartfilter major reports include devices wander mistake planet blue coat redux 2013 pakistan stand guard thee analysis canada-based netsweeper ’ role pakistan ’ censorship regime 2013 planet blue coat mapping global censorship surveillance tools 2013 research covered news media around world including front page washington post new york times globe mail jakarta post following 2011 publication behind blue coat investigations commercial filtering syria burma blue coat systems officially announced would longer provide support updates services software syria december 2011 u.s. department commerce bureau industry security reacted blue coat evidence imposed 2.8 million fine emirati company responsible purchasing filtering products blue coat exporting syria without license citizen lab netsweeper research cited pakistani civil society organizations bytes bolo bhi public interest litigation pakistani government formal complaints high commission embassy canada pakistan citizen lab examines transparency accountability mechanisms relevant relationship corporations state agencies regarding personal data surveillance activities research investigated use artificial intelligence canada immigration refugee systems co-authored international human rights program university toronto faculty law analysis ongoing encryption debates canadian context co-authored canadian internet policy public interest clinic close look consumer personal data requests canada summer 2017 government canada introduced new national security legislation bill c-59 national security act proposed significantly change canada national security agencies practices including canada signals intelligence agency communications security establishment since bill first proposed range civil society groups academics called significant amendments proposed act co-authored paper citizen lab canadian internet policy public interest clinic represented detailed comprehensive analysis cse-related reforms date analysis produced help members parliament journalists researchers lawyers civil society advocates engage effectively issues included parliamentary committee debates highlighted dozens media reports citizen lab active participant various global discussions internet governance internet governance forum icann united nations government group experts information telecommunications since 2010 citizen lab helped organize annual cyber dialogue conference hosted munk school global affairs ’ canada centre convenes 100 individuals countries around world work government civil society academia private enterprise effort better understand pressing issues cyberspace cyber dialogue participatory format engages attendees moderated dialogue internet security governance human rights conferences around world including high-level meeting hague-based scientific council government policy swedish government stockholm internet forum taken themes inspired discussions cyber dialogue citizen lab contributes field building supporting networks researchers advocates practitioners around world particularly global south citizen lab developed regional networks activists researchers working information controls human rights past ten years networks asia opennet asia commonwealth independent states opennet eurasia middle east north africa support international development research centre idrc citizen lab launched cyber stewards network 2012 consists south-based researchers advocates practitioners analyze impact cybersecurity policies practices local regional international level project consists 24 partners across asia sub-saharan africa latin america middle east north africa including 7iber opennet centre internet society citizen lab staff also work local partners educate train at-risk communities example 2013 collaborated tibet action institute hold public awareness events dharamshala india exiled tibetan community cyber espionage campaigns winter 2013 citizen lab conducted digital security training session russian investigative journalists sakharov center moscow citizen lab work often cited media stories relating digital security privacy controls government policy human rights technology since 2006 featured 24 front-page stories publications including new york times washington post globe mail international herald tribune since 2013 citizen lab hosted summer institute monitoring internet openness rights annual research workshop munk school global affairs university toronto brings together researchers practitioners academia civil society private sector working internet openness security rights collaborations formed clsi workshops led publication high impact reports internet filtering zambia security audit child monitoring apps south korea analysis great cannon attack tool china used large scale distributed-denial service attacks github greatfire.org according report ap news journalist raphael satter citizen lab researchers reported october israeli nso group surveillance software used spy inner circle jamal khashoggi murder targeted turn international undercover operatives citizen lab october report revealed nso signature spy software placed iphone saudi dissident omar abdulaziz one khashoggi ’ confidantes months abdulaziz said saudi arabia spies used hacking software reveal khashoggi private criticisms saudi royal family said played major role death march 2019 new york times reported citizen lab target uae contractor darkmatter | [
3528,
909,
3453,
4320,
1939,
4961,
2488,
1395,
1863,
7843,
2327,
6842,
3047,
1886,
2791,
1790
] | Test |
5,701 | 9 | Advice_(programming):advice programming aspect functional programming advice describes class functions modify functions latter run certain function method procedure applied given join point program following taken discussion mailing list aosd-discuss pascal costanza contributed following term advice goes back term advising introduced warren teitelman phd thesis 1966 quote chapter 3 thesis advising found way bbn lisp later xerox parc interlisp also found way flavors first object-oriented extension lisp developed mit subsumed notion method combination since method combination macros closely related also interesting note first macro system described 1963 three years warren teitelman phd thesis practical use advice functions generally modify otherwise extend behavior functions easily modified extended emacspeak emacs-addon makes extensive use advice must modify thousands existing emacs modules functions produce audio output blind corresponding visual presentation would infeasible copy redefine produce audio output addition normal outputs emacspeak programmers define advice functions run another emacs example suppose one corrected misspelled word ispell one wanted re-spellcheck entire buffer codice_1 offers functionality even spellchecked word used thousand times one could track definition codice_1 copy one .emacs write additional functionality tedious prone broken-ness .emacs version get sync actual ispell elisp module even works home one wants fairly simple run another command codice_1 runs using advice functions done simply form advices part c classes late 1970s early 1980s namely functions called codice_4 codice_5 defined class called respectively member functions class however dropped c++ advices part common lisp object system clos codice_6 codice_7 codice_8 methods combined primary method standard method combination common lisp implementations provide advice functionality addition standard method combination clos extensions lispworks supports advising functions macros clos methods emacslisp added advice-related code version 19.28 1994 gregor kiczales comments follows | [
7678,
4543,
5501,
5965,
3788,
3749,
6888,
2600
] | Test |
5,702 | 4 | Claims-based_identity:claims-based identity claims-based identity common way applications acquire identity information need users inside organization organizations internet also provides consistent approach applications running on-premises cloud claims-based identity abstracts individual elements identity access control two parts notion claims concept issuer authority claim statement one subject person organization makes another subject example statement name group buying preference ethnicity privilege association capability subject making claim claims provider claims packaged one tokens issued issuer provider commonly known security token service sts name claims-based identity confusing first seems like misnomer attaching concept claims concept identity appears combining authentication determination identity authorization identified subject may may however closer examination reveals case claims subject subject application receiving incoming claim map is/is claims may/may rules application traditional systems often confusion differences similarities user is/is user may/may claims-based identity makes distinction clear distinction user is/is user may/may clarified possible authentication user is/is claims handled third party third party called security token service better understand concept security token service consider analogy night club doorman doorman wants prevent under-age patrons entry facilitate requests patron present driver license health insurance card identification token issued trusted third party security token service provincial state vehicle license department health department insurance company nightclub thus alleviated responsibility determining patron age trust issuing authority course make judgment authenticity token presented two steps completed nightclub successfully authenticated patron regard claim legal drinking age continuing analogy nightclub may membership system certain members may regular vip doorman might ask another token membership card might make another claim member vip case trusted issuing authority token would probably club membership card makes claim patron vip club react accordingly translating authenticated vip membership claim permission patron permitted sit exclusive lounge area served free drinks note uses term authentication include claims acquisition difference authentication limited binding user information contained user target site attribute data claim required complete authentication privacy concerns become important ability digital entities authenticate users without access personal attributes becomes increasingly important claims-based identity potential simplify authentication logic individual software applications applications n't provide mechanisms account creation password creation reset furthermore claims-based identity enables applications know certain things user without interrogate user determine facts facts claims transported envelope called secure token claims-based identity greatly simplify authentication process user n't sign multiple times multiple applications single sign creates token used authenticate multiple applications web sites addition certain facts claims packaged token user tell individual application facts repeatedly instance answering similar questions completing similar forms | [
2489,
2961,
1373,
5692
] | Test |
5,703 | 9 | David_Sayre:david sayre david sayre march 2 1924 – february 23 2012 american scientist credited early development direct methods protein crystallography diffraction microscopy also called coherent diffraction imaging working ibm part initial team ten programmers created fortran later suggested use electron beam lithography fabrication x-ray fresnel zone plates international union crystallography awarded sayre ewald prize 2008 unique breadth contributions crystallography range seminal contributions solving phase problem complex physics imaging generic objects x-ray diffraction microscopy ... sayre born new york city completed bachelor degree physics yale university age 19 working mit radiation laboratory earned ms degree auburn university 1948 1949 moved oxford wife anne colquhoun married 1947 sayre completed doctoral studies dorothy hodgkin group 1951 time sayre discovered equation named based concept atomicity although key direct methods still use today sayre share 1985 chemistry nobel prize awarded discovery also around time sayre inspired claude shannon recent work suggested short paper crystallographic phase problem could solved easily one could measure intensities higher density imposed bragg law insight widely seen initial spark lead recent lensless imaging techniques back united states david sayre worked structure determination carcinogen molecule lab peter friedlander university pennsylvania philadelphia structure determination program wrote ibm 701 attracted attention john backus hired part initial team programmers developed high-level programming language fortran sayre remain ibm retirement 1990 early 1970s sayre became interested x-ray microscopy suggested use newly developed electron beam lithography apparatus ibm produce fresnel zone plates type x-ray lens widely used synchrotron facilities '80s came back goal achieving lensless imaging pursued rest life | [
7003,
8066,
2803,
1381
] | Test |
5,704 | 2 | Edubuntu:edubuntu edubuntu previously known ubuntu education edition official derivative ubuntu operating system designed use classrooms inside schools homes communities edubuntu developed collaboration teachers technologists several countries edubuntu built top ubuntu base incorporates ltsp thin client architecture several education-specific applications aimed users aged 6 18 designed easy installation ongoing system maintenance included edubuntu linux terminal server project many applications relevant education including gcompris kde edutainment suite sabayon profile manager pessulus lockdown editor edubuntu menueditor libreoffice gnome nanny italc edubuntu cds previously available free charge shipit service available download dvd format edubuntu default gui unity gnome still available unity default gui since release 12.04 since release 7.10 kde also available edubuntu kde 2010 edubuntu qimo 4 kids project working providing qimo within edubuntu done would fitted cd primary goal edubuntu enable educator limited technical knowledge skills set computer lab on-line learning environment hour less effectively administer environment principal design goals edubuntu centralized management configuration users processes together facilities working collaboratively classroom setting equally important gathering together best available free software digital materials education according statement goals official edubuntu website aim put together system contains best free software available education make easy install maintain also aims allow low income environments maximize utilisation available older equipment first edubuntu release coincided release ubuntu 5.10 codenamed breezy badger 2005-10-13 8.04 hardy heron release edubuntu given name ubuntu education edition changed add-on standard ubuntu installation instead installable livecd version 9.10 onwards edubuntu changed available full system dvd instead add-on cd edubuntu also installable via selection edubuntu packages distributions using official ubuntu repositories ubuntu kubuntu mainly since 14.04 edubuntu become lts-only edubuntu announced skip 16.04 lts update plan staying 14.04 due lack contributors | [
2179,
2187,
2909,
5724,
6086,
7528,
7894,
386,
2935,
6453,
2585,
2228,
753,
1487,
58,
3996,
7581,
6489,
7587,
4008,
1893,
2260,
7954,
1909,
6884,
7969,
6175,
7251,
4400,
7253,
3696,
474,
1179,
7635,
6902,
2297,
1941,
3023,
6549,
1960,
6... | Test |
5,705 | 9 | NeWS:news news network extensible window system discontinued windowing system developed sun microsystems mid-1980s originally known sundew primary authors james gosling david s. h. rosenthal news interpreter based postscript later display postscript although two projects otherwise unrelated extending allow interaction multiple contexts support windows like postscript news could used complete programming language unlike postscript news could used make complete interactive programs mouse support gui news started implementing postscript interpreter running cooperative multitasking fashion since unlike postscript printer news would displaying number postscript programs time one screen also added complete view hierarchy based viewports known canvases synchronous event distribution system supporting events interests threads monitors like view system guis news included concept tree embedded views along events passed instance mouse click would generate event would passed object directly mouse pointer say button object respond event object button would receive message news included complete model events including timers automatic events input queues devices mice keyboards functionality required full interaction input handling system designed provide strong event synchronization guarantees possible asynchronous protocols like x support user interface widgets news expanded original postscript stack-based language complete object oriented oo programming style inheritance eliminated need external oo language build complete application since additions implemented extensions postscript possible write simple postscript code would result running onscreen interactive program two popular demonstration programs onscreen clock required two pages code program drew pair eyes followed cursor moved around screen eyeball program shown siggraph 1988 inspiration later well-known x application xeyes news included several libraries user interface elements widgets written news widgets ran behaviour news interpreter required communications outside program news code widget demanded example toggle button display routine query button state pressed change display accordingly button postscript code also react mouse clicks changing state pressed pressed vice versa happen windowing server without interaction client program mouse released button event sent handling sophisticated x window system server model report mouse pushed mouse mouse released events client figure event button switch state finally instruct server display new state client server machine interactions must travel network results delay responding news architecturally similar called ajax except news coherently best example library tnt news toolkit sun released 1989 sun also shipped earlier lite toolkit intended example purposes making small programs although adoption never widespread several companies licensed news adapted various uses open look version framemaker desktop publishing program developed frame technology corp. funding mainly sun microsystems nsa one commercial products ran news hyperlook developed arthur van hoff turing institute interactive application design system hopkins developed news version simcity built hyperlook commercial drawing program altsys virtuoso produced news port freehand additional functionality took advantage postscript environment unfortunately sun announced end support news virtuoso became ready ship compared x news vastly powerful also slower especially local connections c api low level difficult use news programs tended entirely written postscript another factor popularity sun charged fee license news source code mit x11 code free cost first versions news emulated x10 protocol translating calls news postscript speed problems plus existence programs relied exact pixel results x10 calls obsolescence x10 forced sun release x11/news hybrid called xnews ran x11 server parallel postscript interpreter seriously degraded news interpreter performance considered good x11 server either sun also implemented open look user interface specification several toolkits news toolkit tnt open look toolkit written postscript ran news server olit built xt x intrinsics base motif xview used apis sun earlier sunview window system clear open look lost motif popularity adobe acquired framemaker sun stopped supporting news products news simply vanished | [
2451,
1254,
2546,
1258,
1923,
6505,
6270,
908,
7535,
1185,
2299,
5571,
4418,
6016,
2033,
4967,
7010,
5587,
1023,
418,
7114,
6221,
3820,
4087,
8138,
4999,
3673,
6778,
7781,
971
] | Test |
5,706 | 1 | Amazon_Aurora:amazon aurora amazon aurora relational database service developed offered amazon web services beginning october 2014 aurora available part amazon relational database service rds aurora offered mysql compatible service upon release added postgresql compatibility october 2017 became possible stop start aurora clusters september 2018 august 2018 amazon began offer serverless version 2019 developers aurora sigmod systems award fundamentally redesigning relational database storage cloud environments aurora automatically allocates database storage space 10-gigabyte increments needed maximum 64 terabytes aurora offers automatic six-way replication chunks across multiple locations improved availability fault-tolerance aurora provides users performance metrics query throughput latency provides fast database cloning amazon designed aurora compatible mysql meaning tools querying managing mysql databases command-line client mysql workbench graphical user-interface used mysql options features available amazon aurora compatible mysql 5.6 5.7 supports innodb storage engine amazon claims fivefold performance improvements benchmarking tests mysql hardware due tightly integrating database engine ssd-based virtualized storage layer purpose-built database workloads reducing writes storage system minimizing lock contention eliminating delays created database process threads independent tests shown aurora performs better competing technologies combinations workload instance type | [
7957,
5894,
4217,
3953,
7722,
8083,
1550,
5571,
6279,
7838,
6462,
4163,
7102,
5064,
2054,
2776,
6219,
5956,
518,
3915
] | Test |
5,707 | 7 | Fabasoft:fabasoft fabasoft ag software manufacturer headquartered linz upper austria company established 1988 helmut fallmann leopold bauernfeind name fabasoft acronym fallmann bauernfeind software fiscal year fabasoft ag commences april 1 number employees respective reporting date march 31 increased recent years 100 staff 2003 185 2004 203 2005 corporate revenue also increased eur 16.94 million 2003/2004 fiscal year eur 21.85 million 2004/2005 eur 25.3 million 2005/2006 fiscal year 2006/2007 fiscal year revenue decreased eur 21.2 million eur 21.6 million recorded 2007/2008 fiscal year 2008/2009 fabasoft ag recorded revenue eur 20.02 million fiscal year 2009/2010 sales revenue eur 23.3 million fabasoft ag stocks listed prime standard frankfurt stock exchange since october 4 1999 fabasoft certified according iso 9001 iso 20000 iso 27001 type ii | [] | Test |
5,708 | 3 | Astron_Belt:astron belt astron belt アストロンベルト early laserdisc video game form third-person space combat rail shooter released arcades 1983 sega japan licensed bally midway release united states developed 1982 commonly cited first laserdisc game game unveiling 1982 amoa show chicago marked beginning laserdisc fever videogame industry release japan following year marked first commercial release laserdisc game however release united states delayed due several hardware software bugs time dragon lair beaten public release astron belt however first laserdisc game released europe arcade game available upright cockpit cabinets latter illuminated buttons control panel larger 25 monitor upright used standard 19 vibrating seat astron belt ported msx home system player controls lone spacecraft mission singlehandedly take entire enemy armada enemy fighters ships shoot player mines objects must shot avoided game divided waves end wave command ship must destroyed later waves enemy fighters move shoot aggressively shots accurate waves take place open space others require player battle enemies flying narrow trenches tunnels player timer beginning game unlimited number lives available length timer adjusted machine operator normally 60 seconds timer expires player given limited number additional lives lives lost game ends background videos used game mixture original artwork borrowed material addition scenes created specifically game designers also incorporated footage three science fiction movies battle beyond stars message space astron belt used one four laserdisc players either pioneer ld-v1000 ld-v1001 hitachi vip-9500sg vip-9550 two different versions laser disc also pressed single-sided version pioneer double-sided version sega however discs information may used four players running sega laserdisc hardware game combines pre-rendered laserdisc footage real-time 2d computer graphics plane real-time graphics plane overlaid imitating matting technique crt monitor scans horizontally across screen fed information laserdisc point fed information computer graphics system information coming laserdisc stops creating black mask sprite inserted uses collision detection system laserdisc sprite planes interact frame laserdisc footage coded hit detection spot stored rom memory zilog z80 cpu reads number laserdisc frame checks laserdisc hit spots shots fired player coordinates correspond instructs laserdisc player display explosion sequence sections player must navigate walls walls laserdisc footage also coded use collision detection astron belt responsible starting interactive movie laserdisc craze shown 1982 amoa show one laserdisc games inspired dragon lair sega bally midway released sequel called starblazer also known galaxy ranger 1984 controls similar gameplay astron belt one machine could converted simply changing laserdisc game roms sound board | [
1237
] | Test |
5,709 | 7 | List_of_game_middleware:list game middleware middleware games piece software integrated game engine handle specialized aspect physics graphics networking ai pathfinding collisions physics animation sound | [
5632,
7026,
2002,
7898,
4833,
5666
] | Test |
5,710 | 7 | GARUDA:garuda garuda global access resource using distributed architecture india grid computing initiative connecting 17 cities across country 45 participating institutes nationwide project include iits c-dac centers major institutes india garuda collaboration science researchers experimenters nationwide grid computational nodes mass storage scientific instruments aims provide technological advances required enable data compute intensive science 21st century one garuda ’ important challenges strike right balance research daunting task deploying innovation complex scientific engineering endeavors undertaken today department information technology dit government india funded centre development advanced computing c-dac deploy nationwide computational grid garuda proof concept poc phase ended march 2008 17 cities across country connected aim bring “ grid ” networked computing research labs industry april 2008 foundation phase progress aim include users ’ applications providing service oriented architecture improving network stability upgrading grid resources garuda assist accelerate india ’ drive turn substantial research investment tangible economic benefits main monitoring centre also called garuda monitoring management centre set c-dac knowledge park bangalore point whole grid extended even europe monitored managed c-dac young scientists india garuda uses national knowledge network network backbone garuda adopted pragmatic approach using existing grid infrastructure web services technologies deployment grid tools services garuda based judicious mix in-house developed components globus toolkit gt industry grade open source components foundation phase garuda based stable version gt4 resource management scheduling garuda based deployment industry grade schedulers hierarchical architecture cluster level scheduling achieved load leveler aix platforms torque linux clusters garuda portal provides user interface grid resources hides complexity grid users allows submission sequential parallel jobs also provides job accounting facilities problem solving environment pse domains bio-informatics community atmospheric model support entire cycle problem solving specific domains supporting problem formulation algorithm selection numerical simulation solution visualization | [
7930,
4159
] | Train |
5,711 | 1 | Embedded_SQL:embedded sql embedded sql method combining computing power programming language database manipulation capabilities sql embedded sql statements sql statements written inline program source code host language embedded sql statements parsed embedded sql preprocessor replaced host-language calls code library output preprocessor compiled host compiler allows programmers embed sql statements programs written number languages cobol fortran differs sql-derived programming languages n't go discrete preprocessors pl/sql t-sql sql standards committee defined embedded sql standard two steps formalism called module language defined embedded sql standard derived module language sql standard defines embedding sql embedded sql language sql queries embedded referred host language popular host language c. host language c embedded sql example called pro*c oracle sybase database management systems ecpg postgresql database management system sql may also embedded languages like php etc ibm db2 version 9 linux unix windows supports embedded sql c c++ java cobol fortran rexx although support fortran rexx deprecated mimer sql linux openvms windows support embedded sql raima database manager 14.0 supports embedded sql c/c++ sql pl sap sybase ase 15.7 supports embedded sql c cobol part software developer kit sybase sap sybase sql anywhere supports embedded sql c c++ part sql anywhere database management system sql anywhere sap sybase iq supports embedded sql c c++ part sybase iq database management system sybase iq | [
2624,
7334,
7715,
1361,
304,
6538,
4781,
4505,
5932,
5312,
5948,
4530,
2054,
5956,
519,
7213,
1240,
1989,
2803
] | Test |
5,712 | 1 | Database_Management_Library:database management library database management library dbl relational database management system rdbms contained c++ programming library dbl source code available terms gnu general public license dbl fully developed within two weeks holiday programming project aims easy simple use c++ programming dbl library becomes integral part application program unlike client–server model database management systems standalone process application program communicates application software uses dbl functionality function calls basic program creates simple database however task must done usually done dbl command-line interface int main database db mydatabase class stores database name tables main functions useful functions use class database class stores table name structure columns table main functions useful functions use class table class stores columns table data stored data file main functions useful functions use class row class stores column value column main functions useful functions use class storage class stores name structure column main functions class stores indexes table main functions useful functions use class index dbl command-line interface program one create database table add columns table besides operations printing | [
1554,
1989
] | Test |
5,713 | 7 | Cloud_(operating_system):cloud operating system cloud browser-based operating system created good os llc los angeles-based corporation company initially launched linux distribution called gos heavily based ubuntu third incarnation cloud simplified operating system ran web browser providing access variety web-based applications allowed user perform many simple tasks without booting full-scale operating system simplicity cloud could boot seconds operating system designed netbooks mobile internet devices pcs mainly used browse internet cloud user quickly boot main os cloud continues booting main os background combining browser basic operating system allows use cloud computing applications data live run internet instead hard drive cloud installed used together operating systems act standalone operating system used standalone operating system hardware requirements relatively low 2009 cloud officially available built gigabyte m912 touch screen netbook early reviews compared operating system user interface os x noted similarity browser google chrome although actually based modified mozilla firefox browser | [
2988,
7613,
632,
7432,
1634,
3091,
6262,
6806,
3627,
5571,
5927,
2212,
5135,
5232,
1757,
3028,
842,
5064,
330,
2961,
7037,
2700,
3751,
1514,
5889
] | Test |
5,714 | 5 | Digital_Signal_1:digital signal 1 digital signal 1 ds1 sometimes ds-1 t-carrier signaling scheme devised bell labs ds1 primary digital telephone standard used united states canada japan able transmit 24 multiplexed voice data calls telephone lines e-carrier used place t-carrier outside united states canada japan south korea ds1 logical bit pattern used physical t1 line practice terms ds1 t1 often used interchangeably t1 refers primary digital telephone carrier system used north america t1 one line type pcm t-carrier hierarchy t1 describes cabling signal type signal regeneration requirements carrier system signal transmitted t1 line referred ds1 signal consists serial bits transmitted rate 1.544 mbps type line code used called alternate mark inversion ami digital signal designation classification digital bit rates digital multiplex hierarchy used transport telephone signals one location another ds-1 communications protocol multiplexing bitstreams 24 telephone calls along two special bits framing bit frame synchronization maintenance-signaling bit transmitted digital circuit called t1 t1 maximum data transmission rate 1.544 megabits per second ds1 telecommunication circuit multiplexes 24 ds0s twenty-four ds0s sampled 8,000 times per second one 8bit pcm sample dso per ds1 frame consume 1.536 mbit/s bandwidth one framing bit adds 8 kbit/s overhead total 1.544 mbit/s calculated follows ds1 full-duplex circuit concurrently transmitting receiving 1.544 mbit/s frame synchronization necessary identify timeslots within 24-channel frame synchronization takes place allocating framing 193rd bit results 8 kbit/s framing data ds1 8-kbit/s channel used transmitting equipment overhead 1.536 mbit/s actually passed user two types framing schemes superframe sf extended superframe esf superframe consists twelve consecutive 193-bit frames whereas extended superframe consists twenty-four consecutive 193-bit frames data due unique bit sequences exchanged framing schemes compatible two types framing sf esf use 8 kbit/s framing channel different ways connectivity refers ability digital carrier carry customer data either end cases connectivity may lost one direction maintained cases terminal equipment i.e. equipment marks endpoints ds1 defines connection quality received framing pattern alarms normally produced receiving terminal equipment framing compromised three defined alarm indication signal states identified legacy color scheme red yellow blue red alarm indicates alarming equipment unable recover framing reliably corruption loss signal produce red alarm connectivity lost toward alarming equipment knowledge connectivity toward far end yellow alarm also known remote alarm indication rai indicates reception data framing pattern reports far end red alarm alarm carried differently sf d4 esf d5 framing sf framed signals user bandwidth manipulated bit two every ds0 channel shall zero resulting loss payload data transmitting yellow alarm undesirable resolved esf framed signals using data link layer repeating 16-bit pattern consisting eight 'ones followed eight 'zeros shall transmitted continuously esf data link may interrupted period exceed 100-ms per interruption types alarms transmitted duration alarm condition least one second blue alarm also known alarm indication signal ais indicates disruption communication path terminal equipment line repeaters dcs signal received intermediary equipment produces unframed all-ones signal receiving equipment displays red alarm sends signal yellow alarm far end framing intermediary interfaces equipment report ais alarm indication signal ais also called ones data framing pattern alarm states also lumped term carrier group alarm cga meaning cga connectivity digital carrier failed result cga condition varies depending equipment function voice equipment typically coerces robbed bits signaling state result far end properly handling condition applying often different state customer equipment connected alarmed equipment simultaneously customer data often coerced 0x7f pattern signifying zero-voltage condition voice equipment data equipment usually passes whatever data may present leaving customer equipment deal condition additionally voice t1s two main types so-called plain inband t1s pri primary rate interface carry voice telephone calls similar fashion pris commonly used call centers provide 23 actual usable telephone lines known b channels bearer also 24th line known channel data carries line signaling information special channel carries caller id cid automatic number identification ani data required channel type usually b bearer channel call handle dialed number identification service dnis info requested channel number request response inband t1s also capable carrying cid ani information configured carrier sending dtmf *ani*dnis* however pris handle efficiently inband t1 seemingly slight advantage due 24 lines available make calls opposed pri 23 channel inband t1 must perform setup tear-down call pri uses 24th channel data channel perform overhead operations 23 channels including cid ani although inband t1 24 channels 23 channel pri set calls faster due dedicated 24th signalling channel channel name t1 came carrier letter assigned technology 1957 digital systems first proposed developed decided skip q r use time division naming system ended letter designated fiber networks destined successors t1 system networks called t1c t2 t3 t4 commercial success disappeared quickly signals would carried systems called ds1 ds2 ds3 ds4 carried t1 infrastructure ds-1 means digital service – level 1 signal sent—as opposed network delivers originally 24 digitized voice channels t1 since practice naming networks ended letter terms t1 ds1 become synonymous encompass plethora different services voice data clear-channel pipes line speed always consistent 1.544 mbit/s payload vary greatly dark fiber dark fiber refers unused fibers available use dark fiber still available sale wholesale market metro wide area links may available markets city pairs dark fiber capacity typically used network operators build sonet dense wavelength division multiplexing dwdm networks usually involving meshes self-healing rings also used end-user enterprises expand ethernet local area networks especially since adoption ieee standards gigabit ethernet 10 gigabit ethernet single-mode fiber running ethernet networks geographically separated buildings practice known wan elimination ds1c digital signal equivalent two digital signal 1 extra bits conform signaling standard 3.152 mbit/s circuit capacities still use today early days digital data transmission 3-mbit/s data rate used link mainframe computers together physical side circuit called t1c t1/e1 protocol implemented line interface unit silicon semiconductor chip contains decoder/encoder loop backs jitter attenuators receivers drivers additionally usually multiple interfaces labeled dual quad octal etc. depending upon number transceiver chip primary purpose retrieve information line i.e. conductive line transverses distance receiving pulses converting signal subjected noise jitter interference clean digital pulse interface chip | [
2982,
4392,
7888,
2099,
2644,
644,
7813,
2114,
2025,
2117,
5492,
3546,
4334,
3209,
4970,
2050,
2236,
3315,
1976,
1981,
7045
] | Train |
5,715 | 3 | The_Maze_of_Galious:maze galious sequel konami msx game knightmare majou densetsu original game overhead vertical scrolling shooter maze galious side-view flick-screen platform game player controls popolon aphrodite entering evil priest galious castle free yet-to-be-born son pampas priest evil clutches able control popolon aphrodite means player switch two characters slightly different abilities example popolon push stones open heavy doors hand aphrodite survives longer water shoot projectiles either character die visit shrine pay resurrection unlike typical platform games characters survive damage hit point bars game several types enemies strengths weaknesses monsters immune frontal attacks vulnerable fire ten different bosses fought defeating boss give player key used unlock doors boss areas in-game saving provided giving player encoded password | [
5603
] | Test |
5,716 | 7 | Stacki:stacki stacki computer cluster software product company stackiq released open-source software stackiq originally named clustercorp founded 2006 first product commercial version linux distribution called rocks cluster distribution originally based san jose california co-founders included mason katz chief executive tim mcintire 2011 company re-incorporated stackiq moved la jolla district san diego california round venture capital funding april october 2014 raised 6 million located solana beach california august 2016 pervez choudhry replaced mcintire chief executive product called stackiq cluster manager renamed stackiq boss february 2015 stacki works several servers time takes long provision number servers system allows installations via preboot execution environment pxe supports “ servers boot network ” “ servers spreadsheet ” method installations servers installed isolated network stacki tool called insert-ethers run grab machine boots network add stacki commencing installation needed servers installed shared network loading spreadsheet machines install tells stacki ones install stacki uses database manage variables use installation variables defined individual server installation type globally manipulated via spreadsheets command line networking example managed variables machine configured multiple network cards multiple networks varying routes open/closed ports stacki released june 2015 stackiq company acquired teradata june 30 2017 undisclosed amount | [
2008,
2054
] | Test |
5,717 | 7 | MySQL_Cluster:mysql cluster mysql cluster technology providing shared-nothing clustering auto-sharding mysql database management system designed provide high availability high throughput low latency allowing near linear scalability mysql cluster implemented ndb ndbcluster storage engine mysql ndb stands network database mysql cluster designed around distributed multi-master acid compliant architecture single point failure mysql cluster uses automatic sharding partitioning scale read write operations commodity hardware accessed via sql non-sql nosql apis internally mysql cluster uses synchronous replication two-phase commit mechanism order guarantee data written multiple nodes upon committing data contrast usually referred mysql replication two copies known replicas data required guarantee availability mysql cluster automatically creates “ node groups ” number replicas data nodes specified user updates synchronously replicated members node group protect data loss support fast failover nodes also possible replicate asynchronously clusters sometimes referred mysql cluster replication geographical replication typically used replicate clusters data centers disaster recovery reduce effects network latency locating data physically closer set users unlike standard mysql replication mysql cluster geographic replication uses optimistic concurrency control concept epochs provide mechanism conflict detection resolution enabling active/active clustering data centers starting mysql cluster 7.2 support synchronous replication data centers supported multi-site clustering feature mysql cluster implemented fully distributed multi-master database ensuring updates made application sql node instantly available nodes accessing cluster data node accept write operations data within mysql cluster ndb tables automatically partitioned across data nodes system done based hashing algorithm based primary key table transparent end application clients connect node cluster queries automatically access correct shards needed satisfy query commit transaction mysql cluster able support cross-shard queries transactions users define partitioning schemes allows developers add “ distribution awareness ” applications partitioning based sub-key common rows accessed high running transactions ensures data used complete transactions localized shard thereby reducing network hops mysql cluster allows datasets larger capacity single machine stored accessed across multiple machines mysql cluster maintains indexed columns distributed memory non-indexed columns also maintained distributed memory maintained disk in-memory page cache storing non-indexed columns disk allows mysql cluster store datasets larger aggregate memory clustered machines mysql cluster writes redo logs disk data changes well check pointing data disk regularly allows cluster consistently recover disk full cluster outage redo logs written asynchronously respect transaction commit small number transactions lost full cluster fails however mitigated using geographic replication multi-site cluster discussed current default asynchronous write delay 2 seconds configurable normal single point failure scenarios result data loss due synchronous data replication within cluster mysql cluster table maintained memory cluster access disk storage write redo records checkpoints writes sequential limited random access patterns involved mysql cluster achieve higher write throughput rates limited disk hardware compared traditional disk-based caching rdbms checkpointing disk in-memory table data disabled per-table basis disk-based persistence n't needed mysql cluster designed single point failure provided cluster set correctly single node system piece hardware fail without entire cluster failing shared disk san required interconnects nodes standard ethernet gigabit ethernet infiniband sci interconnects mysql cluster stores tables data nodes rather mysql server multiple interfaces available access database part commercial mysql cluster cge mysql cluster manager tool designed simplify creation administration mysql cluster cge database automating common management tasks including on-line scaling upgrades backup/restore reconfiguration mysql cluster manager also monitors automatically recovers mysql server application nodes management nodes well mysql cluster data nodes mysql cluster uses three different types nodes processes generally expected node run separate physical host vm cloud instance although common co-locate management nodes mysql servers best practice recommended co-locate nodes within node group single physical host would represent single point failure mysql cluster version numbers longer tied mysql server example recent version mysql cluster 7.5 even though based on/contains server component mysql 5.7 higher versions mysql cluster include features lower versions plus new features older versions longer development currently available versions evaluation purposes possible run mysql cluster single physical server production deployments minimum system requirements 3 x instances hosts configurations follows tips recommendations deploying highly performant production grade clusters found mysql cluster evaluation guide guide optimizing performance mysql cluster database mysql ab acquired technology behind mysql cluster alzato small venture company started ericsson ndb originally designed telecom market high availability high performance requirements mysql cluster based ndb storage engine since integrated mysql product first release mysql 4.1 mysql cluster licensed gplv2 license commercial support available part mysql cluster cge also includes non-open source addons mysql cluster manager mysql enterprise monitor addition mysql enterprise security mysql enterprise audit | [
7788,
7957,
2451,
1730,
1359,
5126,
5571,
6279,
578,
5842,
4708,
6461,
2674,
4167,
3652,
3396,
6755,
4363,
5780,
6056,
3915,
1695,
4274,
4554,
2259,
7598
] | Test |
5,718 | 2 | Alcatel_One_Touch_Fire:alcatel one touch fire alcatel one touch fire one first generation smartphones preinstalled firefox os open-source mobile operating system developed mozilla phone developed marketed alcatel mobile phones lower-cost entry-level smartphone specific latin american european countries brazil chile colombia mexico peru uruguay venezuela latin america germany greece hungary italy montenegro poland serbia europe mobile network operators carried phone include congstar germany cosmote greece movistar chile mexico peru uruguay venezuela t-mobile montenegro macedonia telcel mexico telenor serbia montenegro telecom italia mobile italy vivo brazil one touch fire variation earlier android-based smartphone alcatel one touch t'pop unlike one touch fire one touch t'pop uses arm cortex-a9 cpu powervr sgx531 gpu also incorporates home back push-buttons distinct cosmetics differences one touch fire sold three color schemes mozilla orange apple green pure white two model numbers one touch fire 4012a 4012x support different cellular network standards frequency bands different countries 4012a quadband gsm radio communicate 850 900 1800 1900 mhz umts radio capable 850 1900 2100 mhz communication 4012x umts radio communicates 900 2100 mhz consequently 4012x lower specific absorption rate 4012a 4012x succeeded one touch fire c one touch fire e one touch fire s. 2019 alcatel one touch fire still little resale value worldwide due discontinuation firefox os fared well hardly considered collector item | [
5405,
7442,
5236,
4166,
1237,
1582,
6910,
740,
446
] | Test |
5,719 | 4 | Public_computer:public computer public computer public access computer various computers available public areas places public computers may available libraries schools facilities run government public computers share similar hardware software components personal computers however role function public access computer entirely different public access computer used many different untrusted individuals throughout course day computer must locked secure intentional unintentional abuse users typically n't authority install software change settings personal computer contrast typically used single responsible user customize machine behavior preferences public access computers often provided tools pc reservation system regulate access world first public access computer center marin computer center california co-founded david annie fox 1977 see also computer kiosk kiosk special type public computer using software hardware modifications provide services place kiosk example movie ticket kiosk found movie theater kiosks usually secure browser zero access desktop many kiosks may run linux however atms kiosk designed depositing money often run windows xp united states canada almost public libraries computers available use patrons though libraries keep users timed allow others get turns keep library less busy users often allowed print documents created using computers though sometimes small fee u.s. government given money many school boards purchase computers educational applications schools may multiple computer labs contain computers students use usually internet access machines schools put blocking service limit websites students able access include educational resources google addition controlling content students viewing putting blocks also help keep computers safe preventing students downloading malware threats however effectiveness content filtering systems questionable since easily circumvented using proxy websites virtual private networks weak security systems merely knowing ip address intended website enough go school computers often advanced operating system security prevent tech-savvy students inflicting damage i.e windows registry editor task manager etc disabled microsoft windows machines schools advanced tech services may also install locked bios/firmware make kernel-level changes operating system eradicating chances unauthorized activity | [
1052,
4759,
5159,
578,
3795,
880
] | Validation |
5,720 | 3 | Pac-Mania:pac-mania pac-mania would gain highly-positive critical reception uniqueness gameplay nominated best coin-op conversion year golden joystick awards 1987 although would lose taito operation wolf game would go sell 1,412 arcade cabinets north america end 1987 grossing around 2.82 million 6.22 million adjusted inflation pac-mania would ported several home consoles computers including atari st msx2 sega genesis nintendo entertainment system last published tengen several pac-man namco video game collections would also include game ports wii virtual console ios mobile phones also produced pac-mania isometric maze game player controls pac-man yellow circular creature must eat pellets stage avoiding five colored ghosts blinky pinky inky clyde sue eating large power pellets cause ghosts turn blue flee allowing pac-man eat bonus points send house middle stage clearing stage pellets allow pac-man move next new game ability jump ghosts allowing pac-man evade capture ghosts later areas game introduce two new ghosts green ghost funky steel gray ghost spunky also ability jump pac-man still jump funky impossible jump spunky eating certain number pellets cause bonus items appear middle stage pac-man eat points items increase pac-man movement speed double point values blue ghosts pac-mania arrived 8-bit systems 1988 favourable home conversion appeared commodore 64 conversions designed ported teque software otherwise known peter harrap monty mole shaun hollingworth ex-gremlin games published grandslam entertainment full screen 32-colour commodore amiga version released 1988 highly rated x68000 version acorn archimedes 16-bit atari st conversion ran 55 screen area used 16 colours pac-mania later ported nintendo entertainment system 1990 sega genesis 1991 tengen version unlicensed neither port released japan genesis port outsourced sculptured software recently port atari ste based st version modified take advantage ste features developed entertainment weekly gave game b- game runner-up category best coin-op conversion year golden joystick awards behind operation wolf arcade version pac-mania appeared namco museum volume 5 2001 namco museum release namco museum 50th anniversary namco museum virtual arcade 2001 one games included pac-man collection game boy advance later 2002 arcade version re-released included unlockable bonus pac-man world 2 2007 pac-mania also released namco museum remix pac pal pac n roll super pac-man non-pac-man games re-released 2010 part follow-up compilation namco museum megamix along 17 namco arcade games six remix games five appeared namco museum remix 2010 design pac-man ghosts pac-mania appear pac-man championship edition dx game released app app store ios devices pac-mania also re-released part pac-man arcade party arcade machine 2010 pac-man 30th anniversary february 2014 included pac-man museum playstation 3 xbox 360 windows pc via steam 2018 included pac-man pixel bash arcade cabinet along pac-man different namco games music pac-man park later used pac-man ghostly adventures power theme pac show version pac-man theme along block town music would remixed used super smash bros. nintendo 3ds wii u | [
4759,
7588,
1237,
3044,
3421,
2148
] | Test |
5,721 | 4 | Cross-zone_scripting:cross-zone scripting cross-zone scripting browser exploit taking advantage vulnerability within zone-based security solution attack allows content scripts unprivileged zones executed permissions privileged zone i.e privilege escalation within client web browser executing script vulnerability could common attack scenario involves two steps first step use cross-zone scripting vulnerability get scripts executed within privileged zone complete attack perform malicious actions computer using insecure activex components type vulnerability exploited silently install various malware spyware remote control software worms onto computers browsing malicious web page four well known zones internet explorer zones explained detail use security zones internet explorer also additional hidden zone local intranet trusted sites local computer usually configured privileged zones cross-zone scripting attacks designed jump internet zone privileged zone type exploit attempts execute code security context local computer zone following html used illustrate naive non-working attempt exploitation explanation html code attempts get attack.gif loaded cache using img src reference script src tag used attempt executing script local computer zone addressing local file cache consider scenario computer considers intranet.example.com part local intranet zone successfully cross zone scripted well-known example 2f bug internet explorer 6 discovered following url executed trusted sites permission listed trusted site | [
321,
3932,
6991,
4858
] | Test |
5,722 | 4 | Email_authentication:email authentication email authentication validation collection techniques aimed providing verifiable information origin email messages validating domain ownership message transfer agents mta participated transferring possibly modifying message original base internet email simple mail transfer protocol smtp feature forged sender addresses emails practice known email spoofing widely used phishing email spam various types fraud combat large number competing email authentication proposals developed fairly recently three widely adopted – spf dkim dmarc results validation used automated email filtering assist recipients selecting appropriate action article cover user authentication email submission retrieval early 1980s simple mail transfer protocol smtp designed provided real verification sending user system problem email systems run trusted corporations universities since commercialization internet early 1990s spam phishing crimes increasingly involve email email authentication necessary first step towards identifying origin messages thereby making policies laws enforceable hinging domain ownership stance emerged early 2000 implies coarse-grained authentication given domains appear right part email addresses sign fine-grain authentication user level achieved means pretty good privacy s/mime present digital identity needs managed individual smtp defines message transport message content thus defines mail envelope parameters envelope sender header except trace information body message std 10 define smtp envelope std 11 define message header body formally referred internet message format smtp defines trace information message saved header using following two fields mail user agent mua knows outgoing mail smtp server configuration mta relay server typically determines server connect looking mx mail exchange dns resource record recipient domain name path depicted left reconstructed ground trace header fields host adds top header receives message important realize first lines top header usually trusted recipient fact lines written machines recipient administrative management domain admd act upon explicit mandate contrast lines prove involvement b well purported author mua could counterfeit created c. codice_1 field shown epoch-making piece header codice_2 written e mail delivery agent mda based message envelope additional trace fields designed email authentication populate top header normally messages sent author admd go directly destination mx b → figures sender admd add authentication tokens message goes boxes common cases schematized follows spf allows receiver check email claimed come specific domain comes ip address authorized domain administrators usually domain administrator authorize ip addresses used outbound mtas including proxy smarthost ip address sending mta guaranteed valid transmission control protocol establishes connection checking remote host reachable receiving mail server receives codice_3 smtp command soon connection set codice_4 beginning message contain domain name spf verifier queries domain name system dns matching spf record exists specify ip addresses authorized domain administrator result pass fail intermediate result systems generally take account anti-spam filtering dkim checks message content deploying digital signatures rather using digital certificates keys signature-verification distributed via dns way message gets associated domain name dkim-compliant domain administrator generates one pairs asymmetric keys hands private keys signing mta publishes public keys dns dns labels structured codice_5 selector identifies key pair codice_6 fixed keyword followed signing domain name publication occurs authority domain admd injecting message smtp transport system signing mta creates digital signature covers selected fields header body beginning signature cover substantive header fields codice_7 codice_8 codice_9 codice_10 added message header trace field number relays receive forward message every hop signature verified retrieving public key dns long intermediate relays n't modify signed parts message dkim-signatures remain valid dmarc allows specification policy authenticated messages built top two existing mechanisms sender policy framework spf domainkeys identified mail dkim allows administrative owner domain publish policy dns records specify mechanism dkim spf employed sending email domain check codice_7 field presented end users receiver deal failures reporting mechanism actions performed policies range methods proposed either deprecated yet gained widespread support included sender id certified server validation domainkeys adsp allows specification policy messages signed author domain message go dkim authentication first adsp demand punishing treatment message signed author domain —as per codice_7 header field adsp record codice_13 published dns label codice_14 adsp designed domains heavily abused phishing similar fraud may want forgo mail facilities mailing lists non delivery reports happen remain unsigned exchange cut abuse adsp demoted historic november 2013 vbr adds vouch already authenticated identity method requires globally recognized authorities certify reputation domains sender apply reference vouching authority reference accepted published dns branch managed authority vouched sender add codice_15 header field messages sends also add dkim signature use authentication method spf receiver validating sender identity verify vouch claimed codice_15 looking reference applications avoid using method means authentication nevertheless often carried results written codice_1 header field besides tcp information required smtp specification ip reverse confirmed looking ip address name found indication ip set properly dns reverse resolution range ip addresses delegated admd uses remain managed network provider latter case useful identity related message obtained rfc 8601 defines trace header field codice_18 receiver record results email authentication checks carried multiple results multiple methods reported field separated semicolons wrapped appropriate example following field purportedly written codice_19 reports spf dkim results first token field name codice_19 id authentication server token known authserv-id receiver supporting rfc 8601 responsible remove rename false header claiming belong domain downstream filters get confused however filters still need configured know identities domain may use mail user agent mua slightly harder learn identities trust since users receive email multiple domains—e.g. multiple email addresses -— domains could let codice_18 fields pass looked neutral way malicious sender forge authserv-id user would trust message arrived different domain legitimate codice_18 typically appears codice_1 field domain message relayed additional codice_1 fields may appear top header message got transferred internally servers belonging trusted admd internet assigned numbers authority maintains registry email authentication parameters parameters need registered though example local policy values designed site internal use correspond local configuration need registration hand header field meant report results based data already present message data retrieved third parties global reputation systems compliant rfc 7601 example attempt register add dnswl results field rejected basis | [
5547,
7164,
2015,
5733,
7174,
7725,
6102,
7637,
3017,
6908,
7088,
3379,
3794,
743,
5673,
2944,
2043,
7470,
3480,
1036,
5773,
1781,
770,
3147,
4734,
1321,
3921,
4557,
1148
] | Test |
5,723 | 4 | BlackPOS_Malware:blackpos malware blackpos interprocess communication hook malware type point-of-sale malware spyware program specifically designed installed point sale pos system scrape data debit credit cards different normal memory-scraping malware scrapes data needs filters extract target data specifically hooks track information thus called interprocess communication hook malware gets installed looks pos.exe file system parses content track 1 track 2 financial card data scraped data encoded base64 algorithm stored magnetic strip back card encoded data moved second machine smb blackpos malware involved target corporation data breach 2013 blackpos program first surfaced early 2013 affected many australian american canadian companies target marcus neiman incorporated point-of-sale systems companies virus also known 'reedum 'kaptoxa originally created 23 year-old rinat shabayev later developed 17-year-old sergey taraspov better known online name 'ree4 original version blackpos sold online black market forums taraspov around 2000 became cheaper readily available source code malware leaked onto web blackpos infects computers running windows operating systems credit card readers connected part pos system pos system computers easily infected date operating systems antivirus programs prevent security breaches computer database systems weak administration login credentials blackpos standard memory-scraping malware exception virus limited pos.exe files infected pos system desired pos system infected malware pinpoints process corresponded card reader steals payment card track 1 track 2 data information stored magnetic strip payment cards system memory stolen information cloned onto blank credit cards sold black market use used personal reasons results consumer personal information compromised usable anyone access information unlike pos malware vskimmer blackpos offline data extraction method captured information uploaded remote server online makes easier hackers need proximity infected systems retrieve consumer information furthermore hackers may try hide virus detection programming blackpos send stolen information certain time frames mask traffic information creates normal work hours making seem nothing suspicious going blackpos used steal customer information businesses worldwide well-known attack occurred back 2013 mega-store chain target thanksgiving break november 2013 target pos system infected blackpos malware mid-december mega-store became aware breach security hackers able get target systems compromising company web server uploading blackpos software target pos systems result attack 40 million customer credit debit card information 70 million addresses phone numbers names personal information stolen mainframes end 1800 u.s. target stores affected malware attack target however business affected software neiman marcus another well-known retailer affected well computer database said infected early july 2013 fully contained january 2014 breach believed involve 1.1 million credit debit cards span several months although credit debit card information compromised neiman marcus issued statement saying social security numbers birthdates affected among things companies ups wendy home depot also claimed affected blackpos well although reports state breaches caused malware virus two ways detect blackpos activity pos systems based malware works first strategy detect blackpos uses fact first 15 characters stolen track data always consists digits result limited amount combinations produced means predictable pattern followed addition encoding outputs 000 999 result string always begin “ m1 ” “ mf ” “ mh ” “ ml ” “ t1 ” “ tf ” “ th ” “ tl ” “ sh ” “ sl ” second way identify blackpos network activity dropping file specific location using fixed filename format example given security intelligence checks file path name matches format written \windows\twain_32\*_*_*_*.txt strategy demonstrated following opensignature rule alert tcp 445 msg kaptoxa file write detected flow to_server established content smb|a2| content \\|00|w|00|i|00|n|00|d|00|o|00|w|00|s|00|\\|00|t|00|w|00|a|00|i|00|n|00|_|00|3|00|2|00|\\ pcre /.*_.*_.*_ *\.|00|t|00|x|00|t/ sid:1 prevention according pci security council businesses keep malware prevention software updated frequently lower chance infection addition system logs regularly checked irregular activity within servers well monitoring large data files sent unknown sources companies also require login credentials updated regularly provide instructions create safer secure passwords | [
7194,
4256,
4759,
4440
] | Validation |
5,724 | 2 | Kurumin:kurumin kurumin linux live cd operating system based debian main features advanced hardware auto-detection inherited knoppix portuguese user interface main goal ease use release 7.0 size disk image approximately 603 mb version ng 8.06 based ubuntu 8.04 released june 24 2008 discontinued january 29 2009 name comes tupi word kurumi means boy usage letter k instead usual portuguese spelling curumi curumim brings line kde kurumin default desktop environment well knoppix late 2007 morimoto said project would halted scope reduced november 2008 project officially discontinued distribution sports open-source control center named clicaaki roughly clickhere features series shell scripts kommander-based panels magic icons install software included live cd icons one configure wide range networking options control center also provides access synaptic package manager clicaaki control panel shortcuts scripts also perform tasks like downloading installing free games apps divided categories short description work differences control panel also includes scripts downloading automatically configuring drivers 3d video cards ati nvidia difficult task novice users another feature distro support many winmodems including official packages drivers debian repository also scripts automate tasks compiling configuring necessary modules features kurumin spread gnu/linux operating system brazil level never seen | [
5200,
1629,
3444,
7251,
474,
7075,
5571,
1941,
314,
5232,
2758,
2581,
1663,
2864,
3559,
6209,
6761,
2063,
343,
4824,
5523,
7587,
5259,
1893,
5530,
5704,
6317,
3751,
7954,
6244,
788
] | Test |
5,725 | 4 | Graph-based_access_control:graph-based access control graph-based access control gbac declarative way define access rights task assignments recipients content information systems access rights granted objects like files documents also business objects like account also used assignment agents tasks workflow environments organizations modeled specific kind semantic graph comprising organizational units roles functions well human automatic agents i.a persons machines compared approaches like role-based access control attribute-based access control main difference gbac access rights defined using organizational query language instead total enumeration foundations gbac go back research project named cocosorg configurable cooperation system english language please see bamberg university cocosorg organization represented semantic graph formal language used specify agents access rights workflow environment within c-org-project hof university institute information systems iisys approach extended features like separation duty access control virtual organizations subject-oriented access control graph-based access control consists two building blocks organizational graph divided type instance level instance level node types organizational units functional units agents basic structure organization defined using called structural relations define part relations functional units organizational units well mapping agents functional units additionally specific relationship types like deputyship informed_by types extended modeler relationships context sensitive usage predicates type level organizational structures described general manner consists organizational unit types functional unit types relationship types instance level type definitions used create new instances reuse organizational knowledge case exceptions reading see gbac query language used define agents certain characteristics abilities following table shows usage query language context access control matrix first query means managers working company six months read financial report well managers classified flag readfinancialreport daily financial report written manager controlling department clerks department enabled writefinancialreport==true gbac first implemented cocos environment within organizational server cocosorg c-org-project extended sophisticated features like separation duty access control distributed environments also cloud-based implementation ibm bluemix platform implementations server takes query client system resolves set agents set sent back calling client response clients file systems database management systems workflow management systems physical security systems even telephone servers | [
1249,
3884,
6162,
6944,
3461,
5074
] | Train |
5,726 | 2 | SMP/E:smp/e smp/e system modification program/extended tool designed manage installation software products z/os system track modifications products smp/e manages multiple software versions helps apply patches updates ptfs facilitates orderly testing necessary reversion previous state allows trial run pseudo-installation verify actual installation work keeps audit security records assure approved software updates occur otherwise provides highly evolved centralized control software installation z/os although possible design ship software products install z/os without smp/e mainframe administrators prefer smp/e-enabled products least non-trivial packages using smp/e typically requires working knowledge job control language jcl although products supply sample jcl rigorous software management discipline associated smp/e typically extends product documentation well ibm vendors supplying standardized program directory manual software product precisely aligns smp/e work processes program directory provides detailed information pre-requisites co-requisites example use smp/e manage system updates helps ensure system integrity making sure system consistent state changes state properly audited previously called smp system modification program smp/e evolved osmp os maintenance program os/360 smp version 4 major revision new syntax smp/e introduced mvs introduced use vsam datasets concept extended ibm operating systems dos/vs maintain system history program mshp vm/sp ses virtual machine serviceability enhancements staged vmses/e ibm non-ibm software assigned least one seven character fmid function module id identifies piece software release number first fmid called base fmid example db2 version 9 base fmid hdb9910 separately installable features also fmids called dependent fmids relate way base product db2 english language panels version 9 dependent fmid jdb9910 software package composed elements individual components object files mod macros mac sample programs samp etc csi consolidated software inventory dataset containing information smp/e needs track contents distribution target libraries csi contains metadata identifying installed fmids elements id recent update pointers associated libraries sysmod system modification modification system includes sysmod assigned seven character sysmod id uniquely identify sysmod installed id recorded csi entry element added replaced called rmid replacement module id simple declarative language called mcs modification control statements provides information smp/e identifying sysmod providing information install sysmod prefixed number mcs statements example identify apar fix ptf supply sysmod id identify applicable fmid etc prerequisites prereqs sysmods required installed second installed corequisites coreqs two sysmods must installed together none installed without others sysmod supersedes sups another functionally replaces first prereq coreq sup information provided mcs requisite chain sequence sysmods directly indirectly identified requisites given sysmod example prereq b b prereq c b requisite chain c need installed c although necessarily separate run smp/e requisite chains frequently become extremely involved comprise hundreds sysmods holddata set mcs statements indicate specific sysmods contain errors require manual processing outside scope smp/e installed user required take action fix problem possible installing held sysmods smp/e manages two types libraries target libraries tlibs contain executable code information used run system originally limited number target libraries sys1.linklib executable programs sys1.maclib standard macros etc. 2012 software product usually set target libraries distribution libraries dlibs contain master copy element system product fmid set distribution libraries normally used smp/e libraries os/360 successors unlike directories unix usually contain one type format data software package may object libraries mod ispf panels pnl macro libraries mac many smp/e single large program runs batch job series ispf panels used interactively build smp/e job stream based user input one common sequence steps called receive-apply-accept commands used step smp/e receive command processes sysmods source outside smp previously might put tape distributed ibm roughly monthly recently might collection sysmods downloaded internet receive process uses mcs create entry csi sysmod marking status received stores mcs information actual sysmod data reject command used delete sysmods received status apply command installs one received sysmods appropriate target libraries sysmods applied selected various criteria example single sysmod selected sysmod id sysmods received group selected sourceid un-applied sysmods received applied requisite chains specified sysmods checked sysmods without proper requisites hold status superseded flagged errors installed commonly smp/e instructed also automatically apply requisites receive status minimize errors sysmods installed status changed applied csi apply check used check sysmods installed without actually performing installation restore command used remove applied sysmod accepted accept command installs sysmods permanently distribution libraries marks status accepted csi normally accept done sysmods known performing correctly next apply service way smp/e undo accept operation except delete installation libraries including csis start installation smp/e large complex program features datasets added every release major smp/e datasets | [
4675,
6428,
5386,
5041,
7555,
2594,
781,
5092,
4759,
7619,
7251,
3366,
4778,
4421,
4059,
839,
3036,
850,
1582,
4441,
523,
163,
1598,
6957,
8055,
5200,
5545,
6609,
1260,
5912,
578,
2034,
2403,
2771,
6663,
1684,
952,
607,
6312,
5965,
7042... | Test |
5,727 | 4 | Your_PC_Protector:pc protector pc protector rogue antivirus program part windows police pro windows antivirus pro family program tries block type microsoft program anti-virus anti-malware suite program says protect computer program protect use firewall data like malware pc protector tries steal privacy asking credit card data use money much says spend anti-malware like malwarebytes antimalware might able remove virus pc protector uses windows filenames hide program name way track extra svchost.exe running user profile task manager processes may find svchost.exe common files may open pc protector would hijack windows registry modify web browser loading feature hijack registry make web page load saying unsafe web page show virus alert alert claims must purchase pc protector program also install browser helper object would hijack search results feature modifies windows host file dns hijacker dns hijacking pc protector secure purchase pc protector many different actions pc protector many different blocked executable .exe files pc protector blocks computer user using | [
6463
] | Validation |
5,728 | 1 | Apache_Phoenix:apache phoenix apache phoenix open source massively parallel relational database engine supporting oltp hadoop using apache hbase backing store phoenix provides jdbc driver hides intricacies nosql store enabling users create delete alter sql tables views indexes sequences insert delete rows singly bulk query data sql phoenix compiles queries statements native nosql store apis rather using mapreduce enabling building low latency applications top nosql stores phoenix began internal project company salesforce.com need support higher level well understood sql language originally open-sourced github 28 jan 2014 became top-level apache project 22 may 2014 apache phoenix included hortonworks distribution hdp 2.1 available part cloudera labs part hadoop ecosystem | [
6506,
7238,
894,
4303,
7805,
2741,
7444,
7896,
917,
5571,
3463,
3542,
3204,
1286,
6821,
5054,
840,
1392,
3031,
5408,
3558,
5677,
6462,
7924,
3479,
7848,
5863,
6387,
5075,
6137,
7488,
7857,
5874,
3915,
1695,
7037,
1511,
4742,
5007,
1333,
... | Test |
5,729 | 0 | Verbmobil:verbmobil verbmobil long-term interdisciplinary language technology esp machine translation research project aim develop system recognize translate produce natural utterances thus translate spontaneous speech robustly bidirectionally german/english german/japanese verbmobil research carried 1993 2000 funded germany federal ministry research technology bundesministerium für forschung und technologie total 116m deutschmarks roughly 60m euros industry partners daimlerchrysler siemens philips contributed additional 52 million dm 26m euros verbmobil ii project tübingen university created semi-automatically annotated treebanks german japanese english spontaneous speech tüba-d/s contains ca 38,000 sentences 360,000 words tüba-e/s contains ca 30,000 sentences 310,000 words tüba-j/s contains ca 18,000 sentences 160,000 words | [
7410
] | Test |
5,730 | 9 | Active_Oberon:active oberon active oberon general purpose programming language developed 1996-1998 group around niklaus wirth jürg gutknecht swiss federal institute technology eth zürich extension programming language oberon extensions aim implementing active objects expressions parallelism compared predecessors oberon oberon-2 active oberon adds objects object-centered access protection local activity control system-guarded assertions preemptive priority scheduling changed syntax methods aka type-bound procedures oberon terminology objects may active means may threads processes operating system a2 aka bluebottle especially kernel synchronizes coordinates different active objects unlike java c objects may synchronized signals directly conditions simplifies development concurrent programs fork active oberon zonnon | [
4885,
7761,
5639,
6340,
4589,
5424
] | Test |
5,731 | 9 | Name_resolution_(programming_languages):name resolution programming languages programming languages name resolution resolution tokens within program expressions intended program components expressions computer programs reference variables data types functions classes objects libraries packages entities name context name resolution refers association not-necessarily-unique names intended program entities algorithms determine identifiers refer specific contexts part language definition complexity algorithms influenced sophistication language example name resolution assembly language usually involves single simple table lookup name resolution c++ extremely complicated involves programming languages name resolution performed either compile time runtime former called static name resolution latter called dynamic name resolution somewhat common misconception dynamic typing implies dynamic name resolution however static typing imply static name resolution example erlang dynamically typed static name resolution static name resolution catches compile time use variables scope preventing programmer errors languages dynamic scope resolution sacrifice safety flexibility typically set get variables scope runtime example python interactive repl however relying dynamic name resolution code discouraged python community feature also may removed later version python examples languages use static name resolution include c c++ e erlang haskell java pascal scheme smalltalk examples languages use dynamic name resolution include lisp dialects perl php python rebol tcl masking occurs identifier used different entities overlapping lexical scopes level variables rather names known variable shadowing identifier variable x masks identifier variable x two conditions met outer variable x said shadowed inner variable x example parameter foo shadows local variable foo common pattern name masking cause complications function overloading due overloading happening across scopes languages notably c++ thus requiring overloaded functions redeclared explicitly imported given namespace programming languages lexical scoping reflect variable names α-conversion α-renaming used make name resolution easy finding substitution makes sure variable name masks another name containing scope alpha-renaming make static code analysis easier since alpha renamer needs understand language scoping rules example code within point constructor class variables x shadowed local variables name might alpha-renamed new version masking immediately obvious uses correspond declarations | [
180,
274,
5983,
7333,
6882,
6980,
6982,
382,
2740,
5480,
486,
6029,
5948,
336,
2514,
7032,
4543,
5608,
5965,
6585,
1435
] | Test |
5,732 | 3 | Macintosh_Quadra_840AV:macintosh quadra 840av macintosh quadra 840av personal computer designed manufactured sold apple computer inc. july 1993 july 1994 introduced alongside centris 660av av model numbers signifying video input output capabilities well enhanced audio 840av mini tower form factor quadra 800 faster motorola 68040 processor quadra 840av discontinued shortly introduction powerpc-based power macintosh power macintosh 8100/80av provided functionality form factor albeit significantly higher price point 7100/66av priced comparably 840av iivx-style desktop case time introduction 40 mhz motorola 68040 cpu interleaved ram made fastest macintosh available topping nominally higher-end quadra 950 quadra 800 7 mhz remains fastest quadra fastest 68k macintosh time since later high-end macintoshes powerpc-based power macintoshes 840av also mac use 40 mhz-clocked 68040 also sports faster 66.7 mhz dsp 3210 digital signal processor chip compared 55 mhz variant 660av on-board dsp primarily intended speed audio/video processing although mac programs made use due complexity programming 840av relative centris/quadra 660av marked number firsts macintosh family first macintoshes include on-board 16-bit 48 khz stereo audio playback recording capability well s-video composite video input output improve video playback two separate frame buffers used one standard graphics one specifically video enabled live video input displayed scalable window within macintosh user interface also first personal computers supported speech recognition plaintalk out-of-the-box apple geoport telecom adapter kit introduced av macs added many dsp-based telecommunication functions modem fax telephony quadra 840av came similar case earlier macintosh quadra 800 housing chassis power supply internal storage assemblies front rear panels changed power button moved back internally 840av significantly different apart faster processor logic board lacks 800 processor direct slot second adb port dav slot line nubus slot new geoport also unlike 800 8 mib fixed ram 840av memory simms reason minimum amount memory lower way 840av deals memory dram different machines generation quadra 700 800 950 4 8 16 32 mb 72-pin 60ns simms may installed 128 mb sizes mixed however quadra 840av support 1 mb 2 mb 64 mb simms 840av 660av first macintosh computers operate 32-bit mode times toggled back 24-bit mode may useful using early nubus cards conform 24-bit addressing new av machines first ship standard internal cd-rom drive earlier quadra centris models available built-in cd-rom drive optional extras operating system installation package came cd-rom rather series floppy disks whenever cd-rom drive included hidden quicktime video included original quadra 840av/centris 660av install first cd-rom shows jubilant cyclone tempest design team midst celebrating accomplishment video cyclone 840av prototype logic board shown logic board fitted 25 mhz 68040 number rework wires conspicuously daughter card nicknamed karma audio video input/output ports located notably audio video ports card front-facing positioned though would protrude opening lower front case easily accessible user according member team av card feature omitted enough room case coinciding introduction av macs apple introduced apple audiovision 14 display featuring easily accessible audio input audio output video input ports could fed adc adapter cable connected rear av ports av macs later power macintosh 6100 7100 8100 returned av card concept later abandoned 7500/8500 series machines re-introduced wings av personality card power macintosh g3 gossamer artemis machines stored inside spare rom space two jpeg images quadra 840av development team early quadra 840av logic boards featured 2 mb rom simm slot located ram simm slots originally planned 840av rom would contain bootable image system 7 within larger 4 mb rom space code-named supermario apple dropped idea 840av shipped later revisions 840av logic board included 2 mb rom soldered onto logic board | [
7890,
722,
1094,
2926,
5037,
5752,
2954,
7572,
6482,
6142,
4373,
7226,
2978,
7601,
4749,
3346,
5100,
6165,
4389,
5463,
102,
5469,
4768,
3008,
5477,
2294,
4410,
6200,
6202,
3387,
3390,
1216,
2331,
4820,
4453,
1234,
1237,
7311,
889,
550,
... | Train |
5,733 | 4 | DNSBL:dnsbl domain name system-based blackhole list dnsbl real-time blackhole list rbl effort stop email spamming blacklist locations internet reputed send email spam locations consist ip addresses often used publish addresses computers networks linked spamming mail server software configured reject flag messages sent site listed one lists term blackhole list sometimes interchanged term blacklist blocklist dnsbl software mechanism rather specific list policy dozens dnsbls existence use wide array criteria listing delisting addresses may include listing addresses zombie computers machines used send spam internet service providers isps willingly host spammers sent spam honeypot system since creation first dnsbl 1998 operation policies lists frequently controversial internet advocacy occasionally lawsuits many email systems operators users consider dnsbls valuable tool share information sources spam others including prominent internet activists objected form censorship addition small number dnsbl operators target lawsuits filed spammers seeking lists shut first dnsbl real-time blackhole list rbl created 1997 first border gateway protocol bgp feed paul vixie dnsbl eric ziegast part vixie mail abuse prevention system maps dave rand abovenet first subscriber first version rbl published dnsbl rather list networks transmitted via bgp routers owned subscribers network operators could drop tcp/ip traffic machines used send spam host spam supporting services website inventor technique later commonly called dnsbl eric ziegast employed vixie enterprises term blackhole refers networking black hole expression link network drops incoming traffic instead forwarding normally intent rbl sites using would refuse traffic sites supported spam — whether actively sending spam ways address would listed rbl volunteers maps staff would attempt repeatedly contact persons responsible get problems corrected effort considered important blackholing network traffic also meant spammers spam supporting isps could delay put rbl long periods discussions went later rbl also released dnsbl form paul vixie encouraged authors sendmail mail software implement rbl support clients allowed mail software query rbl reject mail listed sites per-mail-server basis instead blackholing traffic soon advent rbl others started developing lists different policies one first alan brown open relay behavior-modification system orbs used automated testing discover list mail servers running open mail relays—exploitable spammers carry spam orbs controversial time many people felt running open relay acceptable scanning internet open mail servers could abusive 2003 number dnsbls came denial-of-service attacks dos since party admitted attacks discovered responsible purpose matter speculation however many observers believe attacks perpetrated spammers order interfere dnsbls operation hound shutting august 2003 firm osirusoft operator several dnsbls including one based spews data set shut lists suffering weeks near-continuous attack technical specifications dnsbls came relatively late rfc5782 uniform resource identifier uri dnsbl dnsbl lists domain names sometimes also ip addresses found clickable links contained body spams generally found inside legitimate messages uri dnsbls created determined much spam made past spam filters short time frame first use spam-sending ip address point sending ip address first listed major sending-ip-based dnsbls many cases elusive spams contain links domain names ip addresses collectively referred uris uri already spotted previously caught spam uri found non-spam e-mail therefore spam filter extracts uris message checks uri dnsbl spam blocked even sending ip spam yet listed sending ip dnsbl three major uri dnsbls oldest popular surbl surbl created volunteers surbl started second major uri dnsbl uribl 2008 another long-time surbl volunteer started another uri dnsbl ivmuri spamhaus project provides spamhaus domain block list dbl describe domains found spam messages dbl intended uribl rhsbl checked domains message envelope headers domains urls message bodies unlike uribls dbl lists domain names ip addresses since spamhaus provides lists ip addresses uri dnsbls often confused rhsbls right hand side bls different uri dnsbl lists domain names ips found body message rhsbl lists domain names used reply-to e-mail address rhsbls debatable effectiveness since many spams either use forged addresses use addresses containing popular freemail domain names gmail.com yahoo.com hotmail.com uri dnsbls widely used rhsbls effective used majority spam filters operate dnsbl requires three things domain host nameserver domain list addresses publish possible serve dnsbl using general-purpose dns server software however typically inefficient zones containing large numbers addresses particularly dnsbls list entire classless inter-domain routing netblocks large resource consumption using software designed role domain name server role-specific software applications designed specifically servers role dns blacklist hard part operating dnsbl populating addresses dnsbls intended public use usually specific published policies listing means must operated accordingly attain sustain public confidence mail server receives connection client wishes check client dnsbl let say dnsbl.example.net less following looking address dnsbl thus similar looking reverse-dns differences dnsbl lookup uses rather ptr record type uses forward domain dnsbl.example.net rather special reverse domain in-addr.arpa informal protocol addresses returned dnsbl queries match dnsbls return address 127.0.0.0/8 ip loopback network address 127.0.0.2 indicates generic listing addresses block may indicate something specific listing—that indicates open relay proxy spammer-owned host etc details see rfc 5782 uri dnsbl query rhsbl query fairly straightforward domain name query prepended dns list host follows dnslist.example.com dns list host example.net queried domain generally record returned name listed different dnsbls different policies dnsbl policies differ one another three fronts addition different types listed entities ip addresses traditional dnsbls host domain names rhsbls uris uribls wide range semantic variations lists listing means list maintainers divided issues whether listings seen statements objective fact subjective opinion lists best used result definitive taxonomy dnsbls names defined e.g yellow nobl varieties widespread use names widespread use recognized many spam control specialists end-users organizations concerns regarding concept dnsbls specifics created used criticisms include despite criticisms people object principle mail-receiving sites able reject undesired mail systematically one person john gilmore deliberately operates open mail relay gilmore accuses dnsbl operators violating antitrust law number parties electronic frontier foundation peacefire raised concerns use dnsbls isps one joint statement issued group including eff peacefire addressed stealth blocking isps use dnsbls spam-blocking techniques without informing clients spammers pursued lawsuits dnsbl operators similar grounds | [
5722,
5547,
5811,
7164,
3857,
7174,
1462,
6102,
3017,
5836,
6908,
581,
2578,
1018,
7276,
3031,
7470,
2134,
4072,
5416,
1036,
1781,
1691,
4734,
1321,
3338,
5619,
1148,
3073
] | Test |
5,734 | 9 | LFE_(programming_language):lfe programming language lisp flavored erlang lfe functional concurrent garbage collected general-purpose programming language lisp dialect built core erlang erlang virtual machine beam lfe builds erlang provide lisp syntax writing distributed fault-tolerant soft real-time non-stop applications lfe also extends erlang support metaprogramming lisp macros improved developer experience feature-rich read–eval–print loop repl lfe actively supported recent releases erlang oldest version erlang supported r14 initial work lfe began 2007 robert virding started creating prototype lisp running erlang work focused primarily parsing exploring implementation might look like version control system used time tracking exact initial dates somewhat problematic virding announced first release lfe erlang questions mail list march 2008 release lfe limited handle recursive codice_1s codice_2s codice_3 codice_4 also support lisp shell initial development lfe done version r12b-0 erlang dell xps laptop robert virding stated several reasons started lfe programming language like lisp lfe expression-oriented language unlike non-homoiconic programming languages lisps make little syntactic distinction expressions statements code data written expressions lfe brought homoiconicity erlang vm lfe list data type written elements separated whitespace surrounded parentheses example list whose elements integers atom values implicitly typed respectively two integers lisp-specific data type called symbolic atom need declared seen example lfe expressions written lists using prefix notation first element list name form i.e. function operator macro remainder list arguments lfe-erlang operators used way expression evaluates 42 unlike functions erlang lfe arithmetic operators lisp variadic n-ary able take number arguments lfe lambda like common lisp also however lambda-match account erlang pattern-matching abilities anonymous function calls section represent complete comparison erlang lfe give taste erlang lfe erlang lfe idiomatic functional style erlang lfe erlang lfe using cons literal instead constructor form erlang lfe erlang lfe calls erlang functions take form module function arg1 ... argn using recursion define ackermann function defun ackermann composing functions message-passing erlang light-weight processes defmodule messenger-back multiple simultaneous http requests | [
7878,
1445,
5019,
1820,
6796,
6087,
2915,
1478,
2218,
4704,
5757,
6116,
1116,
6471,
7573,
2600,
5077,
1885,
1889,
6507,
795,
6876,
6888,
1557,
4789,
5494,
5501,
6210,
144,
4074,
3396,
4085,
7298,
5515,
8025,
5878,
3749,
6949,
5883,
6955,
... | Test |
5,735 | 3 | NonStop_(server_computers):nonstop server computers nonstop series server computers introduced market 1976 tandem computers inc. beginning nonstop product line followed hewlett-packard integrity nonstop product line extension nonstop systems based integrated hardware/software stack hp also developed nonstop os operating system nonstop systems extent self-healing circumvent single points failure equipped almost redundant components mainline component fails system automatically falls back backup systems often used banks stock exchanges telecommunication providers enterprises requiring extremely high uptime originally introduced 1976 tandem computers inc. line later owned compaq 1997 hewlett-packard since 2003 2005 current product line hp integrity nonstop tns/e servers based intel itanium microprocessors introduced 2014 first systems nonstop x tns/x running intel x86 chip introduced early nonstop applications specifically coded fault-tolerance requirement removed 1983 introduction transaction monitoring facility tmf handles various aspects fault tolerance system level nonstop os message-based operating system designed fault tolerance works process pairs ensures backup processes redundant cpus take case process cpu failure data integrity maintained takeovers transactions data lost corrupted operating system whole branded nonstop os includes guardian layer low-level component operating system so-called oss personality runs atop layer implements unix-like interface components os use operating system application designed support fault tolerant hardware operating system continually monitors status components switching control necessary maintain operations also features designed software allow programs written continuously available programs accomplished using pair processes one process performs primary processing serves hot backup receiving updates data whenever primary reaches critical point processing primary stop backup steps resume execution using current transaction systems support relational database management systems like nonstop sql hierarchical databases enscribe hp integrity nonstop computers line fault-tolerant server computers based intel itanium processor platform optimized transaction processing average availability levels 99.999 observed nonstop systems feature massively parallel processing mpp architecture provide linear scalability cpu systems expanded 4000 cpus runs copy os shared-nothing architecture — share nothing arrangement also known loosely coupled multiprocessing diminishing returns occur processors added see amdahl law due integrated hardware/software stack single system image even largest configurations system management requirements nonstop systems rather low deployments single production server complex server farm customers also backup server remote location disaster recovery standard products keep data production backup server sync hence fast takeover data loss also disaster situation production server disabled destroyed hp also developed data warehouse business intelligence server line hp neoview based nonstop line acted database server providing nonstop os nonstop sql lacked transaction processing functionality original nonstop systems line retired longer marketed january 24 2011 | [
7788,
1522,
3764,
4387,
2278,
553,
3849,
7341,
900,
3951,
3531,
5571,
7827,
1197,
3882,
1112,
6461,
5060,
6748,
1581,
3396,
5772,
7759,
1134,
4365,
4370,
4736,
4195,
4018
] | Validation |
5,736 | 1 | Identity_column:identity column identity column column also known field database table made values generated database much like autonumber field microsoft access sequence oracle concept important database science many rdbms systems implement type generated key although terminology identity column differs primary key values managed server usually modified many cases identity column used primary key however always case common misconception identity column enforce uniqueness however case want enforce uniqueness column must include appropriate constraint microsoft sql server options seed starting value increment default seed increment 1. often useful necessary know identity value generated insert command microsoft sql server provides several functions identity provides last value generated current connection current scope ident_current tablename provides last value generated regardless connection scope created example | [
5252,
1861,
2054,
7715
] | Test |
5,737 | 3 | Branch_predictor:branch predictor computer architecture branch predictor digital circuit tries guess way branch e.g if–then–else structure go known definitively purpose branch predictor improve flow instruction pipeline branch predictors play critical role achieving high effective performance many modern pipelined microprocessor architectures x86 two-way branching usually implemented conditional jump instruction conditional jump either taken continue execution first branch code follows immediately conditional jump taken jump different place program memory second branch code stored known certain whether conditional jump taken taken condition calculated conditional jump passed execution stage instruction pipeline see fig 1 without branch prediction processor would wait conditional jump instruction passed execute stage next instruction enter fetch stage pipeline branch predictor attempts avoid waste time trying guess whether conditional jump likely taken taken branch guessed likely fetched speculatively executed later detected guess wrong speculatively executed partially executed instructions discarded pipeline starts correct branch incurring delay time wasted case branch misprediction equal number stages pipeline fetch stage execute stage modern microprocessors tend quite long pipelines misprediction delay 10 20 clock cycles result making pipeline longer increases need advanced branch predictor first time conditional jump instruction encountered much information base prediction branch predictor keeps records whether branches taken taken encounters conditional jump seen several times base prediction history branch predictor may example recognize conditional jump taken often taken every second time branch prediction branch target prediction branch prediction attempts guess whether conditional jump taken branch target prediction attempts guess target taken conditional unconditional jump computed decoding executing instruction branch prediction branch target prediction often combined circuitry static prediction simplest branch prediction technique rely information dynamic history code executing instead predicts outcome branch based solely branch instruction early implementations sparc mips two first commercial risc architectures used single-direction static branch prediction always predict conditional jump taken always fetch next sequential instruction branch jump evaluated found taken instruction pointer get set non-sequential address cpus evaluate branches decode stage single cycle instruction fetch result branch target recurrence two cycles long machine always fetches instruction immediately taken branch architectures define branch delay slots order utilize fetched instructions advanced form static prediction presumes backward branches taken forward branches backward branch one target address lower address technique help prediction accuracy loops usually backward-pointing branches taken often taken processors allow branch prediction hints inserted code tell whether static prediction taken taken intel pentium 4 accepts branch prediction hints feature abandoned later intel processors static prediction used fall-back technique processors dynamic branch prediction dynamic predictors sufficient information use motorola mpc7450 g4e intel pentium 4 use technique fall-back static prediction decisions made compile time execution program dynamic branch prediction uses information taken taken branches gathered run-time predict outcome branch using random pseudorandom bit pure guess would guarantee every branch 50 correct prediction rate improved worsened reordering instructions simplest static prediction assume take compilers reorder instructions get better 50 correct prediction also would make timing much nondeterministic superscalar processors mips r8000 alpha 21264 alpha 21464 ev8 fetch line instructions pointer next line next-line predictor handles branch target prediction well branch direction prediction next-line predictor points aligned groups 2 4 8 instructions branch target usually first instruction fetched initial instructions fetched wasted assuming simplicity uniform distribution branch targets 0.5 1.5 3.5 instructions fetched discarded respectively since branch generally last instruction aligned group instructions taken branch delay slot discarded assuming uniform distribution branch instruction placements 0.5 1.5 3.5 instructions fetched discarded discarded instructions branch destination lines add nearly complete fetch cycle even single-cycle next-line predictor 1-bit saturating counter essentially flip-flop records last outcome branch simple version dynamic branch predictor possible although accurate 2-bit saturating counter state machine four states branch evaluated corresponding state machine updated branches evaluated taken change state toward strongly taken branches evaluated taken change state toward strongly taken advantage two-bit counter scheme one-bit scheme conditional jump deviate twice done past prediction changes example loop-closing conditional jump mispredicted rather twice original non-mmx intel pentium processor uses saturating counter though imperfect implementation spec'89 benchmarks large bimodal predictors saturate 93.5 correct every branch maps unique counter predictor table indexed instruction address bits processor fetch prediction every instruction instruction decoded two-level branch predictor also referred correlation-based branch predictor uses two-dimensional table counters also called pattern history table table entries two-bit counters codice_1 statement executed three times decision made third execution might depend upon whether previous two taken scenarios two-level adaptive predictor works efficiently saturation counter conditional jumps taken every second time regularly recurring pattern predicted well saturating counter two-level adaptive predictor remembers history last n occurrences branch uses one saturating counter possible 2 history patterns method illustrated figure 3 consider example n 2 means last two occurrences branch stored two-bit shift register branch history register four different binary values 00 01 10 11 zero means taken one means taken pattern history table contains four entries per branch one 2 4 possible branch histories entry table contains two-bit saturating counter type figure 2 branch branch history register used choosing four saturating counters use history 00 first counter used history 11 last four counters used assume example conditional jump taken every third time branch sequence 001001001 ... case entry number 00 pattern history table go state strongly taken indicating two zeroes comes one entry number 01 go state strongly taken indicating 01 comes zero case entry number 10 entry number 11 never used never two consecutive ones general rule two-level adaptive predictor n-bit history predict repetitive sequence period n-bit sub-sequences different advantage two-level adaptive predictor quickly learn predict arbitrary repetitive pattern method invented t.-y yeh yale patt university michigan since initial publication 1991 method become popular variants prediction method used modern microprocessors local branch predictor separate history buffer conditional jump instruction may use two-level adaptive predictor history buffer separate conditional jump instruction pattern history table may separate well may shared conditional jumps intel pentium mmx pentium ii pentium iii local branch predictors local 4-bit history local pattern history table 16 entries conditional jump spec'89 benchmarks large local predictors saturate 97.1 correct global branch predictor keep separate history record conditional jump instead keeps shared history conditional jumps advantage shared history correlation different conditional jumps part making predictions disadvantage history diluted irrelevant information different conditional jumps uncorrelated history buffer may include bits branch many branches may use two-level adaptive predictor scheme better saturating counter scheme large table sizes rarely good local prediction history buffer must longer order make good prediction size pattern history table grows exponentially size history buffer hence big pattern history table must shared among conditional jumps two-level adaptive predictor globally shared history buffer pattern history table called gshare predictor xors global history branch pc gselect concatenates global branch prediction used amd processors intel pentium core core 2 silvermont-based atom processors alloyed branch predictor combines local global prediction principles concatenating local global branch histories possibly bits program counter well tests indicate via nano processor may using technique agree predictor two-level adaptive predictor globally shared history buffer pattern history table additional local saturating counter outputs local global predictors xored give final prediction purpose reduce contentions pattern history table two branches opposite prediction happen share entry pattern history table agree predictor used first version intel pentium 4 later abandoned hybrid predictor also called combined predictor implements one prediction mechanism final prediction based either meta-predictor remembers predictors made best predictions past majority vote function based odd number different predictors scott mcfarling proposed combined branch prediction 1993 paper spec'89 benchmarks predictor good local predictor predictors like gshare use multiple table entries track behavior particular branch multiplication entries makes much likely two branches map table entry situation called aliasing turn makes much likely prediction accuracy suffer branches multiple predictors beneficial arrange predictor different aliasing patterns likely least one predictor aliasing combined predictors different indexing functions different predictors called gskew predictors analogous skewed associative caches used data instruction caching conditional jump controls loop best predicted special loop predictor conditional jump bottom loop repeats n times taken n-1 times taken conditional jump placed top loop taken n-1 times taken conditional jump goes many times one way way detected loop behavior conditional jump predicted easily simple counter loop predictor part hybrid predictor meta-predictor detects whether conditional jump loop behavior indirect jump instruction choose among two branches processors specialized indirect branch predictors newer processors intel amd predict indirect branches using two-level adaptive predictor kind instruction contributes one bit history buffer zec12 later z/architecture processors ibm support instruction preload branch predictor entry given instruction branch target address constructed adding contents general-purpose register immediate displacement value processors without mechanism simply predict indirect jump go target last time function normally return called return instruction indirect jump reads target address call stack many microprocessors separate prediction mechanism return instructions mechanism based so-called return stack buffer local mirror call stack size return stack buffer typically 4 16 entries trade-off fast branch prediction good branch prediction sometimes dealt two branch predictors first branch predictor fast simple second branch predictor slower complicated bigger tables override possibly wrong prediction made first predictor alpha 21264 alpha ev8 microprocessors used fast single-cycle next-line predictor handle branch target recurrence provide simple fast branch prediction next-line predictor inaccurate branch resolution recurrence takes long cores two-cycle secondary branch predictors override prediction next-line predictor cost single lost fetch cycle intel core i7 two branch target buffers possibly two branch predictors machine learning branch prediction using lvq multi-layer perceptrons called neural branch prediction proposed lucian vintan lucian blaga university sibiu one year later developed perceptron branch predictor neural branch predictor research developed much daniel jimenez 2001 first perceptron predictor presented feasible implement hardware first commercial implementation perceptron branch predictor amd piledriver microarchitecture main advantage neural predictor ability exploit long histories requiring linear resource growth classical predictors require exponential resource growth jimenez reports global improvement 5.7 mcfarling-style hybrid predictor also used gshare/perceptron overriding hybrid predictors main disadvantage perceptron predictor high latency even taking advantage high-speed arithmetic tricks computation latency relatively high compared clock period many modern microarchitectures order reduce prediction latency jimenez proposed 2003 fast-path neural predictor perceptron predictor chooses weights according current branch path rather according branch pc many researchers developed concept a. seznec m. monchiero d. tarjan k. skadron v. desmet akkary et al. k. aasaraai michael black etc state-of-the-art branch predictors using perceptron predictor see intel championship branch prediction competition intel already implements idea one ia-64 simulators 2003 amd ryzen multi-core processor infinity fabric samsung exynos processor include perceptron based neural branch predictor ibm 7030 stretch designed late 1950s pre-executes unconditional branches conditional branches depended index registers conditional branches first two production models implemented predict untaken subsequent models changed implement predictions based current values indicator bits corresponding today condition codes stretch designers considered static hint bits branch instructions early project decided misprediction recovery provided lookahead unit stretch part stretch reputation less-than-stellar performance blamed time required misprediction recovery subsequent ibm large computer designs use branch prediction speculative execution ibm 3090 1985 two-bit predictors introduced tom mcwilliams curt widdoes 1977 lawrence livermore national lab s-1 supercomputer independently jim smith 1979 cdc microprogrammed processors popular 1960s 1980s beyond took multiple cycles per instruction generally require branch prediction however addition ibm 3090 several examples microprogrammed designs incorporated branch prediction burroughs b4900 microprogrammed cobol machine released around 1982 pipelined used branch prediction b4900 branch prediction history state stored back in-memory instructions program execution b4900 implements 4-state branch prediction using 4 semantically equivalent branch opcodes represent branch operator type opcode used indicated history particular branch instruction hardware determines branch prediction state particular branch needs updated rewrites opcode semantically equivalent opcode hinted proper history scheme obtains 93 hit rate others granted scheme vax 9000 announced 1989 microprogrammed pipelined performs branch prediction first commercial risc processors mips r2000 r3000 earlier sparc processors trivial not-taken branch prediction use branch delay slots fetched one instruction per cycle execute in-order performance loss later r4000 uses trivial not-taken branch prediction loses two cycles taken branch branch resolution recurrence four cycles long branch prediction became important introduction pipelined superscalar processors like intel pentium dec alpha 21064 mips r8000 ibm power series processors rely one-bit simple bimodal predictors dec alpha 21264 ev6 uses next-line predictor overridden combined local predictor global predictor combining choice made bimodal predictor amd k8 combined bimodal global predictor combining choice another bimodal predictor processor caches base choice bimodal predictor counters bits l2 cache otherwise used ecc result effectively large base choice predictor tables parity rather ecc instructions l2 cache parity design sufficient since instruction suffering parity error invalidated refetched memory alpha 21464 ev8 cancelled late design minimum branch misprediction penalty 14 cycles use complex fast next-line predictor overridden combined bimodal majority-voting predictor majority vote bimodal two gskew predictors 2018 catastrophic security vulnerability called spectre made public google project zero researchers affecting virtually modern cpus vulnerability involves extracting private data leftover data caches branch mispredictions | [
3932,
5012,
6079,
1447,
5371,
1452,
3948,
14,
7527,
7529,
16,
7541,
2567,
2929,
4694,
5042,
3294,
3635,
1481,
5055,
2226,
1867,
2248,
4368,
4370,
6148,
4372,
780,
2257,
3674,
441,
2263,
2266,
5799,
6165,
6170,
4047,
3365,
4408,
5483,
15... | Test |
5,738 | 3 | Reliability,_availability_and_serviceability:reliability availability serviceability reliability availability serviceability ras computer hardware engineering term involving reliability engineering high availability serviceability design phrase originally used international business machines ibm term describe robustness mainframe computers computers designed higher levels ras many features protect data integrity help stay available long periods time without failure data integrity uptime particular selling point mainframes fault-tolerant systems ras originated hardware-oriented term systems thinking extended concept reliability-availability-serviceability systems general including software note distinction reliability availability reliability measures ability system function correctly including avoiding data corruption whereas availability measures often system available use even though may functioning correctly example server may run forever ideal availability may unreliable frequent data corruption physical faults temporary permanent transient intermittent faults typically handled detection correction e.g. ecc codes instruction replay see permanent faults lead uncorrectable errors handled replacement duplicate hardware e.g. processor sparing passing uncorrectable error high level recovery mechanisms successfully corrected intermittent fault also reported operating system os provide information predictive failure analysis example hardware features improving ras include following listed subsystem fault-tolerant designs extended idea making ras defining feature computers applications like stock market exchanges air traffic control system crashes would catastrophic fault-tolerant computers e.g. see tandem computers stratus technologies tend duplicate components running lock-step reliability become less popular due high cost high availability systems using distributed computing techniques like computer clusters often used cheaper alternatives | [
1254,
4387,
3849,
2014,
3191,
5571,
1197,
6461,
1112,
2234,
2776,
2254,
7499,
1237,
6500,
2442,
1516,
7143
] | Test |
5,739 | 0 | William_J._Barry:william j. barry william john barry born 1943 ireland one leading phoneticians germany came germany early years mainly educated university kiel renowned german phonetician klaus j. kohler 1992 appointed chair phonetics saarland university principal research areas speech synthesis rhythm segmental structures application linguistics questions pronunciation learning speech-language pathology speech technology general william j. barry innovative productive research close cooperation institute computational linguistics saarland university well german research center artificial intelligence also saarbruecken made saarbruecken institute phonetics outstanding pillar science europe 2007 w. j. barry held chair 16th international congress phonetic sciences icphs became emeritus professor 2008 barry currently council member international phonetic association editor phonus journal publications resulted cooperation researchers | [] | Test |
5,740 | 3 | MediaTek:mediatek mediatek inc. taiwanese fabless semiconductor company provides chips wireless communications high-definition television handheld mobile devices like smartphones tablet computers navigation systems consumer multimedia products digital subscriber line services well optical less disc drives headquartered hsinchu taiwan company 25 offices worldwide third largest fabless ic designer worldwide 2016 since founding 1997 mediatek creating chipsets global market mediatek also provides customers reference designs mediatek originally unit united microelectronics corporation umc tasked designing chipsets home entertainment products 28 may 1997 unit spun incorporated mediatek inc. listed taiwan stock exchange tsec 2454 code 23 july 2001 company started designing chipsets optical drives subsequently expanded chips dvd players digital tvs mobile phones smartphones tablets general mediatek strong record gaining market share displacing competitors entering new markets company launched division design products mobile devices 2004 seven years later taking orders 500 million mobile system-on-chip units per annum included products feature phones smart devices providing extensive system engineering assistance company allowed many smaller companies new entrants enter mobile phone market previously dominated large often vertically integrated corporations long broadly entrenched telecommunications industry mobile chip market quickly became main growth driver company mobile world congress 2014 mediatek unveiled new brand “ everyday genius ” dubbing term “ super-mid market ” vision aiming make smartphones accessible affordable wider market november 2014 1500 mobile models accounting 700 million units shipped globally 2014 using mediatek chips company posted revenues us 5.3 billion first half 2014 nearly much whole 2013 revenue growth however partly due revenue recognition acquisition mstar became effective beginning 2014 2005 mediatek acquired inprocomm wireless semiconductor design company producing 802.11a b a/g chips september 10 2007 mediatek announced intention buy analog devices cellular radio baseband chipset divisions us 350 million acquisition finalised january 11 2008 5 may 2011 mediatek acquired ralink technology corporation gaining products expertise wi-fi technology mobile non-mobile applications well wired dsl ethernet connectivity 11 april 2012 mediatek acquired coresonic global producer digital signal processing products based linköping sweden coresonic became wholly owned subsidiary mediatek europe 22 june 2012 mediatek announced would acquire rival taiwanese chipset designer mstar semiconductor inc. held strong market share position digital television chips initial phase deal saw mediatek taking 48 percent stake option purchase remaining stake later date following merger mediatek mstar delayed antitrust concerns china south korea finalized 1 february 2014 mediatek financial results subject variation financial success different product lines fluctuated mediatek relatively strong sales 2009/2010 based strong market position feature phone chipsets smartphone tablet products contributed mediatek sales income increase 2013 revenue recognition acquisition mstar semiconductor became effective february 2014 well continuing strong position smartphone tablet solutions main reasons sales growth seen 2014 2014 smartphone chips accounted approximately 50–55 revenue followed digital home products 25–30 includes digital television chips tablet chips 5–10 feature phone chips 5–10 wi-fi products 5–10 mediatek started shipping chips integrated 4g lte baseband volume second half 2014 later largest competitor qualcomm additional cost separate baseband chip required every 4g handset made mediatek offerings expensive prompted larger customers like alcatel one touch zte choose competing socs like qualcomm snapdragon 400 410 platforms negatively affecting mediatek revenue stream mediatek stock trading taiwan stock exchange symbol mediatek often followed industry-first strategy differentiate competition mt8135 system-on-chip soc tablets announced july 2013 industry first chip implement new arm big.little technology heterogeneous multi-processing variant mt8135 used amazon kindle fire hd tablet models also november 20 2013 mediatek launched mt6592 soc first system-on-chip soc eight cpu cores could used simultaneously contrast competing socs eight physical cores subset could active given time true octa-core trademark registered emphasize difference marketing materials 7 january 2014 mediatek announced development world first multimode receiver wireless charging contrast existing implementations compatible inductive resonant charging resulting mt3188 wireless charging chip certified power matters alliance wireless power consortium announced february 24 2014 25 february 2014 mediatek announced industry first five-in-one wireless chip soc mt6630 supports 802.11a/b/g/n/ac wifi bluetooth ant+ gps fm radio mediatek collaborated google first ultra hd tv platform android tv resulting development mt5595 digital television soc product first shipped lcd tv models made sony list devices using mediatek socs armv5 list devices using mediatek socs armv7 dual core list devices using mediatek socs armv7 quad core list devices using mediatek socs armv7 hexa core list devices using mediatek socs armv8 quad core list devices using mediatek socs armv8 octa core list devices using mediatek tablet processors consumer electronics show january 2015 mediatek announced mt2601 wearable devices based google ’ android wear software according mediatek small size allows fewer components lower current consumption compared chipsets market chip includes dual-core arm cortex-a7 cpu arm mali-400 mp gpu allows display resolutions qhd 960x540 combined mt6630 chip wireless connectivity mediatek mt2621 mt2625 two soc build lte nb-iot modems mt2625 launched 29 june 2017 mt2621 added 24 november mt6630 2014 five-in-one combo wireless soc integrating dual-band 802.11a/b/g/n/ac advanced wi-fi direct miracast support bluetooth 4.1 ant+ tri-band gps fm transceiver intended paired chips like mt6595 octa-core smartphone processor features integrated 4g modem built-in wi-fi/bluetooth/gps/fm functionality could also used tablets conjunction stand-alone application processor global navigation satellite system gnss modules result merger ralink mediatek added wireless network interface controllers ieee 802.11-standards socs mips cpus product portfolio consumer electronics show january 2015 mediatek announced mt5595 new digital television soc support google android tv platform adopted sony new lcd tv models | [
2538,
2903,
6074,
6421,
7890,
722,
6435,
2926,
1473,
740,
5752,
7189,
5405,
5055,
5406,
1864,
2591,
7209,
67,
4365,
4368,
4370,
4372,
6865,
446,
7956,
451,
5804,
6874,
6165,
5459,
463,
1167,
5472,
469,
4041,
5473,
3008,
6910,
5845,
7654... | Validation |
5,741 | 4 | Real-time_recovery:real-time recovery information technology real-time recovery ability recover piece infrastructure server infrastructure failure human-induced error time frame minimal impact business operations real-time recovery focuses appropriate technology restores thus reducing recovery time objective rto minutes recovery point objectives rpo within 15 minutes ago minimizing test recovery objectives tro ability test validate backups occurred correctly without impacting production systems real-time recovery new market segment backup recovery disaster recovery market addresses challenges companies historically faced regards protecting importantly recovering data real-time recovery solution must contain minimum following attributes ability restore server minutes totally different virtual environment within 5 minutes ago require use additional agents options modules accomplish must able restore files seconds reason anyone backups able restore must perform sector level backups every 5 minutes ability self-heal broken incremental chain backups part image set get corrupted deleted must deliver improved recoverability data files databases data loss classified three broad categories data servers either physical hosts servers running guest servers within virtualization platform combination common customer environment mixture virtual physical servers attention detail must given approach protecting data servers regular intervals distinct advantages selecting technology virtual physical independent would limit number technologies organizations get trained skilled purchase deploy manage maintain ideal world reduce complexity managing multiple products protect physical virtual infrastructure reap rewards technology gets installed operating system level ensures consistency environment either physical virtual eliminates api compatibility disk volume structure limitations e.g raw mapped devices vmfs prior selecting realtime recovery strategy real-time recovery rtr solution disaster recovery planner refer organization business continuity plan indicate key metrics recovery point objective rpo recovery time objective recovery time objective various business processes process run payroll generate order e-mail etc. metrics specified business processes must mapped underlying systems infrastructure support processes recovery time objective recovery point objective metrics mapped infrastructure dr planner determine suitable recovery strategy system important note however business ultimately sets budget therefore rto rpo metrics need fit available budget business unit heads would like zero data loss zero time loss cost associated level protection historically made high availability solutions impractical unaffordable benefit implementing real-time recovery solution investment substantially reduced traditional tape based backup products | [
4554,
2390
] | Test |
5,742 | 8 | Dreamwidth:dreamwidth dreamwidth online journal service based livejournal codebase code fork original service set ex-livejournal staff denise paolucci mark smith born desire new community based open access transparency freedom respect dreamwidth announced 11 june 2008 went open beta 30 april 2009 part features similar livejournal users journals may post entries webpage users may comment dreamwidth also provides shared group journals called communities areas dreamwidth differs significantly livejournal include following initially dreamwidth accounts could created invite code december 2011 invite codes turned originally experimental temporary measure significant increase spam accounts servers adjusted handle load invite codes turned back start new year planned new users still create account without use invite code free accounts limited features paid accounts exist two levels paid premium paid additional features time open beta launch limited number seed accounts also available response criticisms livejournal friending system dreamwidth split user relationships two parts subscriptions access control users may subscribe users journals grant access users read locked entries separate actions dreamwidth terminology reflects split instance friends page renamed reading page custom friends groups split access filters reading filters dreamwidth provides greater interoperability livejournal-based sites including ability import journal another site crosspost multiple sites greater functionality users log via openid addition search facilities brought livejournal paid account users search journal introduced 24 july 2009 livejournal initially free advertisements gradually incorporated 2017 ads shown non-paid readers pages dreamwidth remains free advertisements following features available livejournal available dreamwidth despite lack features dreamwidth acclaimed strong community transparency dreamwidth based upon free open-source server software designed run livejournal written primarily perl majority dreamwidth code available gpl sites use unlike many social networking sites using livejournal codebase insanejournal deadjournal dreamwidth code fork removing unwanted features advertising adding new ones described founders site rejected advertising model intrusive instead implemented payment system users purchase add-on premium features 2009 oscon presentation saw dreamwidth identified highly unusual among open-source projects number women development team 75 developers female compared around 1.5 field whole paolucci smith also spoke linux.conf.au 2010 dreamwidth development model invited speak web 2.0 expo oscon techniques dreamwidth accepted gsoc mentoring organization summer 2010 allotted seven students worked variety projects athena also known afuna fu introduced site first paid employee 7 april 2010 7 september 2010 mark smith announced stepped back dreamwidth front line moved work stumbleupon still owner dreamwidth along denise however following positive reactions dreamwidth diversity statement model inclusiveness various projects followed suit including python diversity list dreamfish | [
5965,
3084,
5983,
518
] | Test |
5,743 | 3 | EMM386:emm386 name emm386 used expanded memory managers microsoft ms-dos ibm pc dos digital research dr-dos created expanded memory using extended memory intel 80386 cpus also emm386.exe available freedos emm386.exe map memory unused blocks upper memory area uma allowing device drivers tsrs loaded high preserving conventional memory technique probably first appeared development cemm included compaq ms-dos 3.31 1987 microsoft version first appeared built-in windows/386 2.1 1988 standalone emm386.sys ms-dos 4.01 1989 flexible emm386.exe version appeared ms-dos 5.0 1991 expanded memory managers emm386 uses processor virtual 8086 mode forces memory accesses made dos applications go processors mmu introduced 386 page table entries used mmu configured emm386 map certain regions upper memory areas extended memory obtained emm386 extended memory manager himem.sys technique enabled ems expanded memory well umbs appear dos applications memory upper area fact mapped physical memory locations beyond 1mb temporarily shuts windows session 386 enhanced mode windows protected mode kernel taking role windows uses gemmis api take memory management emm386.exe global emm import specification gemmis supported via document available select number memory-manager vendors windows/386 paging import specification memory managers implemented gemmis api ones include emm386.exe quarterdeck qemm386.sys dosbox builtin dos notably missing freedos memory managers freedos memory managers himemx.exe jemm386.exe jemmex.exe implement gemmis api windows fails start running conjunction jemmxxx since windows fails take memory management role windows windows 98 windows 95 windows workgroups 3.1x windows 3.xx fail jemmxxx displaying jemmxx possible run windows 3.x windows workgroups 3.1x limited capabilities forcing windows use standard mode i.e using 80286 protected mode 80386 enhanced mode three conditions required note windows standard mode limited functionality lacks virtual memory skips 386enh section system.ini device drivers 386enh loaded | [
4088,
204,
4291,
8087,
6380,
5571,
4417,
126,
852,
6634,
3137,
3319,
858
] | Test |
5,744 | 3 | Compute_Node_Linux:compute node linux compute node linux cnl runtime environment based linux kernel cray xt3 cray xt4 cray xt5 cray xt6 cray xe6 cray xk6 supercomputer systems based suse linux enterprise server cnl forms part cray linux environment systems running cnl ranked 3rd 6th 8th among fastest supercomputers world | [
3256,
2182,
3613,
7528,
7532,
6443,
2942,
6117,
4341,
5762,
412,
415,
3666,
2970,
7956,
5453,
5460,
7242,
802,
1535,
1924,
6892,
1176,
1933,
5829,
1208,
6211,
4435,
5865,
7669,
3404,
1227,
1596,
165,
7312,
1607,
5884,
1991,
1251,
890,
3... | Test |
5,745 | 4 | Mks_vir:mks vir mks_vir formerly mks_vir – polish antivirus program created marek sell 1987 original reason creation software solutions existing market times satisfy author needs first versions dos distributed floppy disks apexim company marek sell worked updates issued monthly sent mail initially software delivered users personalized – main screen contained serial number data license owner despite program often used without license popularity confirmed appearing trojan horses impersonating program updates issued yet later together full version software demo versions issued allowed use program week educational reasons program contained descriptions operation viruses including demonstrations graphical sound effects 3.99 version lexicon viruses popular poland 1996 became winner third edition teraz polska contest 1996 mks company created marek sell became program producer website program bbs created company continued development program death author 2004 versions microsoft windows unix created online scanner based activex technology became available software website bankruptcy mks company 2011 property receiver sold rights mks_vir trademark arcabit company created years earlier former mks employees reactivated mks_vir product free antivirus application officially arcabit company resigned distribution support software 2014 march 1 although released brand new version may 2018 program versions | [
6991,
4759,
6380,
5571,
352,
578,
6367
] | Test |
5,746 | 8 | Voat:voat voat inc open source news aggregator social networking service registered community members submit content text posts direct links registered users vote submissions content entries organized areas interest called subverses website described several media outlets including quartz new york times new york us uk editions wired hub alt-right voat site hosts aggregated content discussion forums according wired voat aesthetically functionally similar reddit like reddit voat collection entries submitted registered users themed categories called subverses voat similar bulletin board system unlike reddit voat emphasized looser content restrictions ad-revenue sharing program voat written c programming language reddit written python january 2017 new yorker article voat described descendant 2chan 4chan 8chan users compete shock value verge described site imzy dark twin indirect products gamergate culture war name voat play words 'goat 'vote site mascot goat website uses colombian top level domain .co registered november 2014 founded april 2014 whoaverse website hobby project atif colo known voat atko student pursuing bsc later joined justin chastain known puttitout website labelled alternative reddit focus freedom expression december 2014 whoaverse changed name voat ease use february 2015 following accusations censorship reddit voat claimed seen “ large influx ” new users reddit early june 2015 reddit banned five subreddits harassment—the largest around 150,000 subscribers—many users reddit began create accounts voat influx new participants temporarily overloaded site causing downtime voat germany-based web hosting service host europe precursor webfusion shut service june 2015 alleged voat publicizing incitement people well abusive insulting youth-endangering content well illegal right-wing extremist content voat founder attributed shutdown political correctness voat also payments frozen paypal due sexually oriented materials services voat shut four subverses response two hosted sexualized images minors jailbait website continued accept donations bitcoin able continue functioning moved different hosting provider website continued experience downtime due ongoing distributed denial service ddos attack rendering 700,000 unique visitors unable access site early july 2015 following dismissal popular administrator reddit another influx reddit members registered voat leading traffic caused voat experience downtime developers website subsequently approached venture capitalists interested investing project also july voat alongside wikileaks subject bitcoin dust attack ddos attacks bitcoin attack slowed payment processing websites ddos attack launched july 12 unsuccessful due cloudflare services although side effect rendering third-party voat apps incapable functioning august 2015 voat became incorporated united states colo explained post announcing incorporation u.s. law far beats every candidate country ’ researched november 2016 users relocated voat reddit banned pizzagate conspiracy theory subreddit citing doxing harassment concerns january 2017 colo resigned ceo voat citing lack time available devote site colo replaced ceo chastain may 2017 chastain ran fundraising campaign announcing voat might shut due lack money november 2017 reddit incel community moved voat incel community banned reddit september 12 2018 reddit banned several subreddits dedicated discussing qanon conspiracy theory stating violated rules prohibiting inciting violence harassment dissemination personal information caused many q anon posters migrate voat | [
1691,
5965,
52,
518,
744
] | Test |
5,747 | 2 | User-Mode_Driver_Framework:user-mode driver framework user-mode driver framework umdf device-driver development platform first introduced microsoft windows vista operating system also available windows xp facilitates creation drivers certain classes devices standard device drivers difficult write must handle wide range system device states particularly multithreaded software environment badly written device drivers cause severe damage system e.g. bsod data corruption since standard drivers high privileges accessing kernel directly user-mode driver framework insulates kernel problems direct driver access instead providing new class driver dedicated application programming interface user level interrupts memory management error occurs new framework allows immediate driver restart without impacting system particularly useful devices intermittently connected system support hot swapping via bus technology usb firewire according microsoft umdf drivers simpler write debug kernel-mode drivers however umdf would used performance-intensive highly stateful devices first version umdf shipped part windows media player version 10 2004-10-12 code-named crescent designed support media transfer protocol driver public interfaces documentation provided later microsoft decided turn umdf device driver development platform umdf driver dll based microsoft component object model com however umdf use com loading unloading controlling concurrency uses com programming pattern example exploiting com iunknown interface startup umdf calls dllgetclassobject get pointer iclassfactory interface driver uses createinstance method iclassfactory interface create instance driver callback object driver object instance framework-provided iwdfdriver interface driver provides set callbacks via idriverentry com interface main entry point driver customization | [
7149,
6420,
714,
720,
1460,
2928,
7907,
4697,
2953,
53,
6840,
422,
425,
1499,
4017,
6504,
4022,
4026,
7607,
1526,
3687,
7619,
7621,
7971,
2283,
2290,
5479,
7263,
5850,
150,
6933,
519,
3052,
4448,
3407,
2341,
1232,
2702,
7687,
1989,
4848... | Test |
5,748 | 4 | Auslogics_Antivirus:auslogics antivirus auslogics antivirus antivirus software application intended protect user computer viruses spyware keyloggers cyber threats program also check computer vulnerability status provide privacy controls real-time virus protection encryption instant messaging program made used computers run microsoft windows operating system application version 14 latest writing article february 2012 supporting windows xp vista 7 program published auslogics software pty ltd australian-based company specializes maintenance software computers run microsoft windows operating system started 2008 company gained recognition two highly rated products – auslogics boostspeed auslogics disk defrag 2009 company partnered sony vaio develop part sony vaio care software installed vaio laptops desktop pc ’ 2011 auslogics premier elite partner status intel software partner program december 2011 comparative test performed independent antivirus software certification authority virus bulletin auslogics antivirus received vb100 award placed among top 10 programs 54 antivirus packages included test reactive proactive rap detection rates near 100 chart published virus bulletin program also received editor pick award software informer rated 5 stars download3000.com reviewed freedownloadscenter.com among program advantages reviewers cite easy-to-use configuration wizard settings levels novice intermediate advanced users high detection rates gaming mode feature main drawback mentioned reviews lengthy installation process | [
4759,
5401
] | Validation |
5,749 | 3 | Aura_Battler_Dunbine:aura battler dunbine dunbine set byston well parallel world resembles countryside medieval europe kingdoms ruled monarchs castles armies unicorn-riding cavalry armed swords crossbows little winged creatures called ferario flying offering help hindrance depending mood main draw series insect-like aura battlers used population byston well fight wars fighting suits powered powerful energy called aura life energy certain people strong enough aura-energy act power-supply mecha making aura warriors series aired nagoya tv february 5 1983 january 21 1984 totaling 49 episodes three-episode anime ova sequel new story aura battler dunbine also known tale neo byston well released 1988 series later dubbed adv films released dvd north america along original japanese version 2003 however quickly became print 2018 available digital purchase now-defunct daisuki site sentai filmworks licensed series series followed shō zama suddenly finds pulled world byston well vehicular incident one rivals byston well located another dimension located sea land populated dragons castles knights powerful robots known aura battlers shō discovered possess powerful aura drafted byston well conflict pilot lavender-colored dunbine tomino creations dunbine cast populated nordic-looking military types elaborate costumes one side young japanese hero caught middle freedom fighters side beautiful female warriors abound sides hero falls main female lead romances cut across battle lines non-stop battles elaborate fighting craft land air cast pilot aura battlers although lots standard airships smaller fighters large warships well also typical tomino style large number named characters die tragically throughout series dunbine characters mecha storyline elements make appearances quite games super robot wars series banpresto notably first series banpresto gone make spinoff series taking place different universes alpha series impact however dunbine made appearances latter titles recently making something comeback first returning ux followed almost immediately operation extend bx gives recent use story dunbine units also appeared another century episode series first sequel another century episode 2 many units dunbine series included compared amount first game large part plot shō marvel piloting bilbine dunbine respectively also acquire unique team attack another century episode 3 story plot involve dunbine player unit continues appear bilbine shares combination attack nanajin wings rean also world set byston well first three games produced family soft msx 2000 title released playstation bandai new story aura battler dunbine also known tale neo byston well three episode anime ova released 1988 sequel tv series dunbine set roughly 700 years events show also second show set fictional medieval land byston well followed garzey wing wings rean directed toshifumi takizawa samurai 7 700 years passed since great war involving aura machines ended attempt conquer byston well black knight rabaan kidnaps princess nation baran-baran – nation said hold legendary treasure rabaan also captures shion young hunter shion princess remul escape rabaan castle return homeland find baran-baran treasure actually powerful aura battler sirbine riding sirbine shion fights rabaan evil forces | [
1507
] | Train |
5,750 | 3 | WonderMedia:wondermedia wondermedia fabless soc company headquartered taipei taiwan subsidiary via technologies notable creating low cost processors used large number chinese android windows ce-based devices soc designs collectively called wondermedia prizm platform based reference implementations provided arm holdings | [
2538,
6421,
7890,
722,
2926,
1473,
4694,
5752,
5405,
5406,
1864,
67,
446,
451,
6165,
1162,
463,
1167,
5472,
469,
4041,
3008,
3365,
6910,
5845,
7654,
3397,
1977,
1237,
2711,
1995,
550,
4846,
3786,
2744,
2024,
5576,
1284,
4879,
5585,
7376... | Test |
5,751 | 9 | Intersection_type:intersection type type theory intersection type assigned values assigned two given types particular value assigned type formula_1 type formula_2 value assigned intersection type formula_3 intersection type system generally ranges values two types overlap value belonging intersection two ranges assigned intersection type two types value safely passed argument functions expecting either two types example java class implements interfaces therefore object type safely passed functions expecting argument type functions expecting argument type intersection types composite data types similarly product types used assign several types object however product types assigned tuples tuple element assigned particular product type component comparison underlying objects intersection types necessarily composite restricted form intersection types refinement types intersection types useful describing overloaded functions example type functions taking number argument returning number type functions taking string argument returning string intersection two types used describe overloaded functions one based type input given contemporary programming languages including ceylon flow java scala typesript whiley see comparison languages intersection types use intersection types combine interface specifications express ad hoc polymorphism complementing parametric polymorphism intersection types may used avoid class hierarchy pollution cross-cutting concerns reduce boilerplate code shown typescript example type theoretic study intersection types referred intersection type discipline remarkably program termination precisely characterized using intersection types microsoft typescript supports intersection types improving expressivity type system reducing potential class hierarchy size demonstrated follows following program code defines classes method returning object either type additionally function resp requires object type resp argument //produces eggs //produces milk //produces random number //requires egg function eategg egg egg //requires milk function drinkmilk milk milk following program code defines ad hoc polymorphic function invokes member function given object function two type annotations namely connected via intersection type constructor specifically applied argument type returns object type type applied argument type returns object type type ideally applicable object possibly chance method //given chicken produces egg given cow produces milk let animaltofood chicken egg cow milk finally following program code demonstrates type safe use definitions var chicken new chicken var cow new cow var randomnumbergenerator new randomnumbergenerator console.log randomnumbergenerator.produce //0.2626353555444987 //console.log animaltofood randomnumbergenerator //error argument type 'randomnumbergenerator assignable parameter type 'cow' console.log eategg animaltofood chicken //i ate egg //console.log eategg animaltofood cow //error argument type 'milk assignable parameter type 'egg' console.log drinkmilk animaltofood cow //i drank milk //console.log drinkmilk animaltofood chicken //error argument type 'egg assignable parameter type 'milk' program code following properties minimalistic example realized using inheritance instance deriving classes base class however larger setting could disadvantageous introducing new classes class hierarchy necessarily justified cross-cutting concerns may outright impossible example using external library imaginably example could extended following classes may require additional classes interfaces specifying whether produce method available whether produce method returns food whether produce method used repeatedly overall may pollute class hierarchy minimalistic example already shows duck typing less suited realize given scenario class contains method object valid argument example realized using duck typing instance introducing new field classes signifying objects corresponding type valid arguments however would increase size respective classes especially introduction methods similar also non-local approach respect example realized using function overloading instance implementing two methods typescript solution almost identical provided example programming languages java require distinct implementations overloaded method may lead either code duplication boilerplate code example realized using visitor pattern would require animal class implement method accepting object implementing interface adding non-local boilerplate code function would realized method implementation unfortunately connection input type result type would difficult represent one hand intersection types used locally annotate different types function without introducing new classes interfaces class hierarchy hand approach requires possible argument types result types specified explicitly behaviour function specified precisely either unified interface parametric polymorphism duck typing verbose nature intersection types unfavorable therefore intersection types considered complementary existing specification methods dependent intersection type denoted formula_4 dependent type type formula_2 may depend term variable formula_6 particular term formula_7 dependent intersection type formula_4 term formula_7 type formula_1 type formula_11 formula_11 type results replacing occurrences term variable formula_6 formula_2 term formula_7 scala supports type declarations object members allows type object member depend value another member called path-dependent type example following program text defines scala trait witness used implement singleton pattern trait witness trait witness declares member assigned type value member value assigned value type t. following programm text defines object booleanwitness instance trait witness object booleanwitness defines type boolean value value true example executing system.out.println booleanwitness.value prints true console object booleanwitness extends witness let formula_16 type specifically record type objects member formula_17 type formula_1 example object booleanwitness assigned dependent intersection type formula_19 reasoning follows object booleanwitness member assigned type boolean value since boolean type object booleanwitness type formula_20 additionally object booleanwitness member value assigned value true type boolean since value booleanwitness.t boolean object booleanwitness type formula_21 overall object booleanwitness intersection type formula_22 therefore presenting self-reference dependency object booleanwitness dependent intersection type formula_19 alternatively minimalistic example described using dependent record types comparison dependent intersection types dependent record types constitute strictly specialized type theoretic concept intersection type family denoted formula_24 dependent type type formula_2 may depend term variable formula_6 particular term formula_7 type formula_24 term formula_29 type formula_1 term formula_7 type formula_32 notion also called implicit pi type observing argument formula_29 kept term level | [
7152,
4039,
8174,
7071,
8097,
4254,
1407,
3225,
4359,
7687,
2617,
5353,
2619,
6593,
1803
] | Test |
5,752 | 3 | Apple_A5X:apple a5x apple a5x 32-bit system-on-a-chip soc designed apple inc. introduced launch third generation ipad march 7 2012 high performance variant apple a5 apple claims twice graphics performance a5 superseded iphone 5 5c a6 chip fourth generation ipad a6x chip software updates ipad 3rd generation ended 2016 thus ceasing support chip a5x features dual-core arm cortex-a9 cpu 1 ghz quad-core powervr sgx543mp4 gpu clocked 250 mhz apple doubled size a5x memory interface comparison a5 including memory interface subsystem four 32-bit wide lp-ddr2 memory controllers done provide sufficient bandwidth high pixel count third generation ipad retina display unlike a4 a5 a5x covered metal heat spreader package-on-package pop assembly earlier chips ram sat top soc however a5x ram bundled together soc instead a5x sits one side motherboard twin samsung lp ddr2 sdram soldered directly side motherboard a5x manufactured 45 nm process samsung silicon die size increased drastically compared a5 165 mm 3.1 times larger 53.3 mm die area original a4 | [
6788,
3940,
6082,
6421,
7890,
5732,
722,
1799,
1094,
4320,
2926,
4690,
5037,
5740,
1473,
734,
5750,
405,
5405,
5406,
1864,
6125,
2954,
1123,
7572,
6482,
6847,
67,
6142,
2609,
1895,
4373,
7226,
4376,
2978,
5091,
446,
4749,
5450,
7601,
45... | Test |
5,753 | 4 | Partimage:partimage partimage disk cloning utility linux/unix environments partimage save partitions many formats disk image utilities partimage useful number situations commonly encountered network administrators well advanced computer users maintain systems last stable release 2010 since one partimage authors worked fsarchiver broader functionality partimage common uses partimage follows windows users partimage includes experimental support ntfs partimage supports common linux file systems found many linux distributions including debian live distros ping knoppix systemrescuecd notable features include compression disk image files support backup/restore network file server data encryption partimage uses newt gui partimage limited cloning partitions supported filesystem types includes ext2 ext3 reiserfs fat12 fat16 fat16b fat32 hpfs jfs xfs ufs hfs ntfs partimage support ext4 btrfs | [
5271,
1254,
4759,
2185,
1534,
6175,
2390,
2566,
5571,
5660,
578,
2936,
6117,
6761,
3915,
7306,
174,
788
] | Test |
5,754 | 7 | Numecent:numecent numecent irvine california-based software technology company develops software used deliver native software applications premises server farm cloud patented technology called cloudpaging based virtualization allows delivery pre-virtualized software instructions user machine on-demand instructions executed soon received numecent roots started 1999 darpa project u.c irvine arthur hitomi one three scientists formed endeavors technology inc. irvine california-based software development company project connected computers mobile devices internet work groups developed application delivery technology support groups 2000 tadpole technology plc maker mobile computing devices software purchased endeavors 2004 tadpole also acquired stream theory california-based software company developed technology deploying application software internet across enterprise networks focus gaming market two companies constituted genesis technology later became known cloudpaging 2007 patenting application streaming technology tadpole decided focus solely developing business 2008 tadpole changed name endeavors technologies inc 2009 osman kent sold 3dlabs creative labs 2002 acquired endeavors formed numecent holdings company emerged end-user computing market technology two former employees started united kingdom boston ma-based spinoff called software2 help universities deploy microsoft windows applications physical machines cloud 2012 numecent publicly launched osman kent ceo 2013 numecent software2 announced partnership numecent flagship cloudpaging product application jukebox suite deployed 40 universities uk 2015 application jukebox suite dropped product name favor standalone trademarked name cloudpaging march 2015 numecent announced hiring former broadcom executive vice president tom lagatta ceo osman kent promoted role executive chairman january 2017 co-founder cto arthur hitomi became president ceo company ’ main product cloudpaging enables existing windows applications cloudpage pcs run perform act natively installed cloudpaging server conjunction cloudpaging player allows software delivered cloud pre-virtualizing software encrypted divided small fragments company calls pages pages delivered one time executed client computer software also employs statistical modeling dynamically predict pages sent first cloudpaging makes desktop applications fully available faster less disk space required applications also run computer disconnected internet network outage august 2013 company announced service presently branded cloudpaging cdn introduced launch native-as-a-service naas offered conjunction amazon web services multi-tenant cloud via self-hosting option applications virtualized licenses cloudified made available delivery end users without rewrite recompile underlying source code march 2017 company announced android offering named cloudpaging android utilities cloudpaging technology reduce impact application install sizes android devices numecent announced first spin technology approxy 2012 approxy offers white-label delivery service game developers publishers approxy ’ system reduces delay players allowing start playing seconds download additional code necessary play retrieved piece-by-piece october 2014 numecent announced bringing approxy group back numecent parent attempt attract game industry customers required access cloudpaging source code numecent named gartner cool vendor cloud computing 2013 february 2012 company closed series funding round 2m may 2013 numecent closed series b funding 13.6m t-venture deutsche telecom venture funding arm november 2015 company closed series c funding round 15.5m | [
5064,
2961,
5904,
4759
] | Test |
5,755 | 2 | Open_Network_Install_Environment:open network install environment open network install environment onie open source install environment acts enhanced boot loader utilizing facilities linux/busybox environment small linux operating system allows end-users channel partners install network operating system part data center provisioning similar way servers provisioned operating system choice onie enables network switch hardware suppliers distributors resellers manage operations based small number hardware stock keeping unit skus turn creates economies scale manufacturing distribution stocking return merchandise authorization rma enabling ecosystem network hardware operating system alternatives | [
362,
5571,
1988,
578
] | Test |
5,756 | 0 | David_Andreoff_Evans:david andreoff evans david andreoff evans born 1948 st. louis scientist field computational linguistics best known research indexing using natural language processing ontology learning especially medical informatics evans attended stanford university receiving ph.d. computational linguistics 1982 attended inter-university center japanese language studies 1979 faculty carnegie mellon university 1983 1996 founded computational linguistics program laboratory computational linguistics 1986 supported grant digital equipment corporation led research project computational-linguistic approaches indexing retrieval text clarit september 1992 clarit spun-out carnegie-mellon company called claritech technology used index papers politician h. john heinz iii claritech became research development subsidiary justsystems name changed clairvoyance corporation 1996 becoming justsystems evans research 2007 made many contributions field computational linguistics information retrieval authoring books many research papers holder 25 us patents evans elected fellow american college medical informatics 1999 | [
1314,
5429
] | Test |
5,757 | 9 | CLISP:clisp computing clisp implementation programming language common lisp originally developed bruno haible michael stoll atari st. today supports unix microsoft windows operating systems clisp includes interpreter bytecode compiler debugger socket interface high-level foreign language interface strong internationalization support two object systems common lisp object system clos metaobject protocol mop written c common lisp part gnu project free software available terms gnu general public license gpl haible originally intend distribute clisp gpl well-publicised email exchange richard stallman eventually agreed issue stake whether clisp derivative work gnu readline library clisp extremely portable running almost unix-based operating systems well microsoft windows although interpreting bytecode usually slower running compiled native binaries always major issue especially applications like web development i/o bottleneck clisp also easier set popular foss common lisps sbcl paul graham used clisp run software viaweb startup viaweb early web application portions still exist yahoo stores base yahoo shopping conrad barski land lisp uses clisp-specific functions textbook exercises | [
7878,
1445,
6796,
6087,
2915,
6092,
2559,
5734,
1478,
4332,
4704,
6116,
3981,
7559,
1116,
6471,
2599,
2600,
5077,
2249,
1889,
1890,
5787,
1523,
6876,
4759,
6888,
3370,
1557,
6191,
5494,
1204,
5501,
4070,
6210,
144,
7298,
5515,
8025,
3749,... | Train |
5,758 | 1 | No-force:no-force no-force policy used transaction control database theory term no-force refers disk pages related actual database object modified no-force policy transaction commits changes made actual objects required written disk in-place forced record changes must still preserved commit time ensure transaction durable record typically written sequential transaction log actual changes database objects changes written later time frequently changed objects no-force policy allows updates merged reduce number write operations actual database object no-force policy also reduces seek time required commit mostly sequential write operations transaction log rather requiring disk seek many distinct database objects commit | [] | Train |
5,759 | 2 | Donna_Benjamin:donna benjamin donna benjamin australian open source community contributor commentator advocate served board positions community organisations including open source industry australia drupal association ada initiative lead organiser 2008 linux.conf.au conference melbourne regularly runs community leadership summit x lca clsxlca workshop focussing community development open source projects 2011 organised crowdfunding campaign called digitise dawn successfully raised funds digitise dawn early feminist journal published australia 1888 1905 2012 received rusty wrench award linux australia recognition contributions runs micro-business called creative contingencies specialises drupal content management platform | [
3938,
3084,
462,
7429,
1351,
1822,
4401,
5292,
3780,
5829,
1192,
578,
7740,
7463,
7559,
589,
412,
4435,
3133,
2689,
3404,
7855,
966,
968,
2260,
8149
] | Test |
5,760 | 2 | FreeBSD_version_history:freebsd version history released november 1993 1.1.5.1 released july 1994 2.0-release announced 22 november 1994 final release freebsd 2 2.2.8-release announced 29 november 1998 freebsd 2.0 first version freebsd claimed legally free unix code approval novell first version widely used beginnings spread internet servers 2.2.9-release released april 1 2006 fully functional april fools day prank seventy-seven months tireless work freebsd developers users children pets freebsd 3.0-release announced 16 october 1998 final release 3.5-release announced 24 june 2000 freebsd 3.0 first branch able support symmetric multiprocessing smp systems using giant lock marked transition a.out elf executables usb support first introduced freebsd 3.1 first gigabit network cards supported 3.2-release 4.0-release appeared march 2000 last 4-stable branch release 4.11 january 2005 supported 31 january 2007 freebsd 4 lauded stability favorite operating system isps web hosting providers first dot-com bubble widely regarded one stable high performance operating systems whole unix lineage among new features freebsd 4 codice_1 introduced part major bsd systems jails way running processes separate environments version 4.8 forked matt dillon create dragonfly bsd almost three years development first 5.0-release january 2003 widely anticipated featuring support advanced multiprocessor application threading ultrasparc ia-64 platforms first 5-stable release 5.3 5.0 5.2.1 cut -current last release 5-stable branch 5.5 may 2006 largest architectural development freebsd 5 major change low-level kernel locking mechanisms enable better symmetric multi-processor smp support released much kernel mp lock sometimes called giant lock one process could execute kernel mode time major changes included n native threading implementation called kernel scheduled entities kse principle similar scheduler activations starting freebsd 5.3 kse default threading implementation replaced 1:1 implementation freebsd 7.0 freebsd 5 also significantly changed block i/o layer implementing geom modular disk i/o request transformation framework contributed poul-henning kamp geom enables simple creation many kinds functionality mirroring gmirror encryption gbde geli work supported sponsorship darpa early versions 5.x much developer previews pronounced instability 5.4 5.5 releases freebsd confirmed technologies introduced freebsd 5.x branch future highly stable high-performing releases freebsd 6.0 released 4 november 2005 final freebsd 6 release 6.4 11 november 2008 versions extended work smp threading optimization along work advanced 802.11 functionality trustedbsd security event auditing significant network stack performance enhancements fully preemptive kernel support hardware performance counters hwpmc main accomplishments releases include removal giant lock vfs implementation better-performing optional libthr library 1:1 threading addition basic security module bsm audit implementation called openbsm created trustedbsd project based bsm implementation found apple open source darwin released bsd-style license freebsd 7.0 released 27 february 2008 final freebsd 7 release 7.4 24 february 2011 new features included sctp ufs journaling experimental port sun zfs file system gcc4 improved support arm architecture jemalloc memory allocator optimized parallel computation ported firefox 3 major updates optimizations relating network audio smp performance benchmarks showed significant performance improvements compared previous freebsd releases well linux new ule scheduler much improved decision made ship 7.0 release older 4bsd scheduler leaving ule kernel compile-time tunable freebsd 7.1 ule default i386 amd64 architectures dtrace support integrated version 7.1 netbsd freebsd 7.2 brought support multi-ipv4/ipv6 jails code supporting dec alpha architecture supported since freebsd 4.0 removed freebsd 7.0 freebsd 8.0 officially released 25 november 2009 freebsd 8 branched trunk august 2009 features superpages xen domu support network stack virtualization stack-smashing protection tty layer rewrite much updated improved zfs support new usb stack usb 3.0 xhci support added freebsd 8.2 multicast updates including igmpv3 rewritten nfs client/server introducing nfsv4 aes acceleration supported intel cpus added freebsd 8.2 inclusion improved device mmap extensions enables implementation 64-bit nvidia display driver x86-64 platform pluggable congestion control framework support ability use dtrace applications running linux emulation added freebsd 8.3 freebsd 8.4 released 7 june 2013 final release freebsd 8 series freebsd 9.0 released 12 january 2012 key features release include new installer bsdinstall ufs journaling zfs version 28 userland dtrace nfsv4-compatible nfs server client usb 3.0 support support running playstation 3 capsicum sandboxing llvm 3.0 base system kernel base system could built clang freebsd 9.0 still used gcc4.2 default playstation 4 video game console uses derived version freebsd 9.0 sony computer entertainment dubbed orbis os freebsd 9.1 released 31 december 2012 freebsd 9.2 released 30 september 2013 freebsd 9.3 released 16 july 2014 20 january 2014 freebsd release engineering team announced availability freebsd 10.0-release key features include deprecation gcc favor clang new iscsi implementation virtio drivers out-of-the-box kvm support fuse implementation freebsd 10.1-release announced 14 november 2014 supported extended term 31 december 2016 subsequent 10.2-release reached eol day october 2017 10.4-release final release branch announced support 10 series terminated october 2018 10 october 2016 freebsd release engineering team announced availability freebsd 11.0-release freebsd 12.0-release announced december 2018 following table presents version release history freebsd operating system timeline shows span single release generation freebsd lasts around 5 years since freebsd project makes effort binary backward limited forward compatibility within release generation allows users 5+ years support trivial-to-easy upgrading within release generation | [
7514,
1824,
732,
3636,
2226,
3986,
5065,
5067,
6477,
7209,
424,
6489,
6149,
6860,
6500,
443,
6505,
1523,
2281,
2644,
6525,
1547,
481,
7637,
2300,
1193,
4059,
8001,
6918,
6211,
4806,
4441,
5865,
8037,
1989,
5884,
4836,
875,
1254,
191,
37... | Validation |
5,761 | 4 | AlgoSec:algosec algosec provider software network security policy management also known firewall policy management algosec products automate management enforcement security policies across firewalls routers virtual private networks vpns related security devices enterprises use algosec products manage configuration security systems identify vulnerabilities test systems security policies reduce administrative costs ensure compliance regulations pci-dss sarbanes-oxley algosec delivers products standalone modules well via integrated suite algosec security management suite includes integration products suite provides two-way link two processes products available software loaded appliance algosec ’ core technology developed 2001 prof. avishai wool team researchers bell laboratories prof wool teamed yuval baron found algosec 2004 time company headquartered reston virginia 2010 algosec moved headquarters north american sales office roswell georgia atlanta area 2012 algosec moved headquarters ridgefield park new jersey today addition boston office algosec sales offices london singapore research development center petah tikva israel london algosec customers include enterprises managed service providers auditors consultants throughout world | [
651,
2914
] | Validation |
5,762 | 3 | ΜClinux:μclinux μclinux variation linux kernel previously maintained fork targets microcontrollers without memory management unit mmu integrated mainline development 2.5.46 project continues develop patches tools microcontrollers homepage lists linux kernel releases 2.0 2.4 2.6 end-of-life mainline letters μc microcontroller name pronounced you-see-linux rather pronouncing letter mu greek μclinux originally created d. jeff dionne kenneth albanowski 1998 initially targeted motorola dragonball family embedded 68k processors specifically 68ez328 series used motorola palmpilot 2.0.33 linux kernel releasing initial work developer community quickly sprang extending work newer kernels microprocessor architectures early 1999 support added motorola freescale coldfire family embedded microprocessors arm processor support added later although originally targeting 2.0 series linux kernels ports based linux 2.4 linux 2.6 linux 2.4 ports forward ported 2.0.36 linux kernel michael leslie evan stawnyczy work rt-control never μclinux extensions applied 2.2 series kernels since version 2.5.46 linux kernel major parts μclinux integrated mainline kernel number processor architectures greg ungerer originally ported μclinux motorola coldfire family processors continues maintain actively push core μclinux support 2.6 series linux kernels regard μclinux essentially longer separate fork linux project continues develop patches supporting tools using linux microcontrollers μclinux support many architectures forms basis many products like network routers security cameras dvd mp3 players voip phone gateways scanners card readers current list includes | [
362,
3256,
2182,
3613,
7528,
7532,
2559,
7537,
5744,
6443,
2942,
6117,
4341,
5762,
412,
415,
3666,
2970,
7956,
5453,
5459,
5460,
7242,
804,
1535,
1924,
6892,
1176,
1933,
5822,
3365,
5829,
7990,
1208,
6211,
4435,
5865,
7669,
3404,
1227,
... | Test |
5,763 | 4 | National_identity_cards_in_the_European_Economic_Area:national identity cards european economic area national identity cards issued citizens governments european union member states except denmark ireland united kingdom also liechtenstein citizens holding national identity card states eea swiss citizenship use identity document within home country also travel document exercise right free movement eea switzerland identity cards state eea swiss citizenship including national identity cards issued residents citizens valid travel document within eea switzerland national identity cards often accepted parts world unofficial identification purposes age verification commercial establishments serve sell alcohol checking hotels sometimes official purposes proof identity/nationality authorities especially machine-readable cards four eea member states issue cards defined eu national identity cards citizens denmark iceland norway united kingdom except residents gibraltar although norway expected start issuing cards 2020 present citizens four countries use passport travel document travelling eea member states switzerland however travelling within schengen area common travel area valid identity documentation driving licence ehic card often sufficient ireland issues passport card valid national identity card eu countries alternative presenting passport eea swiss citizens entitled use valid national identity card travel document exercise right free movement european economic area switzerland strictly speaking necessary eea swiss citizen possess valid national identity card passport enter eea switzerland theory eea swiss citizen outside eea switzerland prove nationality means e.g presenting expired national identity card passport citizenship certificate must permitted enter eea switzerland eea swiss citizen unable demonstrate nationality satisfactorily must nonetheless given 'every reasonable opportunity obtain necessary documents delivered within reasonable period time additionally eea swiss citizens enter number countries territories outside eea switzerland strength national identity cards alone without need present passport border authorities although swedish finnish law allow citizens travel outside eea/switzerland without passport practice meaning direct outbound travel sweden/finland countries id card possible probably including uk brexit deal since change relevant law included swedish law change brexit countries however following accept national id cards eea/swiss citizens short-term visits require passport take residency turkey allows citizens belgium france germany greece italy liechtenstein luxembourg malta netherlands portugal spain switzerland enter short-term visits using national identity card egypt allows citizens belgium france germany italy portugal enter using national identity card short-term visits tunisia allows nationals austria belgium france germany italy luxembourg netherlands portugal spain sweden switzerland enter using national identity card travelling organized tour anguilla dominica saint lucia allow nationals france enter using national id card dominica de facto also allows nationals least germany sweden enter national id card march 2016 gambia allows nationals belgium enter using national id card finally greenland allows nordic citizens enter national id card sweden finland whereas norway introduce 2020 practice eea swiss citizens use id cards passport control takes place arrival greenland airline check-in gate air greenland icelandair accept eea swiss id card although matter european law holders swedish national identity card entitled use travel document european union member state regardless whether belongs schengen area swedish national law recognise card valid travel document outside schengen area july 2015 direct violation european law meant practice leaving schengen directly sweden i.e. without making stopover another schengen country card possible partially changed july 2015 travel non-schengen countries eu others even accept id card permitted similarly finnish citizens leave finland directly non eu/efta country id cards uk border force officials known place extra scrutiny spend longer processing national identity cards issued certain member states deemed limited security features hence susceptible tampering/forgery unlike counterparts schengen area previous legal regime force 7 april 2017 obliged perform 'rapid 'straightforward visual check signs falsification tampering obliged use technical devices – document scanners uv light magnifiers – eea swiss citizens presented passports and/or national identity cards external border checkpoints matter policy ukbf officials required examine physically passports national identity cards presented eea swiss citizens signs forgery tampering addition unlike counterparts schengen area previous legal regime force 7 april 2017 presented passport national identity card eea swiss citizen legally obliged check database lost/stolen/invalidated travel documents – could perform 'rapid 'straightforward database check – could check see traveller database containing persons interest strictly 'non-systematic basis threat 'genuine 'present 'sufficiently serious matter policy ukbf officials required check every eea swiss citizen passport/national identity card warnings index wi database note however effect 7 april 2017 mandatory border officials schengen area check systematic basis travel documents eea swiss citizens crossing external borders relevant databases ref name= reg2017/458 regulation eu 2017/458 european parliament council 15 march 2017 amending regulation eu 2016/399 regards reinforcement checks relevant databases external borders oj l 74 18 march 2017 p.1 /ref reason presented non-machine readable identity card take four times longer ukbf official process card official enter biographical details holder manually computer check wi database large number possible matches returned different configuration entered reduce number possible matches example stansted airport ukbf officials known take longer process italian paper identity cards often need taken plastic wallets particularly susceptible forgery/tampering non-machine readable documents holders biographical details entered manually computer according statistics published frontex 2015 top 6 eu member states whose national identity cards falsified detected external border crossing points schengen area italy spain belgium greece france romania countries remained top 6 2016 varying rules domestic usage identity documents countries demand usage national identity card passport countries allow usage documents like driver licenses countries e.g austria finland sweden national identity cards fully voluntary needed everyone identity documents like driving licences accepted domestically countries minority national identity card since majority passport driving licence n't need identity documents also true ireland passport driving licence less need passport card eea swiss citizens exercising right free movement another eea member state switzerland entitled use national identity card identification document dealing government authorities also private sector service providers example supermarket uk refuses accept german national identity card proof age german citizen attempts purchase age-restricted product insists production uk-issued passport driving licence identity document supermarket would effect discriminating individual basis his/her nationality provision service thereby contravening prohibition art 20 2 directive 2006/123/ec discriminatory treatment relating nationality service recipient conditions access service made available public large service provider 11 june 2014 guardian published leaked internal documents hm passport office uk revealed government officials dealt british passport applications sent overseas treated eu citizen counter-signatories differently depending nationality leaked internal documents showed citizens austria belgium czech republic estonia finland germany hungary latvia lithuania luxembourg malta netherlands poland portugal slovakia slovenia sweden acted counter-signatory support application british passport made someone knew hm passport office would willing accept copy counter-signatory passport national identity card hm passport office considered national identity cards issued citizens member states acceptable taking account 'quality identity card design rigour issuing process relatively low level documented abuse documents uk/schengen borders ability access samples identity cards comparison purposes contrast citizens eu member states bulgaria croatia cyprus france greece italy romania spain acting counter-signatories could submit copy passport national identity card prove identity national identity cards issued member states deemed hm passport office less secure susceptible fraud/forgery day following revelations 12 june 2014 home office hm passport office withdrew leaked internal guidance relating eu citizen counter-signatories submitting copy national identity card instead passport proof identity eu citizen counter-signatories able submit copy passport national identity card 13 july 2005 justice home affairs council called european union member states adopt common designs security features national identity cards december 2005 detailed standards laid soon possible thereafter 4 december 2006 european union member states agreed adopt following common designs minimum security standards national identity cards draft resolution 15 november 2006 card made paper core laminated sides made entirely synthetic substrate data card shall contain least name birth date nationality photo signature card number end date validity cards contain information height eye colour start date validity sex issue place province birth place biographical data card machine readable follow icao specification machine-readable travel documents eu regulation revising schengen borders code entered force 7 april 2017 introduced systematic checks travel documents eu eea swiss citizens relevant databases entering leaving schengen area states member states phase travel documents including national identity cards machine-readable however 2017 greece continues issue solely non-machine readable identity cards italy process phasing issuing non-machine readable paper booklets favour biometric cards eea electronic identity cards comply iso/iec standard 14443 effectively means cards implement electromagnetic coupling card card reader specifications followed capable read proximities less 0.1 metres rfid tags often seen stores attached livestock neither work relatively large distances typically seen us toll booths automated border crossing channels icao specifications adopted nearly european passport booklets basic access control bac means miscreants able read cards unless also physical access card bac authentication keys derive three lines data printed mrz obverse td1 format identity card begins according iso 14443 standard wireless communication card reader start identity card chip transmitted unique identifier theoretically ingenious attacker managed secrete multiple reading devices distributed array eg arrival hall furniture could distinguish bearers mrotds without access relevant chip files concert information attacker might able produce profiles specific particular card consequently bearer defence trivial task electronic cards make new randomised uids every session nh08 preserve level privacy comparable contact cards commercial rfid tags electronic identity cards austria belgium estonia finland germany italy liechtenstein lithuania portugal spain digital signature application upon activation enables bearer authenticate card using confidential pin consequently least theoretically authenticate documents satisfy third party document altered digitally signed application uses registered certificate conjunction public/private key pairs enhanced cards necessarily participate online transactions unknown number national european identity cards issued different functionalities authentication online also additional contact chip containing electronic signature functionality swedish national identity card portugal card emv application removed newer versions 16 january 2016 member states issue variety national identity cards differing technical specifications according differing issuing procedures | [
2216,
2523,
7652
] | Test |
5,764 | 2 | OS/VS2:os/vs2 operating system/virtual storage 2 os/vs2 successor operating system os/360 mvt os/360 family | [
4428,
6213,
7003,
1851,
6957,
1994
] | Train |
5,765 | 4 | Timing_attack:timing attack cryptography timing attack side-channel attack attacker attempts compromise cryptosystem analyzing time taken execute cryptographic algorithms every logical operation computer takes time execute time differ based input precise measurements time operation attacker work backwards input information leak system measurement time takes respond certain queries much information help attacker depends many variables cryptographic system design cpu running system algorithms used assorted implementation details timing attack countermeasures accuracy timing measurements etc timing attacks often overlooked design phase dependent implementation introduced inadvertently compiler optimizations avoidance timing attacks involves design constant-time functions careful testing final executable code timing attack example attack exploits data-dependent behavioral characteristics implementation algorithm rather mathematical properties algorithm many cryptographic algorithms implemented masked proxy way reduces eliminates data dependent timing information consider implementation every call subroutine always returns exactly x seconds x maximum time ever takes execute routine every possible authorized input implementation timing algorithm leaks information data supplied invocation downside approach time used executions becomes worst-case performance function timing attacks practical many cases execution time square-and-multiply algorithm used modular exponentiation depends linearly number 1 bits key number 1 bits alone nearly enough information make finding key easy repeated executions key different inputs used perform statistical correlation analysis timing information recover key completely even passive attacker observed timing measurements often include noise sources network latency disk drive access differences access access error correction techniques used recover transmission errors nevertheless timing attacks practical number encryption algorithms including rsa elgamal digital signature algorithm 2003 boneh brumley demonstrated practical network-based timing attack ssl-enabled web servers based different vulnerability use rsa chinese remainder theorem optimizations actual network distance small experiments attack successfully recovered server private key matter hours demonstration led widespread deployment use blinding techniques ssl implementations context blinding intended remove correlations key encryption time versions unix use relatively expensive implementation crypt library function hashing 8-character password 11-character string older hardware computation took deliberately measurably long time much two three seconds cases login program early versions unix executed crypt function login name recognized system leaked information timing validity login name even password incorrect attacker could exploit leaks first applying brute-force produce list login names known valid attempt gain access combining names large set passwords known frequently used without information validity login names time needed execute approach would increase orders magnitude effectively rendering useless later versions unix fixed leak always executing crypt function regardless login name validity two otherwise securely isolated processes running single system either cache memory virtual memory communicate deliberately causing page faults and/or cache misses one process monitoring resulting changes access times likewise application trusted paging/caching affected branching logic may possible second application determine values data compared branch condition monitoring access time changes extreme examples allow recovery cryptographic key bits 2017 meltdown spectre attacks forced cpu manufacturers including intel amd arm ibm redesign cpus rely timing attacks early 2018 almost every computer system world affected spectre making powerful example timing attack history following visual basic code demonstrates typical insecure string comparison stops testing soon character n't match example comparing abcde abxde return 3 loop iterations function insecurecompare stra string strb string length integer boolean end function comparison following version runs constant-time testing characters using bitwise operations test without conditional jumps function securecompare stra string strb string length integer boolean end function timing attacks easier mount adversary knows internals hardware implementation even cryptographic system use since cryptographic security never depend obscurity either see security obscurity specifically shannon maxim kerckhoffs principle resistance timing attacks either nothing else exemplar purchased reverse engineered timing attacks side-channel attacks may also useful identifying possibly reverse-engineering cryptographic algorithm used device | [
3932,
1811,
4930,
8066,
464,
807,
1353,
2918,
3100,
119,
5484,
7548,
1283,
4877,
6637,
1480,
6029,
6647,
7282,
7200,
4805,
1770,
5327,
6657,
56,
3899,
1587,
7928,
5333,
336,
6763,
6049,
5779,
161,
433,
1320,
4371,
613,
1146,
4917
] | Test |
5,766 | 4 | Joint_Services_Publication_440:joint services publication 440 joint services publication 440 jsp 440 name british 2001 ministry defence 2,400-page restricted security manual detailing requirements units regards areas security physical electronic interpreted media instructions avoiding leaks due hackers journalists foreign spies however small part document publication posted wikileaks 3 october 2009 | [
7815,
3241,
3486
] | Test |
5,767 | 4 | Marshall_Carter:marshall carter marshall sylvester carter september 16 1909 – february 18 1993 lieutenant general united states army 1965 1969 served director national security agency carter born september 16 1909 fort monroe virginia son future brigadier general clifton c. carter graduated united states military academy 1931 took m.s degree massachusetts institute technology 1936 carter served aide general george c. marshall marshall time chief staff united states army secretary state secretary defense carter lieutenant general served deputy director central intelligence april 3 1962 april 28 1965 1965 1969 served director national security agency upon retirement military served president george c. marshall research foundation retiring position 1985 carter inducted military intelligence hall fame portrayed ed lauter film thirteen days 2000 based events occurring cuban missile crisis carter buried arlington national cemetery wife preot nichols carter 1912–1997 | [
4210,
820,
6627,
1278,
3716,
4429,
7917,
5412,
5509,
4988,
2343,
4996,
1701,
4201
] | Test |
5,768 | 1 | Literatura_Latino-Americana_e_do_Caribe_em_Ciências_da_Saúde:literatura latino-americana e caribe em ciências da saúde literatura latino-americana e caribe em ciências da saúde literature health sciences latin america caribbean portuguese language acronym lilacs on-line bibliographic database medicine health sciences maintained latin american caribbean center health sciences information also known bireme located são paulo brazil similar medline developed united states national library medicine contains bibliographic references papers published set scientific medical journals region covered medline | [
2054
] | Test |
5,769 | 9 | RoboLogix:robologix robologix robotics simulator uses physics engine emulate robotics applications advantages using robotics simulation tools robologix save time design robotics applications also increase level safety associated robotic equipment since various scenarios tried tested system activated robologix provides platform teach test run debug programs written using five-axis industrial robot range applications functions applications include pick-and-place palletizing welding painting robologix developed colin simpson john bud skinner primarily intended educational resource used high schools colleges universities provide laboratory simulation industrial robots institutions george brown college use robologix part online robotics distance education program simulation software allows verification robot reaching ability travel ranges collisions type simulation software provides increased level reliability planning process program development well reducing overall completion/commissioning time ability preview behavior robotic system virtual world allows variety mechanisms devices configurations controllers tried tested applied real world system robologix capacity real-time simulation motion industrial robot using geometric modeling kinematics modeling robologix enables programmers write robot programs use sensors video cameras used obtaining desired position robot end effector addition teach pendant control panel included simulator allows user command robot pick tracked object return home location jogged commands pre-programmed positions robologix control panel consists robot control functions well environment control functions conveyor system controls on-off hard-wired control etc control panel allows user command robot pick tracked object return home location jogged commands pre-programmed positions robotic systems general angular position movements commonly used large course motion linear position movements often used smaller fine increments several command instructions control panel reset home setup zero used automatically set robot specific position calibration realignment robologix provides 12 viewpoints camera angles given robot work envelope viewpoints accessed twelve cam keys allow viewing variety angles perspectives using camera viewpoints user move around 3d animated environment much way would real-world one camera views robot end effector allows real-time visualization positioning end effector gripper approaches workpiece like robot programming languages robologix programs consist data objects program flow data objects reside registers program flow represents list instructions instruction set used program robot robologix program language type scripting language used control software application programming languages generally designed building data structures algorithms scratch scripting languages intended connecting gluing components instructions together consequently robologix instruction set streamlined list program commands used simplify programming process provide rapid application development robologix instruction set contains 16 commands usually written program line-by-line basis commands used instruct robot perform tasks moving specific location picking object executing subroutine waiting etc one popular commands instruction set instruction compares numerical values located two registers register value greater less greater than/equal less than/equal equal equal another register execute next line program condition true command often used jmp lbl instruction control program execution instruction set information stored registers data locations capable holding variable numeric values two main types registers used robologix position registers variable registers position registers contain linear angular data point coordinates include axis joint information a1 a2 a3 etc x z linear cartesian coordinates also 32 variable registers used holding instruction set data position comparisons time-delay information addition position registers variable registers robot software programs also palletizing registers used manage position stack point palletizing applications palletizing one popular applications robots accomplished combining series commands palletizing routine robologix palletizing routine consists five program instructions lines first instruction palletize instruction followed linear motion instruction move stack point stack point top-center workpiece group stack points forms stacking pattern shown adjacent image first stack point stacking pattern located 1,1,1 row column layer incremented time palletizing routine executed | [
4759,
5571,
3378
] | Test |
5,770 | 8 | Toonimo:toonimo toonimo web-based solution offers on-site user assistance via online walkthroughs toonimo cloud-based digital walkthrough platform helps guide users website funnels toonimo works overlaying human voice audio graphical coachmarks web pages guide orient web users features include analytics dashboard a/b testing functionality personalization suite company serves financial insurance healthcare telecommunication education travel hospitality industries b2b b2b2c situations toonimo founded 2013 dan kotlicki ceo headquarters 1216 broadway new york city ny additional office located tel aviv israel july 14 2014 toonimo announced raised 2.5 million funding continue r ramp marketing sales efforts additional 1 million raised venture investment december 20 2014 toonimo backed lightspeed venture partners real life innovations several private investors | [] | Test |
5,771 | 2 | Android_Runtime:android runtime android runtime art application runtime environment used android operating system replacing dalvik process virtual machine originally used android art performs translation application bytecode native instructions later executed device runtime environment android 2.2 froyo brought trace-based just-in-time jit compilation dalvik optimizing execution applications continually profiling applications time run dynamically compiling frequently executed short segments bytecode native machine code dalvik interprets rest application bytecode native execution short bytecode segments called traces provides significant performance improvements unlike dalvik art introduces use ahead-of-time aot compilation compiling entire applications native machine code upon installation eliminating dalvik interpretation trace-based jit compilation art improves overall execution efficiency reduces power consumption results improved battery autonomy mobile devices time art brings faster execution applications improved memory allocation garbage collection gc mechanisms new applications debugging features accurate high-level profiling applications maintain backward compatibility art uses input bytecode dalvik supplied standard .dex files part apk files .odex files replaced executable linkable format elf executables application compiled using art on-device utility run solely compiled elf executable result art eliminates various application execution overheads associated dalvik interpretation trace-based jit compilation downside art requires additional time compilation application installed applications take slightly larger amounts secondary storage usually flash memory store compiled code android 4.4 kitkat brought technology preview art including alternative runtime environment keeping dalvik default virtual machine subsequent major android release android 5.0 lollipop dalvik entirely replaced art android 7.0 nougat introduced jit compiler code profiling art lets constantly improve performance android apps run jit compiler complements art current ahead time compiler helps improve runtime performance | [
3933,
5372,
6427,
3623,
1095,
740,
4340,
42,
3310,
2591,
5775,
7956,
1522,
5473,
474,
6183,
822,
136,
6209,
6567,
6937,
6232,
1990,
5190,
1616,
4116,
5195,
2003,
195,
6978,
6982,
561,
7346,
201,
2017,
5218,
5919,
7357,
572,
5571,
2398,
... | Test |
5,772 | 3 | HP_Neoview:hp neoview hp neoview data warehouse business intelligence computer server line based hewlett packard nonstop line acted database server providing nonstop os nonstop sql lacked transaction processing functionality original nonstop systems line retired longer marketed january 24 2011 | [
5735,
1112,
4195,
7341,
3951
] | Test |
5,773 | 4 | Pretty_Good_Privacy:pretty good privacy pretty good privacy pgp encryption program provides cryptographic privacy authentication data communication pgp used signing encrypting decrypting texts e-mails files directories whole disk partitions increase security e-mail communications phil zimmermann developed pgp 1991 pgp similar software follow openpgp standard nowiki rfc 4880 /nowiki encrypting decrypting data pgp encryption uses serial combination hashing data compression symmetric-key cryptography finally public-key cryptography step uses one several supported algorithms public key bound username e-mail address first version system generally known web trust contrast x.509 system uses hierarchical approach based certificate authority added pgp implementations later current versions pgp encryption include options automated key management server public key fingerprint shorter version public key fingerprint someone get right corresponding public key fingerprint like c3a6 5e46 7b54 77df 3c4c 9790 4d22 b3ca 5b32 ff66 printed business card pgp evolves versions support newer features algorithms able create encrypted messages older pgp systems decrypt even valid private key therefore essential partners pgp communication understand capabilities least agree pgp settings pgp used send messages confidentially pgp uses hybrid cryptosystem combining symmetric-key encryption public-key encryption message encrypted using symmetric encryption algorithm requires symmetric key generated sender symmetric key used also called session key message session key sent receiver session key must sent receiver know decrypt message protect transmission encrypted receiver public key private key belonging receiver decrypt session key use symmetrically decrypt message pgp supports message authentication integrity checking latter used detect whether message altered since completed message integrity property former determine whether actually sent person entity claimed sender digital signature content encrypted changes message result failure decryption appropriate key sender uses pgp create digital signature message either rsa dsa algorithms pgp computes hash also called message digest plaintext creates digital signature hash using sender private key encrypting messages verifying signatures critical public key used send messages someone entity actually 'belong intended recipient simply downloading public key somewhere reliable assurance association deliberate accidental impersonation possible first version pgp always included provisions distributing users public keys 'identity certification also constructed cryptographically tampering accidental garble readily detectable however merely making certificate impossible modify without detected insufficient prevent corruption certificate created users must also ensure means public key certificate actually belong person entity claiming given public key specifically information binding user name key may digitally signed third party user attest association someone actually user name key several levels confidence included signatures although many programs read write information include level certification calculating whether trust key web trust protocol first described phil zimmermann 1992 manual pgp version 2.0 web trust mechanism advantages centrally managed public key infrastructure scheme used s/mime universally used users willing accept certificates check validity manually simply accept satisfactory solution found underlying problem recent openpgp specification trust signatures used support creation certificate authorities trust signature indicates key belongs claimed owner owner key trustworthy sign keys one level level 0 signature comparable web trust signature since validity key certified level 1 signature similar trust one certificate authority key signed level 1 able issue unlimited number level 0 signatures level 2 signature highly analogous trust assumption users must rely whenever use default certificate authority list like included web browsers allows owner key make keys certificate authorities pgp versions always included way cancel 'revoke identity certificates lost compromised private key require communication security retained user less equivalent certificate revocation lists centralised pki schemes recent pgp versions also supported certificate expiration dates problem correctly identifying public key belonging particular user unique pgp public key/private key cryptosystems problem even slightly different guises fully satisfactory solution known pgp original scheme least leaves decision whether use endorsement/vetting system user pki schemes requiring instead every certificate attested central certificate authority accepted correct best publicly available information known method allow person group break pgp encryption cryptographic computational means indeed 1995 cryptographer bruce schneier characterized early version closest 're likely get military-grade encryption early versions pgp found theoretical vulnerabilities current versions recommended addition protecting data transit network pgp encryption also used protect data long-term data storage disk files long-term storage options also known data rest i.e data stored transit cryptographic security pgp encryption depends assumption algorithms used unbreakable direct cryptanalysis current equipment techniques original version rsa algorithm used encrypt session keys rsa security depends upon one-way function nature mathematical integer factoring similarly symmetric key algorithm used pgp version 2 idea might point future found previously undetected cryptanalytic flaws specific instances current pgp idea insecurities exist publicly known current versions pgp added additional encryption algorithms cryptographic vulnerability varies algorithm used however none algorithms current use publicly known cryptanalytic weaknesses new versions pgp released periodically vulnerabilities fixed developers come light agency wanting read pgp messages would probably use easier means standard cryptanalysis e.g rubber-hose cryptanalysis black-bag cryptanalysis e.g installing form trojan horse keystroke logging software/hardware target computer capture encrypted keyrings passwords fbi already used attack pgp investigations however vulnerabilities apply pgp conventional encryption software 2003 incident involving seized psion pdas belonging members red brigade indicated neither italian police fbi able decrypt pgp-encrypted files stored second incident december 2006 see boucher involving us customs agents seized laptop pc allegedly contained child pornography indicates us government agencies find nearly impossible access pgp-encrypted files additionally magistrate judge ruling case november 2007 stated forcing suspect reveal pgp passphrase would violate fifth amendment rights i.e suspect constitutional right incriminate fifth amendment issue opened government appealed case federal district judge ordered defendant provide key evidence suggests 2007 british police investigators unable break pgp instead resorted using ripa legislation demand passwords/keys november 2009 british citizen convicted ripa legislation jailed nine months refusing provide police investigators encryption keys pgp-encrypted files pgp cryptosystem criticized complexity standard implementation low usability user interface including recognized figures cryptography research standard developed 90 uses ineffective serialization format storage keys encrypted data resulted signature-spamming attacks public keys prominent developers gnu privacy guard backwards compatibility openpgp standard results usage relatively weak default choice cryptographic primitives cast5 cipher cfb mode s2k password hashing standard also criticized leaking metadata usage long-term keys lack forward secrecy popular end-user implementations suffered various signature-striping cipher downgrade metadata leakage vulnerabilities attributed complexity standard phil zimmermann created first version pgp encryption 1991 name pretty good privacy inspired name grocery store ralph pretty good grocery featured radio host garrison keillor fictional town lake wobegon first version included symmetric-key algorithm zimmermann designed named bassomatic saturday night live sketch zimmermann long-time anti-nuclear activist created pgp encryption similarly inclined people might securely use bbss securely store messages files license required non-commercial use even nominal charge complete source code included copies posting june 5 2001 entitled pgp marks 10th anniversary zimmermann describes circumstances surrounding release pgp pgp found way onto internet rapidly acquired considerable following around world users supporters included dissidents totalitarian countries affecting letters zimmermann published included testimony us congress civil libertarians parts world see zimmermann published testimony various hearings 'free communications activists called cypherpunks provided publicity distribution decades later cryptoparty activists much via twitter shortly release pgp encryption found way outside united states february 1993 zimmermann became formal target criminal investigation us government munitions export without license cryptosystems using keys larger 40 bits considered munitions within definition us export regulations pgp never used keys smaller 128 bits qualified time penalties violation found guilty substantial several years investigation zimmermann closed without filing criminal charges anyone else zimmermann challenged regulations imaginative way published entire source code pgp hardback book via mit press distributed sold widely anybody wishing build copy pgp could cut covers separate pages scan using ocr program conceivably enter type-in program ocr software available creating set source code text files one could build application using freely available gnu compiler collection pgp would thus available anywhere world claimed principle simple export munitions —guns bombs planes software—was remains restricted export books protected first amendment question never tested court respect pgp cases addressing encryption software however two federal appeals courts established rule cryptographic software source code speech protected first amendment ninth circuit court appeals bernstein case sixth circuit court appeals junger case us export regulations regarding cryptography remain force liberalized substantially throughout late 1990s since 2000 compliance regulations also much easier pgp encryption longer meets definition non-exportable weapon exported internationally except seven specific countries list named groups individuals substantially us trade prohibited various us export controls turmoil zimmermann team worked new version pgp encryption called pgp 3 new version considerable security improvements including new certificate structure fixed small security flaws pgp 2.x certificates well permitting certificate include separate keys signing encryption furthermore experience patent export problems led eschew patents entirely pgp 3 introduced use cast-128 a.k.a cast5 symmetric key algorithm dsa elgamal asymmetric key algorithms unencumbered patents federal criminal investigation ended 1996 zimmermann team started company produce new versions pgp encryption merged viacrypt zimmermann sold commercial rights licensed rsa directly rsadsi changed name pgp incorporated newly combined viacrypt/pgp team started work new versions pgp encryption based pgp 3 system unlike pgp 2 exclusively command line program pgp 3 designed start software library allowing users work command line inside gui environment original agreement viacrypt zimmermann team viacrypt would even-numbered versions zimmermann odd-numbered versions viacrypt thus created new version based pgp 2 called pgp 4 remove confusion could pgp 3 successor pgp 4 pgp 3 renamed released pgp 5 may 1997 december 1997 pgp inc. acquired network associates inc. nai zimmermann pgp team became nai employees nai first company legal export strategy publishing source code nai pgp team added disk encryption desktop firewalls intrusion detection ipsec vpns pgp family export regulation liberalizations 2000 longer required publishing source nai stopped releasing source code early 2001 zimmermann left nai served chief cryptographer hush communications provide openpgp-based e-mail service hushmail also worked veridis companies october 2001 nai announced pgp assets sale suspending development pgp encryption remaining asset kept pgp e-business server original pgp commandline version february 2002 nai canceled support pgp products exception renamed commandline product nai formerly mcafee intel security mcafee continued sell support product name mcafee e-business server 2013 august 2002 several ex-pgp team members formed new company pgp corporation bought pgp assets except command line version nai new company funded rob theis doll capital management dcm terry garnett venrock associates pgp corporation supports existing pgp users honors nai support contracts zimmermann serves special advisor consultant pgp corporation well continuing run consulting company 2003 pgp corporation created new server-based product called pgp universal mid-2004 pgp corporation shipped command line version called pgp command line integrates pgp encryption platform applications 2005 pgp corporation made first acquisition—the german software company glück kanja technology ag pgp deutschland ag 2010 pgp corporation acquired hamburg-based certificate authority tc trustcenter parent company chosensecurity form pgp trustcenter division since 2002 purchase nai pgp assets pgp corporation offered worldwide pgp technical support offices draper utah offenbach germany tokyo japan april 29 2010 symantec corp. announced would acquire pgp 300 million intent integrating enterprise security group acquisition finalized announced public june 7 2010 source code pgp desktop 10 available peer review also 2010 intel corporation acquired mcafee 2013 mcafee e-business server transferred software diversified services sells supports develops name sds e-business server enterprise townsend security currently offers commercial version pgp ibm ibm z mainframe platforms townsend security partnered network associates 2000 create compatible version pgp ibm platform townsend security ported pgp 2008 time ibm z mainframe version pgp relies free z/os encryption facility utilizes hardware acceleration software diversified services also offers commercial version pgp sds e-business server ibm z mainframe may 2018 bug named efail discovered certain implementations pgp could reveal plaintext contents emails encrypted 2003 originally used primarily encrypting contents e-mail messages attachments desktop client pgp products diversified since 2002 set encryption applications managed optional central policy server pgp encryption applications include e-mail attachments digital signatures laptop full disk encryption file folder security protection im sessions batch file transfer encryption protection files folders stored network servers recently encrypted signed http request/responses means client-side enigform server-side mod openpgp module also wordpress plugin available called wp-enigform-authentication takes advantage session management features enigform mod_openpgp pgp desktop 9.x family includes pgp desktop email pgp whole disk encryption pgp netshare additionally number desktop bundles also available depending application products feature desktop e-mail digital signatures im security whole disk encryption file folder security encrypted self-extracting archives secure shredding deleted files capabilities licensed different ways depending features required pgp universal server 2.x management console handles centralized deployment security policy policy enforcement key management reporting used automated e-mail encryption gateway manages pgp desktop 9.x clients addition local keyserver pgp universal server works pgp public keyserver—called pgp global directory—to find recipient keys capability delivering e-mail securely recipient key found via secure https browser session pgp desktop 9.x managed pgp universal server 2.x first released 2005 pgp encryption applications based new proxy-based architecture newer versions pgp software eliminate use e-mail plug-ins insulate user changes desktop applications desktop server operations based security policies operate automated fashion pgp universal server automates creation management expiration keys sharing keys among pgp encryption applications symantec pgp platform undergone rename pgp desktop known symantec encryption desktop pgp universal server known symantec encryption management server current shipping versions symantec encryption desktop 10.3.0 windows mac os platforms symantec encryption server 3.3.2 also available pgp command line enables command line-based encryption signing information storage transfer backup well pgp support package blackberry enables rim blackberry devices enjoy sender-to-recipient messaging encryption new versions pgp applications use openpgp s/mime allowing communications user nist specified standard inside pgp inc. still concern patent issues rsadsi challenging continuation viacrypt rsa license newly merged firm company adopted informal internal standard called unencumbered pgp would use algorithm licensing difficulties pgp encryption importance worldwide many wanted write software would interoperate pgp 5 zimmermann became convinced open standard pgp encryption critical cryptographic community whole july 1997 pgp inc. proposed ietf standard called openpgp gave ietf permission use name openpgp describe new standard well program supported standard ietf accepted proposal started openpgp working group openpgp internet standards track active development many e-mail clients provide openpgp-compliant email security described rfc 3156 current specification rfc 4880 november 2007 successor rfc 2440 rfc 4880 specifies suite required algorithms consisting elgamal encryption dsa triple des sha-1 addition algorithms standard recommends rsa described pkcs 1 v1.5 encryption signing well aes-128 cast-128 idea beyond many algorithms supported standard extended support camellia cipher rfc 5581 2009 signing key exchange based elliptic curve cryptography ecc i.e ecdsa ecdh rfc 6637 2012 support ecc encryption added proposed rfc 4880bis 2014 free software foundation developed openpgp-compliant program called gnu privacy guard abbreviated gnupg gpg gnupg freely available together source code gnu general public license gpl maintained separately several graphical user interfaces guis interact gnupg library encryption decryption signing functions see kgpg seahorse macgpg several vendors also developed openpgp-compliant software development open source openpgp-compliant library openpgp.js written javascript allowed web-based applications use pgp encryption web browser several ios android openpgp-compliant applications ipgmail ios openkeychain android enable key generation encryption/decryption email files apple ios google android operating systems openpgp encryption ensure secure delivery files messages well provide verification created sent message using process called digital signing open source office suite libreoffice implemented document signing openpgp version 5.4.0 linux using openpgp communication requires participation sender recipient openpgp also used secure sensitive files 're stored vulnerable places like mobile devices cloud advancement cryptography parts pgp criticized dated october 2017 roca vulnerability announced affects rsa keys generated buggy infineon firmware used yubikey 4 tokens often used pgp many published pgp keys found susceptible yubico offers free replacement affected tokens | [
363,
5722,
6795,
5029,
7173,
1460,
3277,
2566,
3638,
1480,
743,
6458,
7567,
2239,
1130,
7214,
6487,
5440,
4014,
7597,
5806,
3350,
1528,
5808,
4035,
7975,
6894,
2644,
7258,
5488,
1559,
4056,
496,
7282,
2691,
4089,
6582,
1986,
177,
6962,
... | Validation |
5,774 | 0 | Interactive_Terminology_for_Europe:interactive terminology europe interactive terminology europe iate interinstitutional terminology database european union project launched 1999 objective creating web-based interface eu terminology resources make information easily available ensure standardisation throughout eu institutions used eu institutions agencies since summer 2004 public user interface released testing early 2007 officially opened 28 june 2007 new version released 7 november 2018 following full rebuild system state-of-the-art technologies latest software development standards best practices usability accessibility new look feel iate incorporated existing terminology databases eu ’ translation services one interinstitutional database containing approximately 1.4 million multilingual entries following legacy databases imported iate iate intended contain single entry per concept actually contains multiple entries many concepts entries consolidated number entries fallen approximately 1.4 million approximately 1.2 million despite addition many new entries new previously unrecorded concepts project partners european commission european parliament council european union european court justice european court auditors european economic social committee european committee regions european central bank european investment bank translation centre bodies european union iate web site administered eu translation centre luxembourg behalf project partners subject 'domains based eurovoc entire iate glossary database downloaded free zipped format multilanguage glossaries generated using free tool | [] | Test |
5,775 | 2 | Android_Gingerbread:android gingerbread android gingerbread seventh version android codename android mobile operating system developed google released december 2010 versions longer supported gingerbread release introduced support near field communication nfc —used mobile payment solutions—and session initiation protocol sip —used voip internet telephony gingerbread user interface refined many ways making easier master faster use power-efficient simplified color scheme black background gave vividness contrast notification bar menus user interface components improvements menus settings resulted easier navigation system control nexus smartphone released december 2010 first phone google nexus line ran gingerbread also first one line built-in nfc functionality statistics issued google indicate 0.3 android devices accessing google play run gingerbread new features introduced gingerbread include following | [
3933,
5372,
2196,
6427,
7170,
1095,
740,
4340,
42,
3309,
3310,
7924,
2591,
5771,
6132,
6153,
4375,
7956,
5455,
6176,
5473,
474,
6183,
822,
831,
5141,
1202,
136,
2317,
2673,
6209,
1581,
1582,
2683,
855,
6937,
168,
6232,
6950,
174,
2712,
... | Test |
5,776 | 4 | Attack_model:attack model cryptanalysis attack models attack types classification cryptographic attacks specifying kind access cryptanalyst system attack attempting break encrypted message also known ciphertext generated system greater access cryptanalyst system useful information get utilize breaking cypher cryptography sending party uses cipher encrypt transform secret plaintext ciphertext sent insecure communication channel receiving party receiving party uses inverse cipher decrypt ciphertext obtain plaintext secret knowledge required apply inverse cipher ciphertext secret knowledge usually short number string called key cryptographic attack third party cryptanalyst analyzes ciphertext try break cipher read plaintext obtain key future enciphered messages read usually assumed encryption decryption algorithms public knowledge available cryptographer case modern ciphers published openly assumption called kerckhoffs principle common attack models different attack models used cryptographic primitives generally kind security systems examples attack models | [
6049,
6372,
3100,
7862,
2566,
7771,
125,
1353,
7207
] | Test |
5,777 | 5 | Run-length_limited:run-length limited run-length limited rll coding line coding technique used send arbitrary data communications channel bandwidth limits rll codes defined four main parameters n k first two n refer rate code remaining two specify minimal maximal k number zeroes consecutive ones used telecommunication storage systems move medium past fixed recording head specifically rll bounds length stretches runs repeated bits signal change runs long clock recovery difficult short high frequencies might attenuated communications channel modulating data rll reduces timing uncertainty decoding stored data would lead possible erroneous insertion removal bits reading data back mechanism ensures boundaries bits always accurately found preventing bit slip efficiently using media reliably store maximal amount data given space early disk drives used simple encoding schemes rll 0,1 fm code followed rll 1,3 mfm code widely used hard disk drives mid-1980s still used digital optical discs cd dvd md hi-md blu-ray higher density rll 2,7 rll 1,7 codes became de facto industry standard hard disks early 1990s hard disk drive information represented changes direction magnetic field disk magnetic media playback output proportional density flux transition computer information represented voltage wire voltage wire relation defined ground level would binary zero positive voltage wire relation ground represents binary one magnetic media hand always carries magnetic flux either north pole south pole order convert magnetic fields binary data encoding method must used translate two one simplest practical codes modified non-return-to-zero-inverted nrzi simply encodes 1 magnetic polarity transition also known flux reversal zero transition disk spinning constant rate bit given equal time period data window magnetic signal represents bit flux reversal occurs start window note older hard disks used one fixed length time data window whole disk modern disks complicated see zoned bit recording method quite simple playback output proportional density ones long run zeros means playback output simple example consider binary pattern 101 data window 1 ns one nanosecond one billionth second stored disk change followed change another change preceding magnetic polarity already positive resulting pattern might look like −−+ value 255 binary ones would written −+−+−+−+ +−+−+−+− zero byte would written ++++++++ −−−−−−−− 512 byte sector zeros would written 4,096 sequential bits polarity since disk drive physical piece hardware rotational speed drive change slightly due change motor speed thermal expansion disk platter physical media floppy disk also become deformed causing larger timing errors timing circuit controller may small variations speed problem long string zeros way disk drive controller know exact position read head thus way know exactly many zeros speed variation even 0.1 precise practical floppy drive could result four bits added removed 4,096 bit data stream without form synchronization error correction data would become completely unusable problem due limits magnetic media possible write many polarity changes certain amount space upper limit many 1 also written sequentially depends linear velocity head gap prevent problem data coded way long repetitions single binary value occur limiting number zeros written consecutively makes possible drive controller stay sync limiting number 1 written row overall frequency polarity changes reduced allowing drive store data amount space resulting either smaller package amount data storage size package codes used record magnetic disks limited length transition-free runs therefore characterized rll codes earliest simplest variants given specific names modified frequency modulation mfm name rll commonly used complex variants given specific names term technically applies first rll code used hard drives rll 2,7 developed ibm engineers first used commercially 1979 ibm 3370 dasd use 4300 series mainframe late 1980s pc hard disks began using rll proper i.e variants complex received proper names mfm rll codes found almost universal application optical disc recording practice since 1980 consumer electronics rlls like efm code rate=8/17 d=2 k=10 employed compact disc cd minidisc md efmplus code rate=8/16 d=2 k=10 used dvd parameters k minimum maximum allowed run-lengths coverage storage technologies references cited article useful generally run-length number bits signal remains unchanged run-length 3 bit 1 represents sequence '111 instance pattern magnetic polarizations disk might '+−−−−++−−−++++++ runs length 1 4 2 3 6 however run length limited coding terminology assumes nrzi encoding 1 bits indicate changes 0 bits indicate absence change sequence would expressed '11000101001000001 runs zero bits counted somewhat confusingly run length number zeros 0 3 1 2 5 preceding adjacent ones one less number bit times signal actually remains unchanged run length limited sequences characterized two parameters k stipulate minimum maximum zero-bit run length occur sequence rll codes generally specified k rll e.g 1,3 rll encoded format 1 bit indicates flux transition 0 indicates magnetic field disk change time interval generally term rll code used refer elaborate encodings original frequency modulation code also called differential manchester encoding seen simple rate-1/2 rll code added 1 bits referred clock bits example extending maximum run length 2 adjacent 0 bits data rate improved 4/5 original ibm group coded recording variant possible eleven 16 codes bit pattern codice_1 encoded prefixing complement codice_1 five cases would violate one rules codice_3 codice_4 code beginning 11 substituted codice_5 e ∨ example note meet definition 0,2 rll sufficient 5-bit code contain two consecutive zeros also necessary pair 5-bit codes combined sequentially contain two consecutive zeros must two zeros last one bit first code first one bit second code two arbitrarily chosen codes required rll code run length limits—0 2 case—apply overall modulated bitstream components represent discrete sequences plain data bits rule must hold arbitrary pair codes without exception input data may arbitrary sequence bits ibm gcr code meets condition since maximum run length zeros beginning 5-bit code one likewise maximum run length end code one making total run length two junction adjacent codes example maximum run length occurring codes seen example given code data 0010 ends zero code next data 1101 begins zero forming run two zeros junction two 5-bit codes modified frequency modulation begins get interesting special properties allow bits written magnetic medium twice density arbitrary bit stream limit close time flux transitions reading equipment detect constrains closely bits recorded medium worst case arbitrary bit stream two consecutive 1 produces two consecutive flux transitions time bits must spaced far enough apart would sufficient time flux transitions reader detect code imposes constraint =1 i.e minimum one 0 two 1 means worst case flux transitions two bit times apart bits twice close together arbitrary bit stream without exceeding reader capabilities doubled recording density compensates 1/2 coding rate code takes two bits represent one bit real information makes equivalent rate-1 code x complement previous encoded bit also previous data bit except clock bits—that x bit 0 01 code—this fm table code gets name inserted clock bits 0 except two 0 data bits example 1,7 rll maps 2 bits data onto three bits disk encoding done two four bit groups encoding rules x becomes x x except x 0 0 becomes x x 0 0 0 encoding according table longest last table match must used exceptions handle situations applying earlier rules would lead violation code constraints example 2,7 rll rate- code mapping n bits data onto 2 n bits disk like mfm minimum run length 50 longer three bit times instead two bits written faster achieving 50 higher effective data density encoding done two three four bit groups western digital wd5010a wd5011a wd50c12 seagate st11r ibm encoded forms begin four end three zero bits giving maximum run length seven example also alternate 1,7 rll encoding sometimes used avoid dc bias helps sending signal long distance types recording media x complement previous encoded bit i.e 1 previous bit 0 0 previous bit 1 example hhh 1,13 code rate-2/3 code developed three ibm researchers hirt hassner heise use 16 mb/s irda vfir physical layer unlike magnetic encoding designed infrared transmitter 0 bit represents 1 bit represents 1 bits consume power transmit designed limit density 1 bits less 50 particular 1,13|5 rll code final 5 indicates additional constraint 5 consecutive 10 bit pairs first eight rows describe standard 1,7 -rll code additional six exceptions increase maximum run zeros 13 legal pattern 100 000 000 000 001 represents 10 11 10 11 followed 01 limit maximum average ones density longest run 1–0 pairs 000 101 010 101 000 code limits ones density average 25.8 example let us encode bit sequence 10110010 different encodings suppose magnetic tape contain 3,200 flux reversals per inch modified frequency modulation 1,3 rll encoding stores data bit two bits tape since guaranteed one 0 non flux reversal bit 1 flux reversal bits possible store 6,400 encoded bits per inch tape 3,200 data bits per inch 1,7 rll encoding also store 6,400 encoded bits per inch tape since takes 3 encoded bits store 2 data bits 4,267 data bits per inch 2,7 rll encoding takes 2 encoded bits store data bit since guaranteed two 0 bits 1 bits possible store 9,600 encoded bits per inch tape 4,800 data bits per inch flux reversal densities hard drives significantly greater improvements storage density seen using different encoding systems | [
5175,
2114,
1508,
4277,
2099
] | Test |
5,778 | 1 | Entity–attribute–value_model:entity–attribute–value model entity–attribute–value model eav data model encode space-efficient manner entities number attributes properties parameters used describe potentially vast number actually apply given entity relatively modest entities correspond mathematical notion sparse matrix eav also known object–attribute–value model vertical database model open schema data representation analogous space-efficient methods storing sparse matrix non-empty values stored eav data model attribute-value pair fact describing entity row eav table stores single fact eav tables often described long skinny long refers number rows skinny columns data recorded three columns consider one would try represent general-purpose clinical record relational database clearly creating table set tables thousands columns feasible vast majority columns would null complicate things longitudinal medical record follows patient time may multiple values parameter height weight child example change child grows finally universe clinical findings keeps growing example diseases emerge new lab tests devised would require constant addition columns constant revision user interface situation list attributes changes frequently termed attribute volatility database parlance following shows snapshot eav table clinical findings visit doctor fever morning 1/5/98 entries shown within angle brackets references entries tables shown text rather encoded foreign key values ease understanding example values literal values could also pre-defined value lists latter particularly useful possible values known limited i.e. enumerable example illustrates symptoms findings might seen patient pneumonia eav data described comparable contents supermarket sales receipt would reflected sales line items table database receipt lists details items actually purchased instead listing every product shop customer might purchased n't like clinical findings given patient sales receipt sparse row modeling facts something case sales transaction recorded multiple rows rather multiple columns standard data modeling technique differences row modeling eav may considered generalization row-modeling clinical data repository row modeling also finds numerous uses laboratory test subschema typically modeled way lab test results typically numeric encoded numerically circumstances would need go beyond standard row-modeling eav listed situation arises ontology-modeling environments categories classes must often created fly classes often eliminated subsequent cycles prototyping certain hybrid classes attributes non-sparse present instances attributes highly variable sparse latter suitable eav modeling example descriptions products made conglomerate corporation depend product category e.g. attributes necessary describe brand light bulb quite different required describe medical imaging device common attributes packaging unit per-item cost clinical data entity typically clinical event described general-purpose settings entity foreign key objects table records common information every object thing database – minimum preferred name brief description well category/class entity belongs every record object table assigned machine-generated object id objects table approach pioneered tom slezak colleagues lawrence livermore laboratories chromosome 19 database standard large bioinformatics databases use objects table mandate concurrent use eav design conventional tables used store category-specific details object major benefit central objects table supporting table object synonyms keywords one provide standard google-like search mechanism across entire system user find information object interest without first specify category belongs important bioscience systems keyword like acetylcholine could refer either molecule neurotransmitter biological receptor binds eav table attribute id foreign key attribute definitions table stated however usually multiple metadata tables contain attribute-related information discussed shortly coercing values strings eav data example results simple non-scalable structure constant data type inter-conversions required one wants anything values index value column eav table essentially useless also convenient store large binary data images base64 encoded form table small integers strings therefore larger systems use separate eav tables data type including binary large objects blobs metadata given attribute identifying eav table data stored approach actually quite efficient modest amount attribute metadata given class form user chooses work cached readily memory however requires moving data one table another attribute ’ data type changed happen often mistakes made metadata definition database schema design eav general-purpose means knowledge representation originated concept association lists attribute-value pairs commonly used today first introduced language lisp attribute-value pairs widely used diverse applications configuration files using simple syntax like attribute value example non-database use eav uima uniform information management architecture standard managed apache foundation employed areas natural language processing software analyses text typically marks annotates segment example provided uima tutorial program performs named-entity recognition ner document annotating text segment president bush annotation-attribute-value triple person full_name george w. bush annotations may stored database table eav direct connection av-pairs stead hammond appear first conceived use persistent storage arbitrarily complex data first medical record systems employ eav regenstrief electronic medical record effort led clement macdonald william stead ed hammond tmr medical record system help clinical data repository cdr created homer warner group lds hospital salt lake city utah regenstrief system actually used patient-attribute-timestamp-value design use timestamp supported retrieval values given patient/attribute chronological order systems developed 1970s released commercial systems based e.f. codd relational database model available though help much later ported relational architecture commercialized 3m corporation note codd landmark paper published 1970 heavily mathematical tone unfortunate effect diminishing accessibility among non-computer-science types consequently delaying model acceptance software-vendor circles value subsequent contribution christopher j date codd colleague ibm translating ideas accessible language accompanied simple examples illustrated power overestimated group columbia-presbyterian medical center first use relational database engine foundation eav system open-source trialdb clinical study data management system nadkarni et al first use multiple eav tables one dbms data type eav/cr framework designed primarily luis marenco prakash nadkarni overlaid principles object orientation onto eav built tom slezak object table approach described earlier entity section senselab publicly accessible neuroscience database built eav/cr framework additionally numerous commercial applications use aspects eav internally including oracle designer applied er modeling kalido applied data warehousing master data management lazysoft sentences applied custom software development eav system sit top tabular structure instead directly b tree infinitydb eliminates need one table per value data type term eav database refers database design significant proportion data modeled eav however even database described eav-based tables system traditional relational tables noted eav modeling makes sense categories data clinical findings attributes numerous sparse conditions hold standard relational modeling i.e. one column per attribute preferable using eav mean abandoning common sense principles good relational design clinical record systems subschemas dealing patient demographics billing typically modeled conventionally vendor database schemas proprietary vista system used throughout united states department veterans affairs va medical system known veterans health administration vha open-source schema readily inspectable though uses mumps database engine rather relational database discussed shortly eav database essentially unmaintainable without numerous supporting tables contain supporting metadata metadata tables typically outnumber eav tables factor least three typically standard relational tables example metadata table attribute definitions table mentioned simple eav design values attribute simple primitive data types far database engine concerned however eav systems used representation highly diverse data possible given object class instance may substructure attributes may represent kinds objects turn may substructure arbitrary level complexity car example engine transmission etc. engine components cylinders permissible substructure given class defined within system attribute metadata discussed later thus example attribute random-access-memory could apply class computer class engine represent substructure one incorporates special eav table value column contains references entities system i.e. foreign key values objects table get information given object requires recursive traversal metadata followed recursive traversal data stops every attribute retrieved simple atomic recursive traversal necessary whether details individual class represented conventional eav form traversal performed standard object–relational systems example practice number levels recursion tends relatively modest classes performance penalties due recursion modest especially indexing object ids eav/cr eav classes relationships refers framework supports complex substructure name somewhat misnomer outshoot work eav systems practice many even classes system may represented standard relational form based whether attributes sparse dense eav/cr really characterized detailed metadata rich enough support automatic generation browsing interfaces individual classes without write class-by-class user-interface code basis browser interfaces possible generate batch dynamic sql queries independent class object first consulting metadata using metadata information generate sequence queries data tables queries may arbitrarily recursive approach works well object-at-a-time queries web-based browsing interfaces clicking name object brings details object separate page metadata associated object class also facilitates presentation object details includes captions individual attributes order presented well grouped one approach eav/cr allow columns hold json structures thus provide needed class structure example postgresql version 9.4 offers json binary column jsonb support allowing json attributes queried indexed joined words prof. dr. daniel masys formerly chair vanderbilt university medical informatics department challenges working eav stem fact eav database physical schema way data stored radically different logical schema – way users many software applications statistics packages regard i.e. conventional rows columns individual classes eav table conceptually mixes apples oranges grapefruit chop suey want analysis data using standard off-the-shelf software cases convert subsets columnar form process called pivoting important enough discussed separately metadata helps perform sleight hand lets users interact system terms logical schema rather physical software continually consults metadata various operations data presentation interactive validation bulk data extraction ad hoc query metadata actually used customize behavior system eav systems trade simplicity physical logical structure data complexity metadata among things plays role database constraints referential integrity standard database designs tradeoff generally worthwhile typical mixed schema production systems data conventional relational tables also benefit functionality automatic interface generation structure metadata complex enough comprises subschema within database various foreign keys data tables refer tables within subschema subschema standard-relational features constraints referential integrity used hilt correctness metadata contents terms intended system behavior critical task ensuring correctness means creating eav system considerable design efforts must go building user interfaces metadata editing used people team know problem domain e.g. clinical medicine necessarily programmers historically one main reasons pre-relational tmr system failed adopted sites home institution metadata stored single file non-intuitive structure customizing system behavior altering contents file without causing system break delicate task system authors trusted eav system implemented rdf rdf schema language may conveniently used express metadata schema information may used eav database engine dynamically re-organize internal table structure best efficiency final caveats regarding metadata validation presentation grouping metadata make possible creation code frameworks support automatic user interface generation data browsing well interactive editing production system delivered web task validation eav data essentially moved back-end/database tier powerless respect task middle /web server tier back-end validation always ideal impossible subvert attempting direct data entry table middle tier validation generic framework quite workable though significant amount software design effort must go building framework first availability open-source frameworks studied modified individual needs go long way avoiding wheel reinvention eav modeling alternative terms generic data modeling open schema long standard tool advanced data modelers like advanced technique double-edged used judiciously also employment eav preclude employment traditional relational database modeling approaches within database schema emrs rely rdbms cerner use eav approach clinical-data subschema vast majority tables schema fact traditionally modeled attributes represented individual columns rather rows modeling metadata subschema eav system fact good fit traditional modeling inter-relationships various components metadata trialdb system example number metadata tables schema outnumber data tables ten one correctness consistency metadata critical correct operation eav system system designer wants take full advantages features rdbmss provide referential integrity programmable constraints rather reinvent rdbms-engine wheel consequently numerous metadata tables support eav designs typically third-normal relational form commercial electronic health record systems ehrs use row-modeling classes data diagnoses surgical procedures performed laboratory test results segregated separate tables table entity composite patient id date/time diagnosis made surgery lab test performed attribute foreign key specially designated lookup table contains controlled vocabulary e.g. icd-10 diagnoses current procedural terminology surgical procedures set value attributes e.g. laboratory-test results one may record value measured whether normal low high range id person responsible performing test date/time test performed stated earlier full-fledged eav approach domain attributes given table restricted domain product ids supermarket sales table would restricted domain products products table however capture data parameters always defined standard vocabularies ehrs also provide pure eav mechanism specially designated power-users define new attributes data type maximum minimal permissible values permissible set values/codes allow others capture data based attributes epic tm ehr mechanism termed flowsheets commonly used capture inpatient nursing observation data typical case using eav model highly sparse heterogeneous attributes clinical parameters electronic medical record emrs stated even however accurate state eav modeling principle applied sub-schema database rather contents patient demographics example naturally modeled one-column-per-attribute traditional relational structure consequently arguments eav vs. relational design reflect incomplete understanding problem eav design employed sub-schema database sparse attributes need modeled even need supported third normal form metadata tables relatively database-design problems sparse attributes encountered circumstances eav design applicable relatively rare even encountered set eav tables way address sparse data xml-based solution discussed applicable maximum number attributes per entity relatively modest total volume sparse data also similarly modest example situation problems capturing variable attributes different product types sparse attributes may also occur e-commerce situations organization purchasing selling vast highly diverse set commodities details individual categories commodities highly variable magento e-commerce software employs eav approach address issue another application eav modeling classes attributes sparse dynamic number data rows per class relatively modest – couple hundred rows typically dozen – system developer also required provide web-based end-user interface within short turnaround time dynamic means new classes attributes need continually defined altered represent evolving data model scenario occur rapidly evolving scientific fields well ontology development especially prototyping iterative refinement phases creation new tables columns represent new category data especially labor-intensive programming web-based interfaces support browsing basic editing type- range-based validation case maintainable long-term solution create framework class attribute definitions stored metadata software generates basic user interface metadata dynamically eav/cr framework mentioned earlier created address situation note eav data model essential system designer may consider acceptable alternative creating say sixty tables containing total two thousand rows number rows per class efficiency considerations less important standard indexing class id/attribute id dbms optimizers easily cache data small class memory running query involving class attribute dynamic-attribute scenario worth noting resource description framework rdf employed underpinning semantic-web-related ontology work rdf intended general method representing information form eav rdf triple comprises object property value end jon bentley book writing efficient programs author warns making code efficient generally also makes harder understand maintain one rush tweak code unless one first determined performance problem measures code profiling pinpointed exact location bottleneck done modify specific code needs run faster similar considerations apply eav modeling apply sub-system traditional relational modeling known priori unwieldy clinical data domain discovered system evolution pose significant maintenance challenges database guru currently vice-president core technologies oracle corporation tom kyte example correctly points drawbacks employing eav traditional business scenarios makes point mere flexibility sufficient criterion employing eav however makes sweeping claim eav avoided circumstances even though oracle health sciences division employs eav model clinical-data attributes commercial systems clintrial oracle clinical achilles heel eav difficulty working large volumes eav data often necessary transiently permanently inter-convert columnar row-or eav-modeled representations data error-prone done manually well cpu-intensive generic frameworks utilize attribute attribute-grouping metadata address former latter limitation use less mandated case mixed schemas contain mixture conventional-relational eav data error quotient significant conversion operation called pivoting pivoting required eav data also form row-modeled data example implementations apriori algorithm association analysis widely used process supermarket sales data identify products purchasers given product also likely buy pivot row-modeled data first step many database engines proprietary sql extensions facilitate pivoting packages microsoft excel also support circumstances pivoting necessary considered however structure eav data model perfect candidate relational division see relational algebra good indexing strategy possible get response time less hundred milliseconds billion row eav table microsoft sql server mvp peter larsson proved laptop made solution general available obviously matter approaches take querying eav fast querying standard column-modeled relational data certain types query much way access elements sparse matrices fast non-sparse matrices latter fit entirely main memory sparse matrices represented using structures linked lists require list traversal access element given x-y position access elements matrices represented 2-d arrays performed using fast cpu register operations however chose eav approach correctly problem trying solve price pay respect eav modeling example space schema maintenance versus cpu-time tradeoff originally postulated maier ullman vardi universal data model udm seeks simplify query complex relational schema naive users creating illusion everything stored single giant universal table utilizing inter-table relationships user need concerned table contains attribute c.j date however pointed circumstances table multiply related another genealogy databases individual father mother also individuals business databases addresses stored centrally organization different office addresses shipping addresses insufficient metadata within database schema specify unambiguous joins udm commercialized sap businessobjects limitation worked around creation universes relational views predefined joins sets tables universe developer disambiguates ambiguous joins including multiply-related table view multiple times using different aliases apart way data explicitly modeled udm simply uses relational views intercede user database schema eav differs universal data models also applies transactional systems query oriented read-only systems udm also used basis clinical-data query systems eav implementations necessarily shield user specify class object interest eav-based i2b2 clinical data mart example user searches term option specifying category data user interested example phrase lithium refer either medication used treat bipolar disorder laboratory assay lithium level patient blood blood level lithium must monitored carefully much drug causes severe side effects little ineffective open schema implementation use xml column table capture variable/sparse information similar ideas applied databases support json-valued columns sparse hierarchical data represented json database json support postgresql partially sql server 2016 later attributes queried indexed joined offer performance improvements 1000x naive eav implementations. necessarily make overall database application robust note two ways xml json data stored one way store plain string opaque database server way use database server see structure obviously severe drawbacks storing opaque strings queried directly one form index based contents impossible perform joins based content building application manage data gets extremely complicated using eav models extent infrastructure developed terms metadata tables application-framework code using xml solves problem server-based data validation must done middle-tier browser-based code eav-based frameworks following drawbacks drawbacks remediable creating layer metadata application code creating original advantage create framework vanished fact modeling sparse data attributes robustly hard database-application-design problem matter storage approach used sarka work however proves viability using xml field instead type-specific relational eav tables data-storage layer situations number attributes per entity modest e.g. variable product attributes different product types xml-based solution compact eav-table-based one xml may regarded means attribute-value data representation though based structured text rather relational tables exist several approaches representation tree-structured data xml json formats nested set model relational database hand database vendors begun include json xml support data structures query features like ibm db2 xml data stored xml separate tables using xpath queries part sql statements postgresql json data type indexed queried developments accomplish improve substitute eav model approach noted however uses json xml necessarily use eav model though overlap xml preferable eav arbitrarily hierarchical data relatively modest volume single entity intended scale multi-gigabyte level respect data-manipulation performance xml concerned per-se sparse-attribute problem data model underlying information represented decomposed straightforwardly relational structure xml better suited means data interchange primary storage mechanism eav stated earlier specifically applicable sparse-attribute scenario scenario holds use datatype-specific attribute-value tables indexed entity attribute value manipulated simple sql statements vastly scalable use xml tree structure google app engine mentioned uses strongly-typed-value tables good reason alternative approach managing various problems encountered eav-structured data employ graph database represent entities nodes graph hypergraph attributes links edges graph issue table joins addressed providing graph-specific query languages apache tinkerpop opencog atomspace pattern matcher postgresql version 9.4 includes support json binary columns jsonb queried indexed joined allows performance improvements factors thousand traditional eav table designs db schema based jsonb always less tables one may nest attribute-value pairs jsonb type fields entity table makes db schema easy comprehend sql queries concise programming code manipulate database objects abstraction layer turns much shorter microsoft sql server 2008 offers proprietary alternative eav columns atomic data type e.g. numeric varchar datetime columns designated sparse simply including word sparse column definition create table statement sparse columns optimize storage null values take space useful majority records table null values column indexes sparse columns also optimized rows values indexed addition contents sparse columns particular row table collectively aggregated single xml column column set whose contents form codice_1 fact column set defined table part create table statement sparse columns subsequently defined typically added interesting consequence sql statement codice_2 return individual sparse columns concatenate single xml column whose name column set therefore acts virtual computed column sparse columns convenient business applications product information applicable attributes highly variable depending product type total number variable attributes per product type relatively modest however approach modeling sparse attributes several limitations rival dbmss notably chosen borrow idea engines limitations include many cloud computing vendors offer data stores based eav model arbitrary number attributes associated given entity roger jennings provides in-depth comparison amazon offering simpledb data type limited strings data intrinsically non-string must coerced string e.g. numbers must padded leading zeros wish perform operations sorting microsoft offering windows azure table storage offers limited set data types byte bool datetime double guid int long string google app engine offers greatest variety data types addition dividing numeric data int long float also defines custom data types phone number e-mail address geocode hyperlink google amazon microsoft lets define metadata would prevent invalid attributes associated particular class entity letting create metadata model google lets operate data using subset sql microsoft offer url-based querying syntax abstracted via linq provider amazon offer limited syntax concern built-in support combining different entities joins currently april '10 non-existent three engines operations performed application code may concern application servers co-located data servers vendor data center lot network traffic would generated two geographically separated eav approach justified attributes modeled numerous sparse data captured meet requirement cloud vendors default eav approach often mismatch applications require true back-end database opposed merely means persistent data storage retrofitting vast majority existing database applications use traditional data-modeling approach eav-type cloud architecture would require major surgery microsoft discovered example database-application-developer base largely reluctant invest effort recently therefore microsoft provided premium offering – cloud-accessible full-fledged relational engine sql server azure allows porting existing database applications modest changes one limitation sql azure physical databases limited 500gb size microsoft recommends data sets larger split multiple physical databases accessed parallel queries | [
1905,
3928,
2451,
1444,
7071,
8183,
4946,
4950,
6543,
2937,
6364,
7999,
4252,
6462,
7468,
1768,
7290,
2054,
5419,
7757,
5956,
2961,
5338,
5429,
4543,
7303,
1415,
4739,
3244,
784,
4463,
2265
] | Test |
5,779 | 4 | TLBleed:tlbleed tlbleed cryptographic side-channel attack uses machine learning exploit timing side-channel via translation look-aside buffer tlb modern microprocessors use simultaneous multithreading attack demonstrated experimentally intel processors speculated processors may also potentially vulnerable variant attack proof concept demonstrated recent news amd indicates processors vulnerable attack attack led openbsd project disabling simultaneous multithreading intel microprocessors openbsd project leader theo de raadt stated attack could theoretically addressed preventing tasks different security contexts sharing physical cores fix currently impractical complexity problem | [
704,
3932,
2912,
376,
3277,
2923,
5042,
2587,
5765,
3323,
7600,
4025,
1528,
2991,
1173,
6526,
6904,
6541,
6194,
2678,
3038,
3047,
6569,
2693,
862,
7307,
6589,
5187,
1996,
7328,
3100,
208,
2021,
5922,
6628,
924,
4531,
600,
1307,
2800,
63... | Test |
5,780 | 1 | Drizzle_(database_server):drizzle database server drizzle abandoned free software/open-source relational database management system dbms forked now-defunct 6.0 development branch mysql dbms like mysql drizzle client/server architecture uses sql primary command language old drizzle files distributed version 2 3 gnu general public license gpl portions including protocol drivers replication messaging bsd license early work fork done mid-2008 brian aker ongoing development handled team contributors includes staff members canonical ltd. google six apart sun microsystems rackspace data differential blue gecko intel percona hewlett-packard red hat others drizzle source code along instructions compiling available via project launchpad website october 2010 drizzle 13,478 total contributions 96 total contributors 37 active contributors also announced drizzle entered beta first ga version released march 2011 drizzle actively participated google summer code project since 2010 drizzle targeted web-infrastructure cloud computing markets developers product describe smaller slimmer hopefully faster version mysql drizzle written c++ programming language stores string data utf-8 format developed modern unix-like operating systems including linux freebsd mac os x solaris – general os conforms posix working implementation gnu autotools microsoft windows supported time mainly lack autotools support discussion accomplish sensible manner drizzle re-designed version mysql v6.0 codebase designed around central concept microkernel architecture features query cache authentication system plugins database follow general theme pluggable storage engines introduced mysql 5.1 supports pam ldap http auth authentication via plugins ships via plugin system currently supports logging files syslog remote services rabbitmq gearman drizzle acid-compliant relational database supports transactions via mvcc design plugin points added support replication storage engines query rewrite table functions user-defined functions protocol adapters multiple query caches like mysql drizzle supports concurrent multiple engines via drizzle includes built-in support b+ tree hash indexes drizzle query planner capable using multiple indexes multiple engines satisfy complex queries using temporary in-memory bitmap index operations database triggers drizzle supported dml ddl number additional event-based operations server primebase blob streaming system allows drizzle stream binary large objects blobs via http makes use system triggers drizzle currently must written c++ query matched rewritten dynamically sent server action done parsing occurs wide variety native data types supported including support execute command drizzle operate dynamic multi-statement sql via keyword concurrent operate statements parallel replication drizzle done generating messages using google protocol buffers library messages stored executed remote servers message format non-sql neutral format allowed drizzle replication appliers rabbitmq memcached mysql voldemort apache cassandra drizzle licensed version two three gpl parts libdrizzle client library bsd license | [
7957,
4382,
5717,
3764,
4759,
5021,
7248,
1359,
7071,
1640,
5126,
5571,
6279,
3542,
578,
3794,
4708,
4167,
3652,
848,
6755,
6386,
5956,
2961,
4363,
6489,
2700,
3915,
1695,
6056,
5787,
6586,
4739,
2259,
3244,
7598
] | Validation |
5,781 | 2 | Features_new_to_Windows_10:features new windows 10 windows 10 introduced number new elements including option use touch-optimized interface known tablet mode traditional desktop interface similar windows 7 along live tiles windows 8 however unlike previous versions windows major features release completed rtm windows 10 continues receive major features changes beyond initial release market microsoft describes windows 10 'operating system service receive ongoing updates features functionality supplemented ability enterprise environments receive non-critical updates slower pace use long-term support milestones receive critical updates security patches ten-year lifespan support terry myerson executive vice president microsoft windows devices group argued goal model reduce fragmentation across windows platform windows 10 codenamed threshold 1 first release windows 10 carries build number 10.0.10240 build n't contain version number microsoft retroactively named version 1507 standing july 2015 matching versioning scheme later updates threshold 1 announced event september 30 2014 first preview following day final release made available windows insiders july 15 2015 followed public release july 29 2015 free upgrade windows 7 windows 8.1 threshold 1 release windows 10 supported users long term servicing branch ltsb new feature indicated release added since windows 8.1 update 1 released april 2014 mail app adds user-configurable swipe gesture controls pop3 email support google calendar support added calendar app settings app expanded similar functionality control panel albeit metro-style user interface map app download maps offline use microsoft edge new browser windows 10 successor internet explorer although internet explorer remain compatibility legacy purposes cortana integrated edge accessible option ask cortana right click menu well reading view ability write notes directly web pages save onenote reading list feature also added users save articles content accessed read later microsoft edge also includes share button toolbar tapping clicking bring system share panel users able share webpage installed applications reading list third-party apps facebook twitter since release microsoft edge scored 402 555 points html5test windows 10 introduced universal windows platform uwp extension windows runtime platform originally introduced windows 8 uwp emphasizes core set apis common variations operating system enabling ability code single application adaptations user interface differences different device families states including desktops laptops tablets smartphones via windows 10 mobile xbox one new device classes surface hub hololens application may also react available displays input device connected monitor suitable docking station uwp app smartphone take appearance app pc information also synchronized versions app different devices notifications licensing windows 10 includes directx 12 alongside wddm 2.0 unveiled march 2014 gdc directx 12 aims provide console-level efficiency closer metal access hardware resources reduced cpu graphics driver overhead performance improvements achieved low-level programming reduce single-threaded cpu bottlenecking caused abstraction higher level apis performance gains achieved allowing developers direct access gpu resources similar low-level rendering initiatives amd mantle apple metal api opengl successor vulkan wddm 2.0 introduces new virtual memory management allocation system reduce workload kernel-mode driver windows 10 brings updates xbox app introduced windows 8 games xbox one streamed windows 10 device excluding smartphones windows 10 introduces game bar provides screenshot video capture functionality windows games users invoke game bar record gameplay take screenshot using appropriate keyboard shortcuts windows 10 also continuously capture gameplays background allows user request last users defined moments gameplay saved hard disk useful user wants save and/or share moment gameplay think explicitly record beforehand windows 10 also allows web apps desktop software using either win32 .net framework packaged distribution windows store desktop software distributed windows store packaged using app-v system allow sandboxing web apps executed remote servers access windows functions notifications camera access windows 8 locally packaged web apps written using html winjs called action center windows 7 windows server 2008 r2 successor called security maintenance title action center windows 10 usurped sidebar provides list received notifications group quick actions buttons different settings areas accessed clicking notifications icon system tray swiping right screen touchscreens windows 10 brings improvements system command-line interface unlike previous versions windows nt win32 console windows resized without restrictions made cover full screen pressing combination keyboard microsoft also enabled use standard keyboard shortcuts cut copy paste within console word wrapping keyboard shortcuts move caret select manipulate text become available features word wrap transparency also included user option disable new features return legacy console wish continuum blanket title group features windows 10 designed enable smoother transitions default interface mode designed use keyboard mouse interface designed touchscreen environments especially hybrid devices laplets enabling tablet mode switches primary interface full screen version start menu opens applications maximized view default taskbar also modified adding back button next start button default hiding buttons opened pinned applications task view used primary means switching programs windows prompt switch two modes automatically certain events occur plugging keyboard mouse tablet switching laplet laptop state vice versa windows 10 brought cortana assistant windows phone 8.1 windows 10 default cortana appears search pane taskbar changed button like tablet mode activated voice using command hey cortana user searches start menu user searches cortana search pane cortana users ask cortana questions weather calendar events types notifications along online information cortana currently requires microsoft account function windows 10 reintroduced start menu seen versions windows prior 8 however unlike versions new start menu includes live tile features windows 8 possible resize start menu view recently added used applications also made full screen tablet users users prefer windows 8-like experience right hand side start menu used pin tiles menu contain limited amount columns depending screen resolution columns divided groups title every group divided 6 8 columns depending user settings allow either 6 8 small sized tiles next task view task switching virtual desktop system accessible via taskbar button keyboard shortcut swiping left touchscreen activating task view shows zoomed display windows currently opened specific monitor clicking window switches task view also displayed window snapped half screen three windows snapped fourths screen prompting window occupy remainder screen task view also allows creation virtual workspaces windows dragged workspaces modern settings app windows 8 continues evolve windows 10 incorporating system setting configuration functionality windows control panel ultimate goal make settings app feature complete obviating need control panel push-button reset function changed utilize files current windows installation rebuild system rather separate recovery image system updates carry new installation re-downloaded separate refresh option removed users given explicit choices within reset process remove personal files applications keep personal files remove applications perform full factory reset mac address randomization wifi introduced try prevent third parties using mac address track devices windows 10 november update windows 10 version 1511 codenamed threshold 2 first major update windows 10 carries build number 10.0.10586 version 1511 referencing date release november 2015 first preview released august 18 2015 final release made available windows insiders november 3 2015 followed public release november 12 2015 existing windows 10 users free upgrade windows 7 windows 8.1 unlike initial release windows branch also made available existing windows phone 8.1-devices xbox one preview release windows server 2016 pre-installed new windows 10 mobile-devices like microsoft lumia 950 threshold 2 release windows 10 supported users current branch businesses cbb changes highlight features new since threshold 1 release windows 10 windows 10 anniversary update windows 10 version 1607 codenamed redstone 1 second major update windows 10 first 2 major updates given redstone codename released july 29 2016 universal windows platform apps support extensions allowing add-ons dlcs apps games respectively furthermore add-ons managed windows settings app anniversary update windows 10 adds windows subsystem linux allows ubuntu user space run natively windows subsystem translate linux system call ubuntu uses windows nt kernel allows bash ubuntu command line apps run within windows console however interoperability restriction bash run windows apps windows run linux software project centennial allows win32 .net apps repackaged appx allow use full set windows runtime apis also allow apps distributed windows store new workspace environment pen users includes virtual sticky notes pen could used take notes sticky notes features optical character recognition ocr highlight relevant text used cortana workspace also includes sketchpad ability take screenshot draw virtual ruler windows 10 creators update windows 10 version 1703 codenamed redstone 2 feature update windows 10 slated released april 11 2017 first preview release seeded windows insiders august 11 2016 redstone 2 release windows 10 currently development branch available windows insiders changes highlights features new since redstone 1 release windows 10 april 2018 update windows 10 version 1803 fifth feature update windows 10 windows 10 october 2018 update windows 10 version 1809 sixth feature update windows 10 | [
2196,
2198,
6096,
4687,
1097,
1475,
405,
4347,
2953,
6136,
6498,
5442,
4377,
5794,
444,
447,
448,
458,
4759,
7616,
1536,
7247,
7619,
5480,
7660,
1970,
2329,
3048,
4089,
3057,
6580,
7685,
1237,
8049,
8054,
6256,
7335,
8073,
6984,
4500,
4... | Validation |
5,782 | 0 | Link_grammar:link grammar link grammar lg theory syntax davy temperley daniel sleator builds relations pairs words rather constructing constituents phrase structure hierarchy link grammar similar dependency grammar dependency grammar includes head-dependent relationship whereas link grammar makes head-dependent relationship optional links need indicate direction colored multiplanar link grammar cmlg extension lg allowing crossing relations pairs words relationship words indicated link types thus making link grammar closely related certain categorial grammars example subject–verb–object language like english verb would look left form subject link right form object link nouns would look right complete subject link left complete object link subject–object–verb language like persian verb would look left form object link distant left form subject link nouns would look right subject object links link grammar connects words sentence links similar form catena unlike catena traditional dependency grammar marking head-dependent relationship optional languages becoming mandatory free-word-order languages turkish finnish hungarian lithuanian english subject-verb relationship obvious subject almost always left verb thus specific indication dependency needs made case subject-verb inversion distinct link type employed free word-order languages longer hold link subject verb must contain explicit directional arrow indicate two words link grammar also differs traditional dependency grammars allowing cyclic relations words thus example links indicating head verb sentence head subject sentence well link subject verb three links thus form cycle triangle case cycles useful constraining might otherwise ambiguous parses cycles help tighten set allowable parses sentence example parse left-wall indicates start sentence root node directional wv link arrows points head verb sentence wall-verb link wd link drawn without arrows indicates head noun subject sentence link type wd indicates connects wall w sentence declarative sentence lower-case subtype ss link indicates subject-verb relationship lower-case indicating subject singular note wv wd ss links cycle pa link connects verb complement lower-case indicating predicative adjective case parsing performed analogy assembling jigsaw puzzle representing parsed sentence puzzle pieces representing individual words language represented means dictionary lexis consists words set allowed jigsaw puzzle shapes word shape indicated connector link-type direction indicator indicating right left thus example transitive verb may connectors s- o+ indicating verb may form subject connection left object connection right similarly common noun may connectors d- s+ indicating may connect determiner left d- act subject connecting verb right s+ act parsing identify s+ connector attach s- connector forming link two words parsing completes connectors connected given word may dozens even hundreds allowed puzzle-shapes termed disjuncts example many verbs may optionally transitive thus making o+ connector optional verbs might also take adverbial modifiers e connectors inherently optional complex verbs may additional connectors indirect objects particles prepositions thus part parsing also involves picking one single unique disjunct word final parse must satisfy connect connectors disjunct connectors may also include head-dependent indicators h d. case connector containing head indicator allowed connect connector containing dependent indicator connector without h-d indicators indicators used link decorated arrows indicate link direction recent extension simplifies specification connectors languages little restrictions word-order lithuanian also extensions make easier support languages concatenative morphologies parsing algorithm also requires final graph planar graph i.e links cross constraint based empirical psycho-linguistic evidence indeed languages nearly situations dependency links really cross rare exceptions e.g finnish even english parsed link-grammar introducing complex selective connector types capture situations connectors optional floating-point cost markup cheaper use others thus giving preference certain parses others total cost parse sum individual costs connectors used cheapest parse indicates likely parse used parse-ranking multiple ambiguous parses fact costs local connectors global property algorithm makes essentially markovian nature assignment log-likelihood linkages allows link grammar implement semantic selection predicate-argument relationships certain constructions although syntactically valid extremely unlikely way link grammar embodies ideas present operator grammar costs additive behave like logarithm probability since log-likelihoods additive equivalently somewhat like entropy since entropies additive makes link grammar compatible machine learning techniques hidden markov models viterbi algorithm link costs correspond link weights markov networks bayesian networks link grammar link types understood types sense type theory effect link grammar used model internal language certain non-symmetric compact closed categories pregroup grammars sense link grammar appears isomorphic homomorphic categorial grammars thus example categorial grammar noun phrase bad boy may written whereas corresponding disjuncts link grammar would contraction rules inference rules lambek calculus mapped connecting connectors link grammar directional indicators correspond forward backward-slashes categorical grammar finally single-letter names understood labels easy-to-read mnemonic names rather verbose types np/n etc primary distinction categorical grammars two type constructors forward backward slashes used create new types np/n base types np n link-grammar omits use type constructors opting instead define much larger set base types compact easy-to-remember mnemonics basic rule file svo language might look like thus english sentence boy painted picture would appear similar parses apply chinese conversely rule file null subject sov language might consist following links simple persian sentence man nan xordam من نان خوردم ate bread would look like vso order likewise accommodated arabic many languages concatenative morphology stem plays grammatical role grammar determined suffixes thus russian sentence 'вверху плыли редкие облачка might parse subscripts '.vnndpp used indicate grammatical category primary links wd ei sip api connect together suffixes principle stems could appear without altering structure sentence api link indicates adjective sip denotes subject-verb inversion ei modifier wd link used indicate head noun head verb indicated sentence llxxx links serve attach stems suffixes link-grammar also indicate phonological agreement neighboring words example connector 'ph used constrain determiners appear word 'abstract effectively blocks makes costly use determiner sentence link 'an becomes cheap links roughly previous examples denoting subject denoting object denoting determiner 'wv link indicates head verb w link indicates head noun lower-case letters following upper-case link types serve refine type example ds connect singular noun ss singular subject os singular object lower-case v phv denotes 'vowel lower-case wd denotes declarative sentence vietnamese language sentence bữa tiệc hôm qua là một thành công lớn party yesterday great success may parsed follows link grammar syntax parser library natural language processing written c. available lgpl license parser ongoing project recent versions include improved sentence coverage russian persian arabic language support prototypes german hebrew lithuanian vietnamese turkish programming api python java common lisp autoit ocaml 3rd-party bindings perl ruby javascript node.js current major undertaking project learn grammar morphology new languages using unsupervised learning algorithms link-parser program along rules word lists english may found standard linux distributions e.g. debian package although many years date abiword free word processor uses link grammar on-the-fly grammar checking words linked anywhere underlined green semantic relationship extractor relex layered top link grammar library generates dependency grammar output making explicit semantic relationships words sentence output classified level ssyntr dsyntr meaning-text theory also provides framing/grounding anaphora resolution head-word identification lexical chunking part-of-speech identification tagging including entity date money gender etc tagging includes compatibility mode generate dependency output compatible stanford parser penn treebank-compatible pos tagging link grammar also employed information extraction biomedical texts events described news articles well experimental machine translation systems english german turkish indonesian farsi link grammar link dictionary used generate verify syntactic correctness three different natural language generation systems nlgen nlgen2 microplanner/surreal also used part nlp pipeline opencog ai project | [
5429,
2882,
2451,
1718,
5983,
5965,
7610,
3915,
5129,
5571,
6428,
7410,
1989,
5008,
1435
] | Test |
5,783 | 6 | Inode:inode inode index node data structure unix-style file system describes file-system object file directory inode stores attributes disk block location object data file-system object attributes may include metadata times last change access modification well owner permission data directories lists names assigned inodes directory contains entry parent children uncertainty linux kernel mailing list reason inode 2002 question brought unix pioneer dennis ritchie replied paper published 1978 ritchie ken thompson strongly suggests etymology also maurice j. bach writes file system relies data structures files beside file content former called metadata —data describes data file associated inode identified integer number often referred i-number inode number inodes store information files directories folders file ownership access mode read write execute permissions file type many types file system implementations maximum number inodes fixed file system creation limiting maximum number files file system hold typical allocation heuristic inodes file system one percent total size inode number indexes table inodes known location device inode number kernel file system driver access inode contents including location file thus allowing access file file inode number found using codice_1 command codice_1 command prints i-node number first column report unix-style file systems reiserfs omit inode table must store equivalent data order provide equivalent capabilities data may called stat data reference codice_3 system call provides data programs file names directory implications operating system kernel in-memory representation data called codice_4 linux systems derived bsd use term codice_5 v vnode referring kernel virtual file system layer posix standard mandates file-system behavior strongly influenced traditional unix file systems inode denoted phrase file serial number defined per-file system unique identifier file file serial number together device id device containing file uniquely identify file within whole system within posix system file following attributes may retrieved codice_3 system call make sense store small files inode save space data block needed look-up time disk access needed file system feature called inlining strict separation inode file data thus longer assumed using modern file systems data file fits space allocated pointers data space conveniently used example ext2 successors stores data symlinks typically file names way data 60 bytes fast symbolic links ext4 file system option called inline_data enabled file system creation allows ext4 perform inlining inode size limited works small files | [
1807,
4297,
5021,
13,
3271,
3276,
1835,
5041,
7546,
7550,
405,
1855,
6117,
4347,
65,
4733,
6853,
5088,
6500,
785,
2266,
788,
3682,
1522,
7605,
7611,
4759,
7242,
4397,
6892,
4771,
821,
126,
6907,
4786,
4423,
6197,
4061,
1208,
1574,
5161,... | Test |
5,784 | 3 | Timeline_of_DOS_operating_systems:timeline dos operating systems article presents timeline events history x86 dos disk operating systems 1973 2016 operating systems named dos generally part scope timeline dos releases forms | [
4291,
5012,
7512,
1442,
4662,
6076,
7161,
1447,
4670,
6088,
1833,
3626,
396,
2932,
3303,
6462,
2949,
6470,
6840,
56,
1494,
7212,
3664,
5079,
5088,
4018,
1522,
4751,
93,
4759,
2280,
6170,
2995,
5108,
4767,
7618,
5116,
2290,
5822,
7631,
5... | Test |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.