node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4 values |
|---|---|---|---|---|
5,985 | 9 | CVAR:cvar cvar convar abbreviations console variable depending context term found may also stand client variable configuration variable type variable used many computer games computer 3d simulation engines manipulated text based command line interface within game engine often called console commonly hold configuration parameters used anything may potentially accessed and/or modified console common usage cvars server operators customize online game servers | [
3172
] | Test |
5,986 | 9 | Funarg_problem:funarg problem computer science funarg problem refers difficulty implementing first-class functions functions first-class objects programming language implementations use stack-based memory allocation functions difficulty arises body nested function refers directly i.e. via argument passing identifiers defined environment function defined environment function call standard resolution either forbid references create closures two subtly different versions funarg problem upwards funarg problem arises returning otherwise transmitting upwards function function call downwards funarg problem arises passing function parameter another function call one function calls another typical program execution local state caller including parameters local variables must preserved order execution proceed callee returns compiled programs local state stored call stack data structure called stack frame activation record stack frame pushed allocated prelude calling another function popped deallocated function returns function call upwards funarg problem arises calling function refers called/exited function state function returned therefore stack frame containing called function state variables must deallocated function returns violating stack-based function call paradigm one solution upwards funarg problem simply allocate activation records heap instead stack rely form garbage collection reference counting deallocate longer needed managing activation records heap historically perceived less efficient stack although partially contradicted perceived impose significant implementation complexity functions typical programs less programs functional programming languages create upwards funargs adding concerns potential overhead associated implementation furthermore approach genuinely difficult languages support garbage collection efficiency-minded compilers employ hybrid approach activation records function allocated stack compiler able deduce static program analysis function creates upwards funargs otherwise activation records allocated heap another solution simply copy value variables closure time closure created cause different behavior case mutable variables state longer shared closures known variables constant approach equivalent ml languages take approach since variables languages bound values—i.e variables changed java also takes approach respect anonymous classes allows one refer variables enclosing scope codice_1 i.e constant languages allow programmer explicitly choose two behaviors php 5.3 anonymous functions require one specify variables include closure using codice_2 clause variable listed reference includes reference original variable otherwise passes value apple blocks anonymous functions captured local variables default captured value one wants share state closures closure outside scope variable must declared codice_3 modifier case variable allocated heap following haskell-inspired pseudocode defines function composition codice_4 operator constructing new function case one argument codice_5 returns result first applying codice_6 codice_5 applying codice_8 λ function carries functions codice_8 codice_6 pointers internal state problem case exists compose function allocates parameter variables codice_8 codice_6 stack codice_13 returns stack frame containing codice_8 codice_6 discarded internal function codice_16 attempts access codice_6 access discarded memory area downwards funarg may also refer function state function actually executing however definition existence downwards funarg contained execution function creates stack frame function usually still stored stack nonetheless existence downwards funargs implies tree structure closures stack frames complicate human machine reasoning program state downwards funarg problem complicates efficient compilation tail recursion code written continuation-passing style special cases intent programmer usually function run limited stack space faster behavior may actually undesirable historically upwards funarg problem proven difficult example pascal programming language allows functions passed arguments returned results thus implementations pascal required address downwards funarg problem upwards one modula-2 oberon programming languages descendants pascal allow functions parameters return values assigned function may nested function c programming language historically avoids main difficulty funarg problem allowing function definitions nested environment every function containing statically-allocated global variables functions pointer function code describes function completely apple proposed implemented closure syntax c solves upwards funarg problem dynamically moving closures stack heap necessary java programming language deals requiring context used nested functions anonymous inner local classes declared final context used lambda expressions effectively final c lambdas closures encapsulate function pointer related variables functional languages functions first-class values passed anywhere thus implementations scheme sml must address upwards downwards funarg problems usually accomplished representing function values heap-allocated closures previously described ocaml compiler employs hybrid technique based program analysis maximize efficiency | [
1616,
622,
6877,
3437,
7333,
2638,
4039,
1825,
6980,
4589,
2740,
310,
6029,
7391,
5164,
7032,
7123,
1435
] | Test |
5,987 | 9 | IMacros:imacros imacros browser based application macro recording editing playback web automation testing provided standalone application extensions mozilla firefox google chrome internet explorer web browsers developed iopus/ipswitch adds record replay functionality similar found web testing form filler software macros combined controlled via javascript demo macros javascript code examples included software running strictly javascript based macros removed later versions imacros browser extensions however users use alternative browser like pale moon based older version mozilla firefox use javascript files web based automated testing moon tester tool first created 2001 mathias roth imacros first macro recorder tool specifically designed optimized web browsers form filling april 2012 imacros acquired ipswitch imacros firefox chrome offers feature known social scripting allows users share macros scripts manner similar social bookmarking technically functions distributed web sites embedding imacro controlling javascript inside plain text link along freeware version imacros available proprietary commercial application additional features support web scripting web scraping internet server monitoring web testing addition working html pages commercial editions automate adobe flash adobe flex silverlight java applets using directscreen image recognition technology freeware version imacros contains control flow statements minor exceptions complex conditional code requires scripting available commercial version advanced versions also contain command-line interface application programming interface api automate complicated tasks integrate programs scripts imacros api called scripting interface scripting interface imacros scripting edition designed component object model com object allows user remotely control script imacros browser internet explorer firefox chrome windows programming scripting language | [
1152,
2451,
8085,
5570,
5129,
4170,
5571,
5991,
3922,
6425
] | Train |
5,988 | 3 | Intel_Microcode:intel microcode intel microcode microcode runs inside x86 processors made intel since p6 microarchitecture introduced mid-1990s microcode programs patched operating system bios firmware workaround bugs found cpu release intel originally designed microcode updates processor debugging design testing dft initiative following pentium fdiv bug patchable microcode function took wider purpose allow in-field updating without needing product recall p6 later microarchitectures lists x86 instructions internally converted simpler risc-style micro-operations specific particular processor stepping level pentium pro micro-operation 72-bits wide 118-bits wide includes two source fields one destination field ability hold 32-bit immediate value pentium pro able detect parity errors internal microcode report via machine check architecture micro-operations consistent format three source inputs two destination outputs processor performs register renaming map inputs real register file rrf execution out-of-order execution used micro-operations instructions represent may appear order development pentium pro several microcode fixes included a2 b0 steppings pentium ii based p6 pentium pro additional micro-operations added support mmx instruction set several cases microcode assists added handle rare corner-cases reliable way pentium 4 126 micro-operations flight time micro-operations decoded stored execution trace cache 12,000 entries avoid repeated decoding x86 instructions groups six micro-operations packed trace line complex instructions exception handling result jumping microcode rom development pentium 4 microcode accounted 14 processor bugs versus 30 processor bugs development pentium pro intel core microarchitecture introduced 2006 added micro-operations fusion common pairs instructions including comparison followed jump instruction decoders core convert x86 instructions microcode three different ways intel hyper-threading implementation simultaneous multithreading microcode rom trace cache instruction decoders shared micro-operation queue shared mid-1990s facility supplying new microcode initially referred pentium pro stepping data file bios update feature intended user mode applications make bios interrupt call supply new bios update data block bios would partially validate save nonvolatile bios memory could supplied installed processors next boot intel distributed program called codice_1 renamed codice_2 could run dos collections multiple microcode updates concatencated together numerically numbered extension codice_3 codice_4 processor boots using set microcode held inside processor stored internal rom microcode update populates separate sram set match registers act breakpoints within microcode rom allow jumping updated list micro-operations sram match performed microcode instruction pointer uip match registers match resulting jump corresponding destination microcode address original p6 architecture space sram 60 micro-operations multiple match/destination register pairs takes one processor instruction cycle jump rom microcode patched microcode held sram match registers consist microcode match address microcode destination address processor must protection ring zero order initiate microcode update cpu symmetric multiprocessing arrangement needs updated individually update initiated placing address codice_5 register setting codice_6 executing codice_7 write model-specific register intel distributes microcode updates 2,048 2 kilobyte binary blob update contains information processors designed checked result cpuid instruction structure 48-byte header followed 2,000-bytes intended read directly processor updated block encoded differently majority 2,000 bytes used configuration program sram micro-operation contents much smaller final determination validation whether update applied processor performed decryption via processor microcode update specific particular cpu revision designed rejected cpus different stepping level microcode updates encrypted prevent tampering enable validation pentium two layers encryption precise details explicitly documented intel instead known less ten employees microcode updates intel atom nehalem sandy bridge additionally contain extra 520-byte header containing 2048-bit rsa modulus exponent 17 decimal micro architecture example processors supplied length functional length suspected encoding | [
5012,
4845,
4847,
2014,
5822,
7541,
5042,
5669,
4514,
4611,
1867,
3565,
5245,
336,
2248,
1052,
6772,
4643,
352,
2351,
1335
] | Test |
5,989 | 9 | Transterpreter:transterpreter transterpreter computer software interpreter transputer virtual machine programming language occam-π occam-pi portable runtime kroc compiler designed education research concurrency robotics transterpreter developed university kent transterpeter made possible easily run occam-π programs platforms lego mindstorms rcx arduino ia-32 sparc mips cell operating systems linux macos windows dos | [
5055,
4408,
4759,
578,
5571,
971
] | Validation |
5,990 | 3 | The_Great_Giana_Sisters:great giana sisters great giana sisters 1987 platform game developed german studio time warp productions published rainbow arts known controversial production history similarities nintendo platform game super mario bros. prompted legal pressure producers game scroll screen melody game composed chris hülsbeck popular commodore 64 soundtrack player takes role giana referred gianna scrolling intro also intended name typo made cover art developers went rather cover remade girl suffers nightmare travels 32 stages full monsters collecting ominous diamonds looking sister maria player wins final battle giana awakened sister great giana sisters 2d side-scrolling arcade game player controls either giana sister maria game supports alternating 2 players second player taking control maria level contains number dream crystals gives points collected order make game high score extra life gained collecting 100 dream crystals extra lives also found form hidden lollipop items enemies defeated jumping shooting obtaining relevant powerups enemies include owls rolling eyeballs flesh-eating fish deadly insects fire wheel transforms giana punk ability crush rocks jumping beneath lightning bolt awards giana dream bubbles single projectile shot double lightning gives ability shoot recoiling projectiles strawberries gives ability shoot homing projectiles one defensive item game water-drop protects giana fire number special items also triggered affects entire screen clock freezes enemies on-screen magic bombs kills enemies items found item blocks scattered around stages two types stages game overworld underground stage overworld stages feature green scenery pipe-shaped objects along bottomless pits giana avoid underground stages feature additional hazards water fire well bosses total 32 stages game hidden warp-blocks found jump portions game great giana sisters programmed armin gessert graphics manfred trenz soundtrack composed chris hülsbeck label time warp production inc first original game version released 1987 commodore 64 shortly released amiga amstrad cpc atari st license held black forest games developed sequel according several urban legends nintendo opened lawsuit case time warp productions rainbow arts nintendo saw direct copyright infringement new game super mario bros. fact never lawsuit neither nintendo german programmers claim privy lawsuits myth created shortly game taken stores nintendo later admitted influenced stop sales directly games several factors influenced stop sales game including conspicuous similarities general gameplay first level great giana sisters nearly identical layout first stage found nintendo super mario bros. immediate similarity super mario bros. ensured great giana sisters quickly noticed public video game industry nintendo urged makers great giana sisters withdraw game sale arguing obvious copyright infringement time warp productions rainbow arts immediately stopped production time game began vanishing stores difficulty obtaining copies game led sought collector items game ported numerous systems since release planned port zx spectrum reviewed magazines though eventually cancelled due legal pressures 1993 dutch publisher sunrise released version msx2 programmed jan van valburg unofficially game cloned windows dos linux mac os x amigaos 4 netbsd aros morphos symbian os unofficial clone commodore 64 version also made nintendo ds 2009 mobile version game titled simply giana sisters released android phones appears ouya discover store launch upon release great giana sisters received strong critical praise acclaim gaming magazines across europe zzap 64 described game amazing concluded overall opinion great giana sisters fabulous compelling constantly rewarding arcade adventure powerplay review stated felt game live standards set super mario bros. still achieves entertaining pleasure despite never seeing release zx spectrum version gained favorable reviews spectrum-based magazines crash noted game highly addictive great fun play plenty hidden passages surprise features keep hooked weeks great giana sisters gained strong cult following years citing strong soundtrack unique charm online web resource lemon64 staff member jan egil romestrand remarked game must-have serious c64 games collector 2012 ranks 6th place top 10 games list gamebase 64 chris hülsbeck soundtrack game become one popular video game soundtracks time received 50 remixes popular music arrangement resource remix64 music great giana sisters featured live orchestra concert symphonic shades held cologne germany august 23 2008 arrangement made jonne valtonen performed wdr radio orchestra concert first video game orchestra concert broadcast live radio concert recording received album release 2009 album print still bought digitally amazon since 2009 endorsement manfred trenz fan-made open-source remake c64 version called openggs development hosted sourceforge remake ported mobile devices like pandora 2015 shortly release great giana sisters time warp began developing sequel announced giana 2 arther martha future world new game futuristic setting due trouble caused legal pressure coming nintendo deemed risky small developer produce game associated giana sisters brand time warp renamed game hard n'heavy changed game protagonists robots rather giana sisters hard n'heavy released commodore 64 amiga 1989 april 2009 publisher dtp entertainment developer spellbound interactive owner game intellectual property released new giana sisters game europe graphical update nintendo ds titled giana sisters ds released australia game features all-new levels gameplay elements recreation original game levels unlocked giana sisters ds released north america february 2011 publisher destineer though official website listed available several retailers walmart newegg.com giana sisters 2d hd remake nintendo ds game released october 2015 pc july 2012 black forest games started kickstarter campaign new installment great giana sisters originally titled project giana later retitled describing project grandchild great giana sisters kickstarter funded successfully netting 186,158 goal 150,000 game described direct sequel giana sisters ds features music great giana sisters original composer chris hülsbeck cooperation fabian del priore swedish sid metal band machinae supremacy giana sisters twisted dreams released october 23 2012 pc later releases xbox live arcade playstation network nintendo eshop possibly ouya giana sisters dream runners multiplayer focused platform game released august 2015 pc playstation 4 xbox one received negative reviews | [
4759,
6380,
578
] | Test |
5,991 | 4 | Ipswitch,_Inc.:ipswitch inc. ipswitch management software developer small medium sized businesses company founded 1991 headquartered burlington massachusetts operations atlanta alpharetta augusta georgia american fork utah madison wisconsin galway ireland ipswitch sells products directly well distributors resellers oems united states canada latin america europe pacific rim roger greene founded ipswitch 1991 apartment without venture capital funding bank financing company became profitable second year first product ipswitch produced gateway allowed novell inc. ipx networking protocol connect internet protocol 1994 ipswitch launched imail server first product available e-commerce site open market mid-1990s company value-added reseller spyglass mosaic browser 1996 company released beta version whatsup gold commercial version earlier shareware product ws_ping 2008 ipswitch acquired wisconsin-based software producer standard networks inc. product moveit shortly acquisition ipswitch split operations three divisions secure file transfers network management messaging collaboration company acquired salt lake city-based hourglass technologies 2009 following year company acquired compliance system system log analysis software producer dorian software december 2012 ipswitch acquired waldorf germany-based performance testing company iopus known product imacros web-browser extension 2015 ipswitch merged network monitoring file transfer divisions created partnersynergy program ipswitch opened support operations center galway ireland march 2016.. 28 march 2019 ipswitch signed agreement progress software corporation whereby progress acquire ipswitch completion purchase 225 million announced progress may 1st company commits 5 percent profits variety community investment programs designed support interests employees 2010 ipswitch inc. ’ network management division claimed company achieved 5,000 downloads whatsup gold engineer ’ toolkit first month release partnership trees life international planted 5,000 trees one download | [
3821,
5987
] | Test |
5,992 | 9 | Tea_(programming_language):tea programming language tea high level scripting language java environment combines features scheme tcl java tea proprietary language interpreter subject non-free license project called destea released language :tea cpan provides alternative generating java code based tea code teaclipse open source compiler uses javacc-generated parser parse compile tea source proprietary tea bytecode | [
6507,
7032,
1598,
6497,
486
] | Validation |
5,993 | 2 | Bryan_Cantrill:bryan cantrill bryan m. cantrill born 1973 american software engineer worked sun microsystems later oracle corporation following acquisition sun left oracle july 25 2010 become vice president engineering joyent. transitioning chief technology officer joyent april 2014 departure july 31 2019 cantrill born vermont later moving colorado attained rank eagle scout studied computer science brown university spending two summers qnx software systems kernel development upon completing b.sc 1996 immediately joined sun microsystems work jeff bonwick solaris performance group 2005 bryan cantrill named one 35 top young innovators technology review mit magazine cantrill included tr35 list development dtrace function os solaris 10 provides non-invasive means real-time tracing diagnosis software sun technologies technologists including dtrace cantrill also received infoworld innovators award year 2006 dtrace trouble-shooting software sun chosen gold winner wall street journal 2006 technology innovation awards contest 2008 cantrill mike shapiro adam leventhal recognized usenix software tools user group stug award provision significant enabling technology together shapiro leventhal cantrill founded fishworks stealth project within sun microsystems produced sun storage 7000 unified storage systems left oracle july 25 2010 become vice president engineering joyent announced transition chief technology officer joyent april 2014 held position announcing departure july 31 2019 member acm queue editorial board online technical discussion solaris linux kernel developer david s. miller 1996 cantrill responded miller lengthy comment one-line reply ever kissed girl 2015 discussion concerning ben noordhuis departure node.js project cantrill said 1996 comment continues cited decades later wrote regrets sending response called stupid cantrill left oracle 2010 used strong analogies multiple times describe point view oracle business behavior cantrill announced fisl 2012 strong preference permissive open source software licenses copyleft licenses calling copyleft gpl license family anti-collaborative viral | [
5571,
8037,
4764,
6046
] | Test |
5,994 | 5 | Carrier_interferometry:carrier interferometry carrier interferometry ci spread spectrum scheme designed used orthogonal frequency-division multiplexing ofdm communication system multiplexing multiple access enabling system support multiple users time frequency band like mc-cdma ci-ofdm spreads data symbol frequency domain data symbol carried multiple ofdm subcarriers unlike mc-cdma uses binary-phase hadamard codes code values 0 180 degrees binary pseudonoise ci codes complex-valued orthogonal codes simplest case ci code values coefficients discrete fourier transform dft matrix row column dft matrix provides orthogonal ci spreading code spreads data symbol spreading achieved multiplying vector data symbols dft matrix produce vector coded data symbols coded data symbol mapped ofdm subcarrier via input bin inverse fast fourier transform ifft block contiguous subcarriers may selected achieve better frequency diversity non-contiguous subcarriers distributed wide frequency band used guard interval cyclic prefix cp added baseband ci-ofdm signal signal processed radio front-end convert rf signal transmitted antenna significant advantage ci-ofdm ofdm techniques ci spreading shapes time-domain characteristics transmitted waveform thus ci-ofdm signals much lower peak-to-average-power ratio papr crest factor compared types ofdm greatly improves power efficiency reduces cost power amplifiers used radio transmitter ci-ofdm receiver removes cyclic prefix received ci-ofdm transmission performs ofdm demodulation dft e.g. fft typically used ofdm receivers ci-spread symbol values collected respective subcarriers inverse-mapping process may equalized compensate multipath fading processed spatial demultiplexing ci de-spreader performs inverse-dft spread symbols recover original data symbols since ci coding shape time-domain characteristics transmitted waveform used synthesize various waveforms direct-sequence spread spectrum frequency shift key 4 signals advantage receiver select time-domain frequency-domain equalization based much scattering occurs transmission channel rich scattering environments frequency-domain equalization using ffts requires less computation conventional time-domain equalization performs substantially better ci introduced steve shattil scientist idris communications u.s. pat 5,955,992 filed february 12 1998 first many papers april 1999 concept inspired optical mode-locking frequency-domain synthesis using resonant cavity produces desired time-domain features transmitted optical signal radio systems users share subcarriers use different orthogonal ci codes achieve carrier interference multiple access cima via spectral interferometry mechanisms many applications ci principles published dozens subsequent patent filings conference papers journal articles ci frequency-hopped ofdm described international patent application wo 9941871 ci optical fiber communications mimo described us 7076168 us 6331837 describes spatial demultiplexing using multicarrier signals eliminates need multiple receiver antennas ci coding reference signals disclosed us 7430257 use ci linear network coding onion coding disclosed us 20080095121 random linear codes based natural multipath channel used encode transmitted signals routed nodes multi-hop peer-to-peer network similarity antenna array processing ci processing recognized since earliest work ci ci combined phased arrays continuous phase change subcarriers causes array ’ beam pattern scan space achieves transmit diversity represents early form cyclic delay diversity combinations ci coding mimo precoding studied idea using ci mimo pre-coded distributed antenna systems central coordination first disclosed provisional patent application 2001 ci-based software-defined radio sdr implemented four different protocol stacks developed idris 2000 described us 7418043 spread-ofdm spreading performed across orthogonal subcarriers produce transmit signal expressed x fsb f inverse dft spread-ofdm code matrix b data symbol vector inverse dft typically employs over-sampling factor dimension kxn k n number time-domain samples per ofdm symbol block whereas dimension spread-ofdm code matrix nxn receiver received spread-ofdm signal expressed r hfsb h represents channel matrix since use cyclic prefix ofdm changes toeplitz-like channel matrix circulant matrix received signal represented r fλffsb relationship h fλf definition circulant matrix λ diagonal matrix whose diagonal elements correspond first column circulant channel matrix h. receiver employs dft typical ofdm produce λsb trivial case identity matrix gives regular ofdm without spreading received signal also expressed r fλff λf b λf c circulant matrix defined c fλf λ circulant ’ diagonal matrix thus received signal r written r fλλfb fλλfb signal receiver dft λλfb spreading matrix include pre-equalization diagonal matrix e.g. λ λ case zero-forcing equalization performed receiver dft ofdm demodulator inverse-dft ci de-spreader simplest case ci-ofdm spreading matrix f i.e. λ ci spreading matrix nxn dft matrix since ofdm ’ over-sampled dft kxn k n basic ci spreading matrix performs like sinc pulse-shaping filter maps data symbol cyclically shifted orthogonally positioned pulse formed superposition ofdm subcarriers versions ci produce alternative pulse shapes selecting different diagonal matrices λ | [
5693,
911,
2117
] | Test |
5,995 | 3 | Mikie:mikie mikie 1984 arcade game produced konami object game guide student named mikie around school classroom locker room collect hearts make letter girlfriend mandy chased various members school staff teachers coaches cafeteria chefs defend game character either head-butt throw basketballs school members briefly stun push students rear end find hearts desks game starts mikie classroom mikie must bump students seats collect hearts 're sitting simultaneously avoiding classroom teacher hearts collected player allowed leave room enter school corridor school corridor mikie chased janitor classroom teacher follows outside way gain access rest school building room representing different challenge level mikie cued proper door enter large flashing opening door result mikie punched coiled boxing glove hairy foot stunning one doors however contains scantily clad girl opening door worth 5,000 points mikie also pick extra points picking lunch boxes opening grate contains burger soda addition head-butting enemies janitor classroom teacher also stunned slamming doors faces second room locker room objective break lockers get hearts pursued janitor cook classroom teacher addition head-butting three bins basketballs located around room mikie pick throw using action button bin holds three basketballs room three cafeteria mikie pursued two cooks classroom teacher one cook stands top room occasionally throws leg meat directly mikie table roasts 3 per table mikie hurl enemies room four sees student dance studio must avoid dancing girls stun well dance instructor yet classroom teacher final stage mikie avoiding football players garden outside school guarding hearts must collect attempting reach girlfriend mandy mikie initially underwent location testing japan international title graphics high school theme would used game overseas releases however konami chose release mike japan due game premise protagonist sneaking school incidents school violence time result alternative version produced japanese arcades titled replaces school setting workplace classroom first level becomes office teacher manager dance studio third level becomes ol office levels hallway gym restaurant outdoor garden mostly unchanged aside graphical modifications football players final level instead security guards game soundtrack features chiptunes rendition beatles songs hard day night twist shout permission granted jasrac japan license displayed instruction card printed circuit board revised version game titled high school graffiti mikie provided less violent action mikie physical attack changed head butt paralyzing shout death animation changed rolling around floor sobbing contrition glass jars mikie head butt three times retrieve heart inside replaced bundles three hearts providing effect without requiring player character head butt glass first level writing blackboard reads failure teaches success instead e=mc2 mikie shout effect classroom teacher completed step loops game version speed enemy characters increases even gaining new abilities mikie ported various home computers ocean software subsidiary imagine software versions released amstrad cpc acorn electron bbc micro commodore 64 zx spectrum sg-1000 version shinnyū shain tōru-kun also released exclusively japan sega | [
541
] | Test |
5,996 | 3 | Dracut_(software):dracut software dracut event-driven initramfs infrastructure dracut tool used create initramfs image copying tools files installed system combining dracut framework usually found /usr/lib/dracut/modules.d unlike existing initramfses dracut framework attempts little hard-coded initramfs possible initramfs basically one purpose—mounting root file system boot process transition real rootfs driven device availability therefore instead hard-coded scripts various things dracut initramfs depends udev create symbolic links device nodes rootfs device node appears mounts switches root helps keep time required initramfs things like 5-second boot made impossible result existence initramfs initramfs generation functionality dracut provided generator modules sourced main dracut tool install specific functionality initramfs live modules subdirectory use functionality provided dracut-functions work currently dracut supports booting btrfs dm raid md raid lvm2 device mapper multipath i/o dm-crypt cifs fcoe iscsi nbd nfs dracut-019 june 2012 introduced ability use systemd process 1 initramfs dracut available official repository distros including dracut default initramfs creation tool opensuse many others | [
3256,
2182,
3613,
7528,
7532,
5744,
6443,
2942,
6117,
4341,
5762,
412,
415,
3666,
2970,
7956,
5453,
5460,
7242,
1535,
1924,
6892,
1176,
1933,
5829,
7267,
1208,
6211,
4435,
5865,
7669,
3404,
1227,
1596,
165,
7312,
1607,
5884,
1991,
890,
... | Test |
5,997 | 4 | Interlock_protocol:interlock protocol interlock protocol described ron rivest adi shamir designed frustrate eavesdropper attack two parties use anonymous key exchange protocol secure conversation paper proposed using authentication protocol subsequently broken cryptographic protocols rely prior establishment secret public keys passwords however diffie–hellman key exchange protocol introduced concept two parties establishing secure channel least desirable security properties without prior agreement unauthenticated diffie–hellman anonymous key agreement protocol long known subject man middle attack however dream zipless mutually authenticated secure channel remained interlock protocol described method expose middle-man might try compromise two parties use anonymous key agreement secure conversation interlock protocol works roughly follows strength protocol lies fact half encrypted message decrypted thus mallory begins attack intercepts bob alice keys mallory unable decrypt alice half-message encrypted using key re-encrypt using bob key must wait halves message received read succeed duping one parties composes completely new message davies price proposed use interlock protocol authentication book titled security computer networks attack described steven m. bellovin michael merritt subsequent refinement proposed ellison bellovin/merritt attack entails composing fake message send first party passwords may sent using interlock protocol b follows ea b message encrypted key derived diffie–hellman exchange b 1 2 denote first second halves pa/pb passwords b attacker z could send half bogus message—p -- elicit pa point z compromised pa pb attack defeated verifying passwords parts ea z p 1 sent known invalid ea z pa 2 never sent suggested davies however work passwords hashed since half hash useless according bellovin also several methods proposed including using shared secret addition password forced-latency enhancement also prevent certain attacks modified interlock protocol require b server delay responses known duration data encrypted data immediately follows interlock protocol exchange could anything encoded using all-or-nothing transform prevent in-transit modification message 1 could contain encrypted request copy ka 2 could contain decryption key 1 mb 1 could contain encrypted copy kb mb 2 could contain decryption key mb 1 response ok found hash digest data mitm attempted using attack described bellovin paper z man-in-the-middle case receives data approximately 3*t since z perform interlocking exchange b hence attempted mitm attack detected session aborted course z could choose perform interlock protocol b opting instead send mb session would z z b z would n't middle reason interlock protocol effectively used provide authentication although ensure third party modify messages transit without detection | [
1353,
1805,
3426
] | Test |
5,998 | 9 | CommonJS:commonjs commonjs project goal establish conventions module ecosystem javascript outside web browser primary reason creation major lack commonly accepted form javascript scripts module units could reusable environments different provided conventional web browser e.g web server native desktop applications run javascript scripts project started mozilla engineer kevin dangoor january 2009 initially named serverjs august 2009 project renamed commonjs show broader applicability apis specifications created approved open process specification considered final finished multiple implementations commonjs affiliated ecma international group tc39 working ecmascript members tc39 participate project may 2013 isaac z. schlueter author npm package manager node.js said commonjs made obsolete node.js avoided core node.js developers list specifications includes | [
183,
5629,
2451,
3684,
4755,
4296,
6172,
3092,
1177,
562,
2658,
831,
7734,
313,
1016,
3719,
2040,
6368,
237,
54,
7848,
3398,
2870,
6660,
422,
340,
3663,
5172,
6400,
3584,
7687,
7505,
4287
] | Test |
5,999 | 2 | Honeywell_CP-6:honeywell cp-6 cp-6 discontinued computer operating system developed honeywell inc. 1976 backward-compatible work-alike xerox cp-v fully rewritten honeywell level/66 hardware cp-6 command line oriented system terminal emulator allowed use pcs cp-6 terminals 1975 xerox decided sell computer business purchased scientific data systems 1969 deal put together harry sweatt honeywell purchased xerox data systems took xerox sales field computer support staff provide field service support existing customer base xerox made available spare equipment supplies warehouses containing revenues shared 60/40 xerox cp-6 general release 60/40 honeywell three years thereafter following revenue went honeywell early 1960s honeywell built sold large number h200 machines together software 1970 bought computer business general electric cp-6 system including operating system program products developed beginning 1976 honeywell attract xerox cp-v users 750 sigma users buy use honeywell equipment honeywell employed initial team 60 programmers xerox cp-v development team added another 30 programmers plus management staff organized hank hoagland shel klee team housed old xerox marketing office 5250 w. century blvd los angeles became known los angeles development center ladc new operating system called cp-6 ladc reported administratively honeywell computer group phoenix facility honeywell acquired general electric first beta site installed carleton university ottawa canada june 1979 three sites installed end 1979 customers worked ladc directly exchange users group throughout specification development period review approve direction development compromises order feature implementation comshare major xerox customer operating system needed capacity service rapidly expanding timesharing business help ladc hardware engineers using xerox specifications honeywell engineers phoenix built 30 sigma 9 computers 24 comshare 6 customers project initiated 1978 machines sold original retail price delivered beginning third quarter 1979 1981 cp-6 modeled xerox cp-v code completely rewritten new high-level language pl-6 designed built expressly purpose rather assembly language cp-v increasing complexities new virtual addressing hardware honeywell ’ l66 dps 8 line rewrite existing weaknesses addressed many new features added like cp-v cp-6 five access modes operated concurrently batch processing remote batch timesharing transaction processing real-time processing included multiprogramming operated multiple cpus also like cp-v design integrated file management system files equally compatibly available programs executing mode files could sorted indexed keyed relative consecutive order new cp-6 use communications terminal interfaces minicomputer honeywell level 6 -based front-end processors connected locally remotely combination cp-6 included integrated software development system supported included set language processors apl basic cobol fortran rpg idp ids/ii sort/merge pl-6 gmap text formatting program text commonly needed software packages pascal snobol lisp spss bmdp imsl spiceii slam developed carleton university operating system supported inter-system communication job submission file transfer cp-6 systems cp-6 cp-v ibm hasp protocol systems system used communications terminal interfaces honeywell level 6 minicomputer-based front-end processor asynchronous bisynchronous tcp/ip communications protocols supported honeywell hardware system cp-6 consisted mainframe host processor l66 dps8 dps8000 dps90 connected disks tapes printers card equipment connected high-speed channel connected host level 6 mini computer provided processing connection terminals communications lines high-speed channel remote computers including ladc customers on-line support new version download problem fix patches terminal emulator allowed use pcs cp-6 terminals product additions mid eighties included adaptation dps8000 bull mainframe computers cp-6 included on-line problem reporting fix system beginning 1976 system named system technical action request star people oversaw star system starlords programmers direct access customers computers could fix problems directly on-line system used honeywell proprietary network | [
1522,
3509,
3440,
3855,
5571,
5932,
7383,
3807,
5948,
1774,
7858,
4543,
7496,
4106
] | Train |
6,000 | 2 | List_of_Microsoft_Windows_application_programming_interfaces_and_frameworks:list microsoft windows application programming interfaces frameworks following list microsoft apis frameworks | [
7149,
6420,
714,
720,
1460,
3280,
1840,
2928,
7907,
5747,
2953,
6840,
422,
1128,
4017,
6504,
4022,
4026,
7607,
1526,
3687,
2283,
5479,
7263,
5850,
150,
6933,
519,
3052,
4448,
3407,
3057,
1232,
2702,
7687,
1989,
4848,
2373,
4129,
5910,
8... | Test |
6,001 | 5 | P2PSP:p2psp p2psp peer peer straightforward protocol communication protocol application layer streaming multimedia content internet users play stream sync used build variety live broadcasting services ranging small meetings large systems iptv unlike traditional cs client-server cdn content delivery network based video streaming p2p contributes upstream bandwidth system therefore general p2p systems scalable architectures based model client-server .this protocol helps reducing bandwidth usage source broadcast using upload bandwidth peers connected source p2psp specially defined streaming live footage thus transmitted communications network based packet switching event occurring time way already created recorded events p2psp hybrid structure mesh network every peer connected star network sources every peer connected one server directly pure p2psp overlay lies one extreme one server every peer connected one part media sent peer turn sends part peers connected network extreme large group p2psp teams connected star structure results requirement upload bandwidth source since packet transmitted one time single/multiple source broadcast | [
7232,
6987,
1554
] | Test |
6,002 | 9 | Just-in-time_compilation:just-in-time compilation computing just-in-time jit compilation also dynamic translation run-time compilations way executing computer code involves compilation execution program – run time – rather prior execution often consists source code commonly bytecode translation machine code executed directly system implementing jit compiler typically continuously analyses code executed identifies parts code speedup gained compilation recompilation would outweigh overhead compiling code jit compilation combination two traditional approaches translation machine code – ahead-of-time compilation aot interpretation – combines advantages drawbacks roughly jit compilation combines speed compiled code flexibility interpretation overhead interpreter additional overhead compiling interpreting jit compilation form dynamic compilation allows adaptive optimization dynamic recompilation microarchitecture-specific speedups – thus theory jit compilation yield faster execution static compilation interpretation jit compilation particularly suited dynamic programming languages runtime system handle late-bound data types enforce security guarantees jit compilation applied programs used certain capacities particularly dynamic capacities regular expressions example text editor may compile regular expression provided runtime machine code allow faster matching – done ahead time pattern provided runtime several modern runtime environments rely jit compilation high-speed code execution including implementations java together microsoft .net framework similarly many regular-expression libraries feature jit compilation regular expressions either bytecode machine code jit compilation also used emulators order translate machine code one cpu architecture another common implementation jit compilation first aot compilation bytecode virtual machine code known bytecode compilation jit compilation machine code dynamic compilation rather interpretation bytecode improves runtime performance compared interpretation cost lag due compilation jit compilers translate continuously interpreters caching compiled code minimizes lag future execution code given run since part program compiled significantly less lag entire program compiled prior execution bytecode-compiled system source code translated intermediate representation known bytecode bytecode machine code particular computer may portable among computer architectures bytecode may interpreted run virtual machine jit compiler reads bytecodes many sections full rarely compiles dynamically machine code program run faster done per-file per-function even arbitrary code fragment code compiled executed hence name just-in-time cached reused later without needing recompiled contrast traditional interpreted virtual machine simply interpret bytecode generally much lower performance interpreter even interpret source code without step first compiling bytecode even worse performance statically-compiled code native code compiled prior deployment dynamic compilation environment one compiler used execution common goal using jit techniques reach surpass performance static compilation maintaining advantages bytecode interpretation much heavy lifting parsing original source code performing basic optimization often handled compile time prior deployment compilation bytecode machine code much faster compiling source deployed bytecode portable unlike native code since runtime control compilation like interpreted bytecode run secure sandbox compilers bytecode machine code easier write portable bytecode compiler already done much work jit code generally offers far better performance interpreters addition cases offer better performance static compilation many optimizations feasible run-time jit must render execute native binary image runtime true machine-code jits necessitate platforms allow data executed runtime making using jits harvard architecture-based machine impossible said certain operating systems virtual machines well however special type jit may potentially target physical machine cpu architecture rather optimized vm bytecode limitations raw machine code prevail especially bytecode vm eventually leverages jit native code jit causes slight noticeable delay initial execution application due time taken load compile bytecode sometimes delay called startup time delay warm-up time general optimization jit performs better code generate initial delay also increase jit compiler therefore make trade-off compilation time quality code hopes generate startup time increased io-bound operations addition jit compilation example rt.jar class data file java virtual machine jvm 40 mb jvm must seek lot data contextually huge file one possible optimization used sun hotspot java virtual machine combine interpretation jit compilation application code initially interpreted jvm monitors sequences bytecode frequently executed translates machine code direct execution hardware bytecode executed times saves compilation time reduces initial latency frequently executed bytecode jit compilation used run high speed initial phase slow interpretation additionally since program spends time executing minority code reduced compilation time significant finally initial code interpretation execution statistics collected compilation helps perform better optimization correct tradeoff vary due circumstances example sun java virtual machine two major modes—client server client mode minimal compilation optimization performed reduce startup time server mode extensive compilation optimization performed maximize performance application running sacrificing startup time java just-in-time compilers used runtime measurement number times method executed combined bytecode size method heuristic decide compile still another uses number times executed combined detection loops general much harder accurately predict methods optimize short-running applications long-running ones native image generator ngen microsoft another approach reducing initial delay ngen pre-compiles pre-jits bytecode common intermediate language image machine native code result runtime compilation needed .net framework 2.0 shipped visual studio 2005 runs ngen microsoft library dlls right installation pre-jitting provides way improve startup time however quality code generates might good one jited reasons code compiled statically without profile-guided optimization good jit compiled code extreme case lack profiling data drive instance inline caching also exist java implementations combine aot ahead-of-time compiler either jit compiler excelsior jet interpreter gnu compiler java earliest published jit compiler generally attributed work lisp john mccarthy 1960 seminal paper recursive functions symbolic expressions computation machine part mentions functions translated runtime thereby sparing need save compiler output punch cards although would accurately known compile go system another early example ken thompson 1968 gave one first applications regular expressions pattern matching text editor qed speed thompson implemented regular expression matching jiting ibm 7094 code compatible time-sharing system influential technique deriving compiled code interpretation pioneered mitchell 1970 implemented experimental language lc² smalltalk c. 1983 pioneered new aspects jit compilations example translation machine code done demand result cached later use memory became scarce system would delete code regenerate needed sun self language improved techniques extensively one point fastest smalltalk system world achieving half speed optimized c fully object-oriented language self abandoned sun research went java language term just-in-time compilation borrowed manufacturing term time popularized java james gosling using term 1993 currently jiting used implementations java virtual machine hotspot builds extensively uses research base hp project dynamo experimental jit compiler 'bytecode format machine code format system turned pa-6000 machine code pa-8000 machine code counterintuitively resulted speed ups cases 30 since permitted optimizations machine code level example inlining code better cache usage optimizations calls dynamic libraries many run-time optimizations conventional compilers able attempt 30 march 2019 php announced jit coming php 8 2021 jit compilation fundamentally uses executable data thus poses security challenges possible exploits implementation jit compilation consists compiling source code byte code machine code executing generally done directly memory – jit compiler outputs machine code directly memory immediately executes rather outputting disk invoking code separate program usual ahead time compilation modern architectures runs problem due executable space protection – arbitrary memory executed otherwise potential security hole thus memory must marked executable security reasons done code written memory marked read-only writable/executable memory security hole see w^x instance firefox jit compiler javascript introduced protection release version firefox 46 jit spraying class computer security exploits use jit compilation heap spraying – resulting memory executable allows exploit execution moved heap | [
5012,
2549,
2198,
6428,
3623,
4694,
1102,
1854,
3299,
4705,
5771,
4354,
7936,
5082,
1889,
6497,
2619,
4017,
3688,
6172,
5472,
6181,
1181,
2318,
4077,
6567,
154,
3746,
3747,
1990,
5190,
3761,
4116,
8064,
3772,
1265,
6982,
4864,
5218,
7357,... | Validation |
6,003 | 4 | Zardoz_(computer_security):zardoz computer security computer security zardoz list formally known security-digest list famous semi-private full disclosure mailing list run neil gorsuch 1989 1991 identified weaknesses systems gave directions find zardoz notable status perennial target computer hackers sought archives list information undisclosed software vulnerabilities access zardoz approved case-by-case basis gorsuch principally reference user account used send subscription requests requests approved root users valid uucp owners system administrators listed nic openness list users unix system administrators regular topic conversation participants expressing concern vulnerabilities exploitation details disclosed list liable spread hackers hand circulation zardoz postings among computer hackers open secret mocked openly famous phrack parody irc channel populated notable security experts majority zardoz participants unix systems administrators c software developers neil gorsuch gene spafford prolific contributors list | [
3932,
2272,
3486,
7246,
2912,
5687
] | Test |
6,004 | 4 | (ISC)²:isc ² international information system security certification consortium isc ² non-profit organization specializes training certifications cybersecurity professionals described world largest security organization widely known certification offered isc ² certified information systems security professional cissp certification mid-1980s need arose standardized vendor-neutral certification program provided structure demonstrated competence field security several professional societies recognized certification programs attesting qualifications information security personnel desperately needed june 1988 conference hosted national institutes standards technology nist federal information systems security educators association fissea idaho state university pocatello idaho address need standardized curriculum burgeoning profession organizations attendance included • canadian information processing society cips • computer security institute csi • data processing management association special interest group certified professionals dpma sig-cp • data processing management association special interest group computer security dpma sig-cs • idaho state university isu • information systems security association issa • international federation information processing ifip conference question raised virtually every group represented save nist isu creating professional certification conference participants agreed form consortium would attempt bring together competing agendas various organizations november 1988 special interest group computer security sig-cs member data processing management association dpma brought together several organizations interested isc ² formed mid-1989 non-profit organization goal mind 8 1990 first working committee establish something called common body knowledge cbk formed work done committee resulted first version cbk finalized 1992 cissp credential launched 1994 followed sscp credential 2001 cap credential 2005 csslp credential 2008 ccfp hcispp 2013 ccsp 2015 9 2001 isc ² established europe middle east africa regional office london 2002 isc ² opened asia-pacific regional office hong kong 2015 isc ² introduced north america regional office washington d.c since 2011 isc ² organizes annual isc ² security congress conference 2019 conference first international iteration event held orlando florida isc ² maintains calls common body knowledge information security following certifications certified ansi isc ² meets requirements ansi/iso/iec standard 17024 personnel certification accreditation program accreditation covers cissp sscp cissp-issap cissp-issep cissp-issmp cap csslp certifications isc ² certified professionals required earn continuous professional education cpe credits annual basis order maintain certifications cpe credits obtained attending industry events conferences writing articles/book reviews/books etc certified isc ² professionals required support isc ² code ethics violations code ethics investigated peer review panel within potential revoking certification isc ² along security certification organizations criticized lack education area ethics | [
904,
7192,
7234,
1366,
690,
6694,
3517,
1034,
4648,
2829,
7050
] | Train |
6,005 | 4 | Padvish_Antivirus:padvish antivirus padvish antivirus commonly known padvish antivirus software package developed iranian company amnpardaz amnpardaz padvish developed distributed home edition business edition server edition endpoint security android also free edition home users word padvish persian پادویش literally means antivirus padvish currently used local industries iei commonly referred saa iran | [
5452,
91,
4115,
4759,
7425,
3089,
4492,
1931,
4138,
385,
910,
1838,
6006,
2296,
4689,
5571,
4783,
3111,
7087,
496,
6644,
5144,
7193,
3123,
142,
935,
3561,
7478,
5601,
6043,
6305,
8134,
4456,
6777,
4645,
7597,
1435,
88
] | Test |
6,006 | 4 | Comodo_Group:comodo group comodo cybersecurity company headquartered clifton new jersey united states company founded 1998 united kingdom melih abdulhayoğlu company relocated united states 2004 products focused computer internet security firm operates certificate authority issues ssl certificates offers information security products enterprises consumers company also helped setting standards contributing ietf internet engineering task force dns certification authority authorization caa resource record comodo member following industry organizations response symantec comment asserting paid antivirus superior free antivirus ceo comodo group challenged symantec 18 september 2010 see whether paid free products better defend consumer malware gcn john breeden understood comodo stance free antivirus software challenging symantec actually pretty smart move based previous reviews av performance 've done gcn lab recent av review year showed functional difference free paid programs terms stopping viruses way many years fact go way back 2006 find av roundup viruses missed companies symantec responded saying comodo interested product included tests independent reviewers comodo volunteered symantec vs. comodo independent review though showdown take place comodo since included multiple independent reviews av-test pc world best antivirus reviews av-comparatives pc mag 23 march 2011 comodo posted report 8 days earlier 15 march 2011 user account affiliate registration authority compromised used create new user account issued nine certificate signing requests nine certificates seven domains issued attack traced ip address 212.95.136.18 originates tehran iran though firm initially reported breach result state-driven attack subsequently stated origin attack may result attacker attempting lay false trail. attack immediately thwarted comodo revoking bogus certificates comodo also stated actively looking ways improve security affiliates update 31 march 2011 comodo stated detected thwarted intrusion reseller user account 26 march 2011 new controls implemented comodo following incident 15 march 2011 removed risk fraudulent issue certificates comodo believed attack perpetrator incident 15 march 2011 regards second incident comodo stated ca infrastructure compromised keys hsms compromised certificates fraudulently issued attempt fraudulently access certificate ordering platform issue certificate failed 26 march 2011 person username comodohacker made several posts pastebin.com claiming iranian responsible attacks issues widely reported led criticism certificates issued revoked 2016 certificates remain revoked microsoft issued security advisory update address issue time event attacks unique comodo – specifics vary ca ca ra ra many entities trusted default holes deemed inevitable february 2015 comodo associated man-in-the-middle enabling tool known privdog claims protect users malicious advertising privdog issued statement 23 february 2015 saying minor intermittent defect detected third party library used privdog standalone application potentially affects small number users potential issue present privdog versions 3.0.96.0 3.0.97.0 potential issue present privdog plug-in distributed comodo browsers comodo distributed version users potentially maximum 6,294 users usa 57,568 users globally could potentially impact third party library used privdog third party library used superfish ... potential issue already corrected update tomorrow automatically update 57,568 users specific privdog versions 2009 microsoft mvp michael burgess accused comodo issuing digital certificates known malware comodo responded notified revoked issued certificates contained rogue malware january 2016 tavis ormandy reported comodo chromodo browser exhibited number vulnerabilities including disabling same-origin policy vulnerability n't browser based open-source code behind google chrome browser rather issue add-on soon comodo became aware issue early february 2016 company released statement fix industry software general always updated patched fixed addressed improved – goes hand hand development cycle ... critical software development companies address issue certain vulnerability found – ensuring never puts customer risk using chromodo immediately received update chromodo browser subsequently discontinued comodo ormandy noted comodo received excellence information security testing award verizon despite vulnerability browser despite vnc delivered default weak authentication despite enabling address space layout randomization aslr despite using access control lists acls throughout product ormandy opinion verizon certification methodology fault october 2015 comodo applied let encrypt comodo let encrypt let encrypt comodo trademarks trademark applications filed almost year internet security research group parent organization let encrypt started using name let encrypt publicly november 2014 despite fact comodo intent use trademark filings acknowledge never used let encrypt brand 24 june 2016 comodo publicly posted forum filed express abandonment trademark applications comodo chief technical officer robin alden said comodo filed express abandonment trademark applications time instead waiting allowing lapse following collaboration let encrypt comodo trademark issue resolved behind us 'd like thank let encrypt team helping bring resolution 25 july 2016 matthew bryant showed comodo website vulnerable dangling markup injection attacks send emails system administrators comodo servers approve wildcard certificate issue request used issue arbitrary wildcard certificates via comodo 30-day positivessl product bryant reached june 2016 25 july 2016 comodo chief technical officer robin alden confirmed fix put place within responsible disclosure date per industry standards | [
5452,
91,
4115,
363,
794,
6413,
8157,
7425,
3089,
4492,
1931,
4138,
385,
910,
1548,
1838,
3861,
2296,
2746,
2842,
4689,
7901,
4783,
3111,
6540,
7087,
496,
6644,
5144,
7193,
3123,
8103,
142,
935,
1395,
3561,
4071,
6005,
7567,
1401,
511,
... | Test |
6,007 | 7 | YouOS:youos youos web desktop web integrated development environment developed webshaka june 2008 domain acquired german startup company may 2015 project name youos representing mobile platform hyperlocal interaction youos technology used operate german refugee help support system angelaapp 2006 2008 youos replicated desktop environment modern operating system webpage using javascript communicate remote server allows users save current desktop state return later much like hibernation feature many true operating systems multiple users collaborate using single environment youos featured built-in sharing music documents files software alpha stage referred web operating system webshaka application programming interface ide integrated development environment currently development 700 applications created using api 2006 youos listed 7th position pc world list 20 innovative products year youos shut july 30 2008 developers actively developed since november 2006 also could find use since moved projects | [
2204,
1524,
2451,
5571
] | Validation |
6,008 | 4 | IntruShield:intrushield mcafee intrushield network-based intrusion prevention sensor appliance used prevention zero-day dos denial service attacks spyware malware botnets voip threats called mcafee network security platform ^^ broken ^^ | [
496
] | Test |
6,009 | 2 | Intuition_(Amiga):intuition amiga intuition native windowing system user interface ui engine amigaos developed almost entirely rj mical intuition confused workbench amigaos spatial file manager relies intuition handling windows input events intuition internal widget graphics system implemented primarily application-managed graphics library systems following xerox design done rather separate task maintains state standard ui elements independently application makes responsive ui gadgets live even application busy intuition task driven user events mouse keyboard input devices also arbitrates collisions mouse pointer icons control animated icons like guis day amiga intuition followed xerox lead anteceding solutions pragmatically command line interface also included extended functionality platform later releases added improvements like support high-color workbench screens 3d aspect replacement desktop file managers also made available directory opus magellan scalos interface initial releases used blue orange white black palettes intentional – time cheap high-quality video monitors commodore tested output worst televisions could find goal obtaining best possible contrast worst-case conditions due limitations intuition basic widget set developers adopted third-party gui toolkits magic user interface mui reaction object oriented ui engines driven classes graphic objects functions new standard gadgets animated buttons true-color icons etc offered developers standardized attractive interfaces mui similar systems abandoned separation user interface application specified gadgets displayed intuition task actually managed gadgets applications even busy modern day successors workbench environment include ambient morphos scalos workbench amigaos 4 wanderer aros brief article ambient descriptions mui icons menus gadgets aps.fr images zune stay main aros site new object-oriented toolkit amiga-like platforms amigaos morphos aros feelin introduced 2005 makes extensive use xml guidelines uses memory management system memory-pools system shares embedded os semaphores feelin also features non-centralized id allocation system crash-free object invocation mechanism advanced logging system details images feelin found website stewart alsop ii said 1988 intuition among several guis already knocked market apple ibm/microsoft others stating slapped together six months ... lack forethought vision shows criticized intuition drive letters lack network support hundreds small features | [
1152,
1154,
2451,
5983,
97,
4759,
1445,
3688,
1534,
2639,
6428,
7438,
6431,
2740,
8085,
6352,
3368,
1840,
2568,
307,
5833,
5661,
486,
4244,
405,
930,
6029,
3212,
6116,
7746,
7384,
5948,
1214,
5321,
594,
3222,
3398,
6933,
4354,
7573,
400... | Test |
6,010 | 3 | Sasa_(video_game):sasa video game sasa arcade video game released msx1 1984 later family computer titled 1985 video game involved obtaining capsules e sometimes suspended balloons main character could use bullets propel bullet count reaches 0 game ends player also lose bullets colliding enemy player player bullets | [
4023
] | Validation |
6,011 | 2 | PulseAudio:pulseaudio pulseaudio network-capable sound server program distributed via freedesktop.org project runs mainly linux various bsd distributions freebsd openbsd macos well illumos distributions solaris operating system microsoft windows previously supported via mingw toolchain implementation gnu toolchain includes various tools gcc binutils windows port updated since 2011 however pulseaudio free open-source software licensed terms gnu lesser general public license licensed version 2.1 aforementioned license created 2004 name polypaudio renamed 2006 pulseaudio pulseaudio acts sound server background process accepting sound input one sources processes capture devices etc created background process redirects mentioned sound sources one sinks sound cards remote network pulseaudio servers processes one goals pulseaudio reroute sound streams including processes attempt directly access hardware like legacy oss applications pulseaudio achieves providing adapters applications using audio systems like arts esd typical installation scenario linux user configures alsa use virtual device provided pulseaudio thus applications using alsa output sound pulseaudio uses alsa access real sound card pulseaudio also provides native interface applications want support pulseaudio directly well legacy interface esd applications making suitable drop-in replacement esd oss applications pulseaudio provides codice_1 utility replaces device files codice_2 tricking applications believing exclusive control sound card reality output rerouted pulseaudio libcanberra abstract api desktop event sounds total replacement pulseaudio sample cache api libsydney total replacement pulseaudio streaming api plans made libsydney eventually become audio api used pulseaudio main pulseaudio features include pulseaudio first appeared regular users fedora linux starting version 8 adopted major linux distributions ubuntu debian mageia mandriva linux linux mint opensuse openwrt support pulseaudio gnome project also kde integrated plasma workspaces adding support phonon kde multimedia framework kmix integrated mixer application well speaker setup gui aid configuration multi-channel speakers pulseaudio also available illumos distribution openindiana enabled default mate environment various linux-based mobile devices including nokia n900 nokia n9 palm pre use pulseaudio tizen open-source mobile operating system project linux foundation governed technical steering group tsg composed intel samsung uses pulseaudio jack sound server provides real-time low latency i.e 5 milliseconds less audio performance since jack2 supports efficient load balancing utilizing symmetric multiprocessing load audio clients distributed among several processors jack preferred sound server professional audio applications ardour rezound linuxsampler multiple free audio-production distributions use default audio server possible jack pulseaudio coexist jack running pulseaudio automatically connect jack client allowing pulseaudio clients make record sound time jack clients pipewire audio video server aims support usecases currently handled pulseaudio jack jack pulseaudio sound systems managed multi-purpose integrated audio solutions solutions fully cover mixing sound streaming process still used jack pulseaudio send final audio stream sound card | [
5268,
7959,
2091,
4759,
5017,
5103,
6883,
2728,
1267,
6984,
4229,
7075,
4685,
5571,
578,
7912,
6736,
1202,
1659,
2581,
5055,
2131,
2415,
4891,
415,
761,
2143,
5162,
2060,
3738,
2338,
5523,
3152,
6058,
352,
1989,
2260,
2706,
4461,
1435,
... | Test |
6,012 | 8 | Lotus_Foundations:lotus foundations lotus foundations bundled small-business server solutions package ibm package includes lotus domino directory services file management firewall backup web hosting various productivity tools product release direct result ibm acquisition net integration technologies integrated ibm lotus division original pre-acquisition product based net integrator mark 1 server appliance nitix autonomic linux server os lotus foundations introduced market hardware appliance late 2008 software-only appliance also made available 2010 lotus foundations hardware appliance discontinued software-only appliance followed suit february 2011 june 2011 however lotus foundations software appliance reinstated sale ibm sell directly anymore distributing selected business partners instead ibm lotus foundations products withdrawn marketing march 14 2013 longer available purchase support ibm lotus foundations products withdrawn september 30 2014 lotus domino ibm server product provides enterprise-grade e-mail collaboration capabilities custom application platform used application server lotus notes applications and/or web server also built-in database system nsf format lotus foundations firewall gui-based designed ease use features auto-configuration firewall settings firewall allows incoming ftp active passive mode http https smtp allowing outgoing dns ftp http https telnet well imap pop3 smtp mail protocols | [
5868,
2043,
7765,
6908,
578,
1014
] | Test |
6,013 | 8 | AT_Internet:internet internet privately held company provides web analytics services consulting websites intranet mobile sites mobile applications provided services since 1995 company commonly known especially france former name flagship product internet application analytics suite used approximately 20,000 websites mobile applications worldwide company founded 1995 owner alain llorens web agency group focus shifted web analytics 1997 2011 internet recognized strong performer forrester wave™ web analytics q4 2011 report forrester research inc 2014 internet featured latest edition forrester report forrester wave™ web analytics q2 2014 named one 4 top providers web analytics software worldwide 2015 internet launched analytics suite integrated suite applications analytics reporting dashboard creation data visualization data mining app analytics data export 2016 company raised total €4 million funding r recruiting bpifrance cic coface european regional development fund nouvelle-aquitaine region raised €6.5 million 2013 internet provides tools enabling companies organizations measure analyse visitors arrive website mobile site mobile application well subsequent actions behaviors site information visualized dashboards reports shared across organization internet software integrated approximately 30 digital marketing applications company offers specialized consulting services on-site remote france data protection authority cnil recognized internet analytics suite full compliance french cookie regulations audience measurement application granted exemption cnil obtaining cookie consent analytics suite certified independent measurement organizations worldwide including uk abc kia-index tüv saarland ojd espana france acpm according company software complies requirements european commission general data protection regulation data processed europe stored proprietary servers france | [
4600
] | Validation |
6,014 | 3 | Conventional_PCI:conventional pci conventional pci often shortened pci local computer bus attaching hardware devices computer pci abbreviation peripheral component interconnect part pci local bus standard pci bus supports functions found processor bus standardized format independent particular processor native bus devices connected pci bus appear bus master connected directly bus assigned addresses processor address space parallel bus synchronous single bus clock attached devices take either form integrated circuit fitted onto motherboard called planar device pci specification expansion card fits slot pci local bus first implemented ibm pc compatibles displaced combination several slow isa slots one fast vesa local bus slot bus configuration subsequently adopted computer types typical pci cards used pcs include network cards sound cards modems extra ports usb serial tv tuner cards disk controllers pci video cards replaced isa vesa cards growing bandwidth requirements outgrew capabilities pci preferred interface video cards became agp superset pci giving way pci express first version pci found retail desktop computers 32-bit bus using 33 mhz bus clock 5 v signalling although pci 1.0 standard provided 64-bit variant well one locating notch card version 2.0 pci standard introduced 3.3 v slots physically distinguished flipped physical connector prevent accidental insertion 5 v cards universal cards operate either voltage two notches version 2.1 pci standard introduced optional 66 mhz operation server-oriented variant pci called pci-x pci extended operated frequencies 133 mhz pci-x 1.0 533 mhz pci-x 2.0 internal connector laptop cards called mini pci introduced version 2.2 pci specification pci bus also adopted external laptop connector standard cardbus first pci specification developed intel subsequent development standard became responsibility pci special interest group pci-sig conventional pci pci-x sometimes called parallel pci order distinguish technologically recent successor pci express adopted serial lane-based architecture pci heyday desktop computer market approximately 1995–2005 pci pci-x become obsolete purposes however still common modern desktops purposes backwards compatibility low relative cost produce many kinds devices previously available pci expansion cards commonly integrated onto motherboards available usb pci express versions work pci began intel architecture development lab team intel engineers composed primarily adl engineers defined architecture developed proof concept chipset platform saturn partnering teams company desktop pc systems core logic product organizations pci immediately put use servers replacing mca eisa server expansion bus choice mainstream pcs pci slower replace vesa local bus vlb gain significant market penetration late 1994 second-generation pentium pcs 1996 vlb extinct manufacturers adopted pci even 486 computers eisa continued used alongside pci 2000 apple computer adopted pci professional power macintosh computers replacing nubus mid-1995 consumer performa product line replacing lc pds mid-1996 64-bit version plain pci remained rare practice though although used example post-imac g3 g4 power macintosh computers later revisions pci added new features performance improvements including 66 mhz 3.3 v standard 133 mhz pci-x adaptation pci signaling form factors pci-x 1.0b pci-x 2.0 backward compatible pci standards revisions used server hardware consumer pc hardware remained nearly 32 bit 33 mhz 5 volt pci-sig introduced serial pci express time renamed pci conventional pci since motherboard manufacturers included progressively fewer pci slots favor new standard many new motherboards provide pci slots late 2013 pci provides separate memory i/o port address spaces x86 processor family 64 32 bits respectively addresses address spaces assigned software third address space called pci configuration space uses fixed addressing scheme allows software determine amount memory i/o address space needed device device request six areas memory space i/o port space via configuration space registers typical system firmware operating system queries pci buses startup time via pci configuration space find devices present system resources memory space i/o space interrupt lines etc needs allocates resources tells device allocation pci configuration space also contains small amount device type information helps operating system choose device drivers least dialogue user system configuration devices may on-board rom containing executable code x86 pa-risc processors open firmware driver efi driver typically necessary devices used system startup device drivers loaded operating system addition pci latency timers mechanism pci bus-mastering devices share pci bus fairly fair case means devices use large portion available pci bus bandwidth devices able get needed work done note apply pci express devices required follow protocol interrupt lines shared pci bus includes four interrupt lines available device however wired parallel pci bus lines positions interrupt lines rotate slots appears one device inta line intb next intc one single-function devices use inta interrupt signaling device load spread fairly evenly across four available interrupt lines alleviates common problem sharing interrupts mapping pci interrupt lines onto system interrupt lines pci host bridge implementation-dependent platform-specific bios code meant know set interrupt line field device configuration space indicating irq connected pci interrupt lines level-triggered chosen edge-triggering order gain advantage servicing shared interrupt line robustness edge triggered interrupts easy miss later revisions pci specification add support message-signaled interrupts system device signals need service performing memory write rather asserting dedicated line alleviates problem scarcity interrupt lines even interrupt vectors still shared suffer sharing problems level-triggered interrupts also resolves routing problem memory write unpredictably modified device host finally message signaling in-band resolves synchronization problems occur posted writes out-of-band interrupt lines pci express physical interrupt lines uses message-signaled interrupts exclusively specifications represent common version pci used normal pcs pci specification also provides options 3.3 v signaling 64-bit bus width 66 mhz clocking commonly encountered outside pci-x support server motherboards pci bus arbiter performs bus arbitration among multiple masters pci bus number bus masters reside pci bus well requests bus one pair request grant signals dedicated bus master typical pci cards either one two key notches depending signaling voltage cards requiring 3.3 volts notch 56.21 mm card backplate requiring 5 volts notch 104.47 mm backplate allows cards fitted slots voltage support universal cards accepting either voltage key notches pci connector defined 62 contacts side edge connector two four replaced key notches card 60 58 contacts side side refers 'solder side side b refers 'component side card held connector pointing view side backplate right whereas view side b backplate left pinout b sides follows looking motherboard connector pins a1 b1 closest backplate 64-bit pci extends additional 32 contacts side provide ad 63:32 c/be 7:4 par64 parity signal number power ground pins lines connected slot parallel exceptions notes 32-bit pci cards function properly 64-bit pci-x slots bus clock rate limited clock frequency slowest card inherent limitation pci shared bus topology example pci 2.3 66-mhz peripheral installed pci-x bus capable 133 mhz entire bus backplane limited 66 mhz get around limitation many motherboards two pci/pci-x buses one bus intended use high-speed pci-x peripherals bus intended general-purpose peripherals many 64-bit pci-x cards designed work 32-bit mode inserted shorter 32-bit connectors loss performance example adaptec 29160 64-bit scsi interface card however 64-bit pci-x cards work standard 32-bit pci slots installing 64-bit pci-x card 32-bit slot leave 64-bit portion card edge connector connected overhanging requires motherboard components positioned mechanically obstruct overhanging portion card edge connector maximum width pci card 15.24 mm 0.6 inches two bracket heights specified known full-height low-profile bracket backplate part fastens card cage stabilize card also usually contains external connectors attaches window computer case connectors accessible outside backplate typically fixed case either 6-32 m3 screw separate hold-down bracket part case bracket height two different lengths specified total four lengths known full-length half-length full-height cards md1 md2 low-profile cards original full-height cards defined bracket height 120 mm 4.7 inches height full-height cards nominally 107 mm 4.2 inches height includes card edge connector two lengths defined full-height cards known full-length half-length original full-length full-height pci card also known full-size specified length 312 mm 12.283 inches height 107 mm 4.2 inches however modern pci cards half-length smaller see many modern pc cases accommodate length full-size card note length length printed circuit board include angled short leg metal bracket affect e.g packaging dimensions high power pci products active cooling systems extend past nominal dimensions likewise may take one slot space referred double-wide triple-wide cards accordingly half-length full-height card length 175.26 mm 6.9 inches height 107 mm 4.2 inches actual dimensions many cards described half-length full-height lower maximums still fit standard full-height pci slot long use properly located full-height bracket fact practical de facto standard majority modern pci cards fit inside envelope low-profile pci cards also known lppci half-height cards defined bracket reduced height 79.2 mm 3.118 inches low-profile specification assumes 3.3 volt pci slot retention screw also moved 1.35 mm closer fold bracket low profile card maximum height 64.41 mm 2.536 inches including edge connector smaller bracket fit standard desktop tower 3u rack-mount pc case fit many newer small form-factor sff desktop cases 2u rack-mount case cards may known names slim many manufacturers supply types bracket cards bracket typically attached card pair screws allowing installer easily change pci-sig defined two standard lengths low-profile cards known md1 md2 md1 defines shortest 32-bit pci card length 119.91 mm 4.721 inches maximum height 64.41 mm 2.536 inches md2 defines maximum length low profile pci card 167.64 mm 6.600 inches maximum height 64.41 mm 2.536 inches low profile pci card longer md1 length considered md2 card common low-profile card form-factor beside conventional pci many pci express cards also described md2 low-profile form-factor mini pci added pci version 2.2 use laptops uses 32-bit 33 mhz bus powered connections 3.3 v 5 v limited 100 support bus mastering dma standard size mini pci cards approximately quarter full-sized counterparts access card outside case unlike desktop pci cards brackets carrying connectors limits kinds functions mini pci card perform many mini pci devices developed wi-fi fast ethernet bluetooth modems often winmodems sound cards cryptographic accelerators scsi ide–ata sata controllers combination cards mini pci cards used regular pci-equipped hardware using mini pci-to-pci converters mini pci superseded much narrower pci express mini card mini pci cards 2 w maximum power consumption limits functionality implemented form factor also required support clkrun pci signal used start stop pci clock power management purposes three card form factors type type ii type iii cards card connector used type include type ii use 100-pin stacking connector type iii uses 124-pin edge connector i.e connector types ii differs type iii connector edge card like so-dimm additional 24 pins provide extra signals required route i/o back system connector audio ac-link lan phone-line interface type ii cards rj11 rj45 mounted connectors cards must located edge computer docking station rj11 rj45 ports mounted external access mini pci distinct 144-pin micro pci pc/104-plus pci-104 embedded form factors include stacking 120 pin pci connector typically consumer systems specify n × pci slots without specifying actual dimensions space available small-form-factor systems may sufficient allow even half-length pci cards fit despite limitation systems still useful many modern pci cards considerably smaller half-length pci bus traffic consists series pci bus transactions transaction consists address phase followed one data phases direction data phases may initiator target write transaction vice versa read transaction data phases must direction either party may pause halt data phases point one common example low-performance pci device support burst transactions always halts transaction first data phase pci device may initiate transaction first must request permission pci bus arbiter motherboard arbiter grants permission one requesting devices initiator begins address phase broadcasting 32-bit address plus 4-bit command code waits target respond devices examine address one responds cycles later 64-bit addressing done using two-stage address phase initiator broadcasts low 32 address bits accompanied special dual address cycle command code devices support 64-bit addressing simply respond command code next cycle initiator transmits high 32 address bits plus real command code transaction operates identically point ensure compatibility 32-bit pci devices forbidden use dual address cycle necessary i.e high-order address bits zero pci bus transfers 32 bits per data phase initiator transmits 4 active-low byte enable signals indicating 8-bit bytes considered significant particular write must affect enabled bytes target pci device little importance memory reads i/o reads might side effects pci standard explicitly allows data phase bytes enabled must behave no-op pci three address spaces memory i/o address configuration memory addresses 32 bits optionally 64 bits size support caching burst transactions i/o addresses compatibility intel x86 architecture i/o port address space although pci bus specification allows burst transactions address space devices support memory addresses i/o finally pci configuration space provides access 256 bytes special configuration registers per pci device pci slot gets configuration space address range registers used configure devices memory i/o address ranges respond transaction initiators computer first turned pci devices respond configuration space accesses computer bios scans devices assigns memory i/o address ranges address claimed device transaction initiator address phase time causing initiator abort operation case reads customary supply all-ones read data value 0xffffffff case pci devices therefore generally attempt avoid using all-ones value important status registers error easily detected software 16 possible 4-bit command codes 12 assigned exception unique dual address cycle least significant bit command code indicates whether following data phases read data sent target initiator write data sent initiator target pci targets must examine command code well address respond address phases specify unsupported command code commands refer cache lines depend pci configuration space cache line size register set properly may used done soon promulgation pci specification discovered lengthy transactions devices due slow acknowledgments long data bursts combination could cause buffer underrun overrun devices recommendations timing individual phases revision 2.0 made mandatory revision 2.1 additionally revision 2.1 initiators capable bursting two data phases must implement programmable latency timer timer starts counting clock cycles transaction starts initiator asserts frame timer expired arbiter removed gnt initiator must terminate transaction next legal opportunity usually next data phase memory write invalidate transactions must continue end cache line devices unable meet timing restrictions must use combination posted writes memory writes delayed transactions writes reads delayed transaction target records transaction including write data internally aborts asserts stop rather trdy first data phase initiator must retry exactly transaction later interim target internally performs transaction waits retried transaction retried transaction seen buffered result delivered device may target transactions completing one delayed transaction must remember transaction type address byte selects write data value complete correct transaction target limit number delayed transactions record internally simple targets may impose limit 1 force transactions retry without recording dealt current delayed transaction completed two initiators attempt transaction delayed transaction begun one may result delivered harmless target abandons delayed transaction retry succeeds delivering buffered result bus reset 2=32768 clock cycles approximately 1 ms elapse without seeing retry latter never happen normal operation prevents deadlock whole bus one initiator reset malfunctions pci standard permits multiple independent pci buses connected bus bridges forward operations one bus another required although pci tends use many bus bridges pci express systems use many pci express slot appears separate bus connected bridge others generally bus bridge sees transaction one bus must forwarded original transaction must wait forwarded transaction completes result ready one notable exception occurs case memory writes bridge may record write data internally room signal completion write forwarded write completed indeed begun sent yet arrived writes referred posted writes analogy postal mail message although offer great opportunity performance gains rules governing permissible somewhat intricate pci standard permits bus bridges convert multiple bus transactions one larger transaction certain situations improve efficiency pci bus pci bus transactions controlled five main control signals two driven initiator transaction frame irdy three driven target devsel trdy stop two additional arbitration signals req gnt used obtain permission initiate transaction active-low meaning active asserted state low voltage pull-up resistors motherboard ensure remain high inactive deasserted driven device pci bus depend resistors change signal level devices drive signals high one cycle ceasing drive signals pci bus signals sampled rising edge clock signals nominally change falling edge clock giving pci device approximately one half clock cycle decide respond signals observed rising edge one half clock cycle transmit response device pci bus requires every time device driving pci bus signal changes one turnaround cycle must elapse time one device stops driving signal device starts without might period devices driving signal would interfere bus operation combination turnaround cycle requirement drive control line high one cycle ceasing drive means main control lines must high minimum two cycles changing owners pci bus protocol designed rarely limitation special cases notably fast back-to-back transactions necessary insert additional delay meet requirement device pci bus capable acting bus master may initiate transaction device ensure one transaction initiated time master must first wait bus grant signal gnt arbiter located motherboard device separate request line req requests bus arbiter may park bus grant signal device current requests arbiter may remove gnt time device loses gnt may complete current transaction may start one asserting frame unless observes gnt asserted cycle begins arbiter may also provide gnt time including another master transaction transaction either frame irdy asserted deasserted bus idle device may initiate transaction time gnt asserted bus idle pci bus transaction begins address phase initiator seeing gnt bus idle drives target address onto ad 31:0 lines associated command e.g memory read i/o write c/be 3:0 lines pulls frame low device examines address command decides whether respond target asserting devsel device must respond asserting devsel within 3 cycles devices promise respond within 1 2 cycles said fast devsel medium devsel respectively actually time respond 2.5 cycles since pci devices must transmit signals half cycle early received three cycles later note device must latch address first cycle initiator required remove address command bus following cycle even receiving devsel response additional time available interpreting address command captured fifth cycle address phase earlier devices medium devsel faster catch-all subtractive decoding allowed address ranges commonly used isa bus bridge addresses within range 24 bits memory 16 bits i/o sixth cycle response initiator may abort transaction deasserting frame known master abort termination customary pci bus bridges return all-ones data 0xffffffff case pci devices therefore generally designed avoid using all-ones value important status registers error easily detected software rising edge clock 0 initiator observes frame irdy high gnt low drives address command asserts frame time rising edge clock 1 targets latch address begin decoding may respond devsel time clock 2 fast devsel 3 medium 4 slow subtractive decode devices seeing response clock 4 may respond clock 5 master see response clock 5 terminate transaction remove frame clock 6 trdy stop deasserted high address phase initiator may assert irdy soon ready transfer data could theoretically soon clock 2 allow 64-bit addressing master present address two consecutive cycles first sends low-order address bits special dual-cycle address command c/be 3:0 following cycle sends high-order address bits actual command dual-address cycles forbidden high-order address bits zero devices support 64-bit addressing simply respond dual cycle commands addresses pci configuration space access decoded specially low-order address lines specify offset desired pci configuration register high-order address lines ignored instead additional address signal idsel input must high device may assert devsel slot connects different high-order address line idsel pin selected using one-hot encoding upper address lines address phase specifically beginning cycle devsel goes low comes burst one data phases cases initiator drives active-low byte select signals c/be 3:0 lines data ad 31:0 may driven initiator case writes target case reads data phases c/be 3:0 lines interpreted active-low byte enables case write asserted signals indicate four bytes ad bus written addressed location case read indicate bytes initiator interested reads always legal ignore byte enable signals simply return 32 bits cacheable memory resources required always return 32 valid bits byte enables mainly useful i/o space accesses reads side effects data phase four c/be lines deasserted explicitly permitted pci standard must effect target advance address burst access progress data phase continues parties ready complete transfer continue next data phase initiator asserts irdy initiator ready longer needs wait target asserts trdy target ready whichever side providing data must drive ad bus asserting ready signal one participants asserts ready signal may become un-ready otherwise alter control signals end data phase data recipient must latch ad bus cycle sees irdy trdy asserted marks end current data phase indicates just-latched data word transferred maintain full burst speed data sender half clock cycle seeing irdy trdy asserted drive next word onto ad bus continues address cycle illustrated assuming single address cycle medium devsel target responds time clock 3 however time neither side ready transfer data clock 4 initiator ready target clock 5 ready data transfer takes place indicated vertical lines clock 6 target ready transfer initiator clock 7 initiator becomes ready data transferred clocks 8 9 sides remain ready transfer data data transferred maximum possible rate 32 bits per clock cycle case read clock 2 reserved turning around ad bus target permitted drive data bus even capable fast devsel target supports fast devsel could theory begin responding read cycle address presented cycle however reserved ad bus turnaround thus target may drive ad bus thus may assert trdy second cycle transaction note targets fast need special logic enforce condition either side may request burst end current data phase simple pci devices support multi-word bursts always request immediately even devices support bursts limit maximum length support end addressable memory initiator mark data phase final one transaction deasserting frame time asserts irdy cycle target asserts trdy final data transfer complete sides deassert respective rdy signals bus idle master may deassert frame asserting irdy may deassert frame waiting irdy asserted target assert trdy minor exception master abort termination target responds devsel obviously pointless wait trdy case however even case master must assert irdy least one cycle deasserting frame commonly master assert irdy receiving devsel must simply hold irdy asserted one cycle longer ensure bus turnaround timing rules obeyed frame line target requests initiator end burst asserting stop initiator end transaction deasserting frame next legal opportunity wishes transfer data continue separate transaction several ways target always least one cycle target-initiated disconnection allow master deassert frame two sub-cases take amount time one requires additional data phase initiator ends burst time target requests disconnection additional bus cycle memory space accesses words burst may accessed several orders unnecessary low-order address bits ad 1:0 used convey initiator requested order target support particular order must terminate burst first word orders depend cache line size configurable pci devices starting offset within cache line zero modes reduce order cache line toggle cache line wrap modes two forms critical-word-first cache line fetching toggle mode xors supplied address incrementing counter native order intel 486 pentium processors advantage necessary know cache line size implement pci version 2.1 obsoleted toggle mode added cache line wrap mode fetching proceeds linearly wrapping around end cache line one cache line completely fetched fetching jumps starting offset next cache line note pci devices support limited range typical cache line sizes cache line size programmed unexpected value force single-word access pci also supports burst access i/o configuration space linear mode supported rarely used may buggy devices may support properly force single-word access either highest-possible speed four-word write burst terminated master clock edge 1 initiator starts transaction driving address command asserting frame signals idle indicated ^^^ pulled high motherboard pull-up resistors might turnaround cycle cycle 2 target asserts devsel trdy initiator also ready data transfer occurs repeats three cycles last one clock edge 5 master deasserts frame indicating end clock edge 6 ad bus frame undriven turnaround cycle control lines driven high 1 cycle clock edge 7 another initiator start different transaction also turnaround cycle control lines equivalent read burst takes one cycle target must wait 1 cycle ad bus turn around may assert trdy high-speed burst terminated target extra cycle end clock edge 6 target indicates wants stop data initiator already holding irdy low fifth data phase clock edge 7 data transferred pci bus detects parity errors attempt correct retrying operations purely failure indication due need detect parity error happened pci bus actually detects cycles later data phase whichever device driving ad 31:0 lines computes even parity c/be 3:0 lines sends par line one cycle later access rules turnaround cycles ad bus apply par line one cycle later device listening ad bus checks received parity asserts perr parity error line one cycle generally generates processor interrupt processor search pci bus device detected error perr line used data phases target selected parity error detected address phase data phase special cycle devices observe assert serr system error line even bytes masked c/be lines use must still defined value value must used compute parity due need turnaround cycle different devices driving pci bus signals general necessary idle cycle pci bus transactions however circumstances permitted skip idle cycle going directly final cycle one transfer irdy asserted frame deasserted first cycle next frame asserted irdy deasserted initiator may perform back-to-back transactions additional timing constraints may come need turn around target control lines particularly devsel target deasserts devsel driving high cycle following final data phase case back-to-back transactions first cycle address phase second cycle address phase reserved devsel turnaround target different previous one must assert devsel third cycle medium devsel speed one case problem arise initiator knows somehow presumably addresses share sufficient high-order bits second transfer addressed target previous one case may perform back-to-back transactions pci targets must support also possible target keeps track requirements never fast devsel met trivially must wait medium devsel time unless targets capability indicate special bit pci configuration register targets bus initiators may use back-to-back transfers freely subtractive decoding bus bridge must know expect extra delay event back-to-back cycles order advertise back-to-back support starting revision 2.1 pci specification includes optional 64-bit support provided via extended connector provides 64-bit bus extensions ad 63:32 c/be 7:4 par64 number additional power ground pins 64-bit pci connector distinguished 32-bit connector additional 64-bit segment memory transactions 64-bit devices may use 64 bits double data transfer rate non-memory transactions including configuration i/o space accesses may use 64-bit extension 64-bit burst burst addressing works 32-bit transfer address incremented twice per data phase starting address must 64-bit aligned i.e ad2 must 0 data corresponding intervening addresses ad2 1 carried upper half ad bus initiate 64-bit transaction initiator drives starting address ad bus asserts req64 time frame selected target support 64-bit transfer transaction replies asserting ack64 time devsel note target may decide per-transaction basis whether allow 64-bit transfer req64 asserted address phase initiator also drives high 32 bits address copy bus command high half bus address requires 64 bits dual address cycle still required high half bus carries upper half address final command code address phase cycles allows 64-bit target see entire address begin responding earlier initiator sees devsel asserted without ack64 performs 32-bit data phases data would transferred upper half bus first data phase instead transferred second data phase typically initiator drives 64 bits data seeing devsel ack64 missing may cease driving upper half data bus req64 ack64 lines held asserted entire transaction save last data phase deasserted time frame devsel respectively par64 line operates like par line provides even parity ad 63:32 c/be 7:4 valid address phases req64 asserted par64 valid data phases req64 ack64 asserted pci originally included optional support write-back cache coherence required support cacheable memory targets would listen two pins cache bus sdone snoop done sbo snoop backoff rarely implemented practice deleted revision 2.2 pci specification pins re-used smbus access revision 2.3 cache would watch memory accesses without asserting devsel noticed access might cached would drive sdone low snoop done coherence-supporting target would avoid completing data phase asserting trdy observed sdone high case write data clean cache cache would invalidate copy would assert sdone soon established however cache contained dirty data cache would write back access could proceed would assert sbo raising sdone would signal active target assert stop rather trdy causing initiator disconnect retry operation later meantime cache would arbitrate bus write data back memory targets supporting cache coherency also required terminate bursts cross cache lines developing and/or troubleshooting pci bus examination hardware signals important logic analyzers bus analyzers tools collect analyze decode signals users view useful ways | [
4657,
447,
7064,
7339,
4767,
4397,
1926,
7974,
1640,
1933,
5920,
3012,
4321,
5571,
5489,
6823,
1761,
5853,
1667,
6830,
7569,
6754,
1778,
763,
3905,
768,
7212,
3230,
6945,
5963,
8139,
4551,
6236,
4277,
352,
5884,
3755
] | Validation |
6,015 | 9 | PDF:pdf portable document format pdf redundantly pdf format file format developed adobe 1990s present documents including text formatting images manner independent application software hardware operating systems based postscript language pdf file encapsulates complete description fixed-layout flat document including text fonts vector graphics raster images information needed display pdf standardized iso 32000 2008 longer requires royalties implementation today pdf files may contain variety content besides flat text graphics including logical structuring elements interactive elements annotations form-fields layers rich media including video content three dimensional objects using u3d prc various data formats pdf specification also provides encryption digital signatures file attachments metadata enable workflows requiring features adobe systems made pdf specification available free charge 1993 early years pdf popular mainly desktop publishing workflows competed variety formats djvu envoy common ground digital paper farallon replica even adobe postscript format pdf proprietary format controlled adobe released open standard july 1 2008 published international organization standardization iso 32000-1:2008 time control specification passed iso committee volunteer industry experts 2008 adobe published public patent license iso 32000-1 granting royalty-free rights patents owned adobe necessary make use sell distribute pdf compliant implementations pdf 1.7 sixth edition pdf specification became iso 32000-1 includes proprietary technologies defined adobe adobe xml forms architecture xfa javascript extension acrobat referenced iso 32000-1 normative indispensable full implementation iso 32000-1 specification proprietary technologies standardized specification published adobe ’ website many also supported popular third-party implementations pdf july 28 2017 iso 32000-2:2017 pdf 2.0 published iso 32000-2 include proprietary technologies normative references pdf combines three technologies postscript page description language run interpreter generate image process requiring many resources handle graphics standard features programming languages codice_1 codice_2 commands pdf largely based postscript simplified remove flow control features like graphics commands codice_3 remain often postscript-like pdf code generated source postscript file graphics commands output postscript code collected tokenized files graphics fonts document refers also collected everything compressed single file therefore entire postscript world fonts layout measurements remains intact document format pdf several advantages postscript pdf file 7-bit ascii file except certain elements may binary content pdf file starts header containing magic number version format codice_4 format subset cos carousel object structure format cos tree file consists primarily objects eight types furthermore may comments introduced percent sign codice_9 comments may contain 8-bit characters objects may either direct embedded another object indirect indirect objects numbered object number generation number defined codice_10 codice_11 keywords index table also called cross-reference table marked codice_12 keyword follows main body gives byte offset indirect object start file design allows efficient random access objects file also allows small changes made without rewriting entire file incremental update beginning pdf version 1.5 indirect objects may also located special streams known object streams technique reduces size files large numbers small indirect objects especially useful tagged pdf end pdf file trailer introduced codice_13 keyword contains dictionary contains two layouts pdf files non-linear optimized linear optimized non-linear pdf files consume less disk space linear counterparts though slower access portions data required assemble pages document scattered throughout pdf file linear pdf files also called optimized web optimized pdf files constructed manner enables read web browser plugin without waiting entire file download since written disk linear page order fashion pdf files may optimized using adobe acrobat software qpdf basic design graphics represented pdf similar postscript except use transparency added pdf 1.4 pdf graphics use device-independent cartesian coordinate system describe surface page pdf page description use matrix scale rotate skew graphical elements key concept pdf graphics state collection graphical parameters may changed saved restored page description pdf version 1.6 24 graphics state properties important postscript vector graphics pdf constructed paths paths usually composed lines cubic bézier curves also constructed outlines text unlike postscript pdf allow single path mix text outlines lines curves paths stroked filled clipping strokes fills use color set graphics state including patterns pdf supports several types patterns simplest tiling pattern piece artwork specified drawn repeatedly may colored tiling pattern colors specified pattern object uncolored tiling pattern defers color specification time pattern drawn beginning pdf 1.3 also shading pattern draws continuously varying colors seven types shading pattern simplest axial shade type 2 radial shade type 3 raster images pdf called image xobjects represented dictionaries associated stream dictionary describes properties image stream contains image data less commonly raster image may embedded directly page description inline image images typically filtered compression purposes image filters supported pdf include general purpose filters normally image content pdf embedded file pdf allows image data stored external files use external streams alternate images standardized subsets pdf including pdf/a pdf/x prohibit features text pdf represented text elements page content streams text element specifies characters drawn certain positions characters specified using encoding selected font resource font object pdf description digital typeface may either describe characteristics typeface may include embedded font file latter case called embedded font former called unembedded font font files may embedded based widely used standard digital font formats type 1 compressed variant cff truetype beginning pdf 1.6 opentype additionally pdf supports type 3 variant components font described pdf graphic operators fourteen typefaces known standard 14 fonts special significance pdf documents fonts sometimes called base fourteen fonts fonts suitable substitute fonts metrics available pdf readers guaranteed available reader may display correctly system installed fonts may substituted embedded pdf within text strings characters shown using character codes integers map glyphs current font using encoding number predefined encodings including winansi macroman large number encodings east asian languages font built-in encoding although winansi macroman encodings derived historical properties windows macintosh operating systems fonts using encodings work equally well platform pdf specify predefined encoding use font built-in encoding provide lookup table differences predefined built-in encoding recommended truetype fonts encoding mechanisms pdf designed type 1 fonts rules applying truetype fonts complex large fonts fonts non-standard glyphs special encodings identity-h horizontal writing identity-v vertical used fonts necessary provide tounicode table semantic information characters preserved original imaging model pdf like postscript opaque object drawn page completely replaced anything previously marked location pdf 1.4 imaging model extended allow transparency transparency used new objects interact previously marked objects produce blending effects addition transparency pdf done means new extensions designed ignored products written pdf 1.3 earlier specifications result files use small amount transparency might view acceptably older viewers files making extensive use transparency could viewed incorrectly older viewer without warning transparency extensions based key concepts transparency groups blending modes shape alpha model closely aligned features adobe illustrator version 9 blend modes based used adobe photoshop time pdf 1.4 specification published formulas calculating blend modes kept secret adobe since published concept transparency group pdf specification independent existing notions group layer applications adobe illustrator groupings reflect logical relationships among objects meaningful editing objects part imaging model pdf files may contain interactive elements annotations form fields video 3d rich media rich media pdf pdf file including interactive content embedded linked within file interactive forms mechanism add forms pdf file format pdf currently supports two different methods integrating data pdf forms formats today coexist pdf specification acroforms introduced pdf 1.2 format acroforms permit using objects e.g text boxes radio buttons etc code e.g javascript alongside standard pdf action types interactive forms acroforms support submitting resetting importing data submit action transmits names values selected interactive form fields specified uniform resource locator url interactive form field names values may submitted following formats depending settings action ’ exportformat submitpdf xfdf flags acroforms keep form field values external stand-alone files containing key value pairs external files may use forms data format fdf xml forms data format xfdf files usage rights ur signatures define rights import form data files fdf xfdf text csv/tsv formats export form data files fdf xfdf formats forms data format fdf based pdf uses syntax essentially file structure much simpler pdf since body fdf document consists one required object forms data format defined pdf specification since pdf 1.2 forms data format used submitting form data server receiving response incorporating interactive form also used export form data stand-alone files imported back corresponding pdf interactive form xml forms data format xfdf xml version forms data format xfdf implements subset fdf containing forms annotations xfdf equivalents entries fdf dictionary – status encoding javascript pages keys embeddedfdfs differences target addition xfdf allow spawning addition new pages based given data done using fdf file xfdf specification referenced included pdf 1.5 specification later versions described separately xml forms data format specification pdf 1.4 specification allowed form submissions xml format replaced submissions xfdf format pdf 1.5 specification xfdf conforms xml standard december 2016 xfdf 3.0 iso/iec standard formal name iso 19444-1:2016 – document management – xml forms data format – part 1 use iso 32000-2 xfdf 3.0 standard normative reference iso 32000-2 xfdf used way fdf e.g. form data submitted server modifications made sent back new form data imported interactive form also used export form data stand-alone files imported back corresponding pdf interactive form pdf 1.5 adobe systems introduced proprietary format forms adobe xml forms architecture xfa adobe xfa forms compatible iso 32000 acroforms feature pdf processors handle xfa content xfa specification referenced iso 32000-1 pdf 1.7 external proprietary specification entirely deprecated pdf iso 32000-2 pdf 2.0 tagged pdf see clause 14.8 iso 32000 includes document structure semantics information enable reliable text extraction accessibility technically speaking tagged pdf stylized use format builds logical structure framework introduced pdf 1.3 tagged pdf defines set standard structure types attributes allow page content text graphics images extracted reused purposes tagged pdf required situations pdf file intended print since feature optional since rules tagged pdf relatively vague iso 32000-1 support tagged pdf amongst consuming devices including assistive technology uneven time iso 32000-2 however includes improved discussion tagged pdf anticipated facilitate iso-standardized subset pdf specifically targeted accessibility pdf/ua first published 2012 introduction pdf version 1.5 2003 came concept layers layers formally known optional content groups ocgs refer sections content pdf document selectively viewed hidden document authors consumers capability useful cad drawings layered artwork maps multi-language documents etc basically consists optional content properties dictionary added document root dictionary contains array optional content groups ocgs describing set information may individually displayed suppressed plus set optional content configuration dictionaries give status displayed suppressed given ocgs pdf file may encrypted security digitally signed authentication however since sha-1 collision discovered making use pdf format digital signatures using sha-1 shown insecure standard security provided acrobat pdf consists two different methods two different passwords user password encrypts file prevents opening owner password specifies operations restricted even document decrypted include modifying printing copying text graphics document adding modifying text notes acroform fields user password encrypts file owner password instead relying client software respect restrictions owner password easily removed software including free online services thus use restrictions document author places pdf document secure assured file distributed warning displayed applying restrictions using adobe acrobat software create edit pdf files even without removing password freeware open source pdf readers ignore permission protections allow user print make copy excerpts text document limited password protection number commercial solutions offer robust means information rights management restrict document access also reliably enforce permissions ways standard security handler beginning pdf 1.5 usage rights ur signatures used enable additional interactive features available default particular pdf viewer application signature used validate permissions granted bona fide granting authority example used allow user example adobe systems grants permissions enable additional features adobe reader using public-key cryptography adobe reader verifies signature uses certificate adobe-authorized certificate authority pdf application use mechanism purposes pdf files file attachments processors may access open save local filesystem pdf files contain two types metadata first document information dictionary set key/value fields author title subject creation update dates stored optional info trailer file small set fields defined extended additional text values required method deprecated pdf 2.0 pdf 1.4 support added metadata streams using extensible metadata platform xmp add xml standards-based extensible metadata used file formats allows metadata attached stream document information embedded illustrations well whole document attaching document catalog using extensible schema pdfs may encrypted password needed view edit contents pdf 2.0 defines 256-bit aes encryption standard pdf 2.0 files pdf reference also defines ways third parties define encryption systems pdf pdf files may digitally signed complete details implementing digital signatures pdf provided iso 32000-2 pdf files may also contain embedded drm restrictions provide controls limit copying editing printing restrictions depend reader software obey security provide limited pdf documents contain display settings including page display layout zoom level adobe reader uses settings override user default settings opening document free adobe reader remove settings anyone may create applications read write pdf files without pay royalties adobe systems adobe holds patents pdf licenses royalty-free use developing software complying pdf specification pdf files created specifically accessible disabled people pdf file formats use include tags text equivalents captions audio descriptions software automatically produce tagged pdfs feature always enabled default leading screen readers including jaws window-eyes hal kurzweil 1000 3000 read tagged pdf moreover tagged pdfs re-flowed magnified readers visual impairments adding tags older pdfs generated scanned documents present challenges one significant challenges pdf accessibility pdf documents three distinct views depending document creation inconsistent three views physical view ii tags view iii content view physical view displayed printed people consider pdf document tags view screen readers assistive technologies use deliver high-quality navigation reading experience users disabilities content view based physical order objects within pdf content stream may displayed software fully support tags view reflow feature adobe reader pdf/ua international standard accessible pdf based iso 32000-1 first published iso 14289-1 2012 establishes normative language accessible pdf technology pdf attachments carrying viruses first discovered 2001 virus named outlook.pdfworm peachy uses microsoft outlook send attachment adobe pdf file activated adobe acrobat acrobat reader time time new vulnerabilities discovered various versions adobe reader prompting company issue security fixes pdf readers also susceptible one aggravating factor pdf reader configured start automatically web page embedded pdf file providing vector attack malicious web page contains infected pdf file takes advantage vulnerability pdf reader system may compromised even browser secure vulnerabilities result pdf standard allowing pdf documents scripted javascript disabling javascript execution pdf reader help mitigate future exploits although protect exploits parts pdf viewing software security experts say javascript essential pdf reader security benefit comes disabling javascript outweighs compatibility issues caused one way avoiding pdf file exploits local web service convert files another format viewing march 30 2010 security researcher didier stevens reported adobe reader foxit reader exploit runs malicious executable user allows launch asked pdf file often combination vector graphics text bitmap graphics basic types content pdf later pdf revisions pdf document also support links inside document web page forms javascript initially available plugin acrobat 3.0 types embedded contents handled using plug-ins pdf 1.6 supports interactive 3d documents embedded pdf – 3d drawings embedded using u3d prc various data formats two pdf files look similar computer screen may different sizes example high resolution raster image takes space low resolution one typically higher resolution needed printing documents displaying screen things may increase size file embedding full fonts especially asiatic scripts storing text graphics pdf viewers generally provided free charge many versions available variety sources many software options creating pdfs including pdf printing capabilities built macos ios linux distributions libreoffice microsoft office 2007 updated sp2 later wordperfect 9 scribus numerous pdf print drivers microsoft windows pdftex typesetting system docbook pdf tools applications developed around ghostscript adobe acrobat well adobe indesign adobe framemaker adobe illustrator adobe photoshop google online office suite google docs also allows uploading saving pdf raster image processors rips used convert pdf files raster format suitable imaging onto paper media printers digital production presses prepress process known rasterisation rips capable processing pdf directly include adobe pdf print engine adobe systems jaws harlequin rip global graphics documents saved pdf portable document format portable document format archiving forms data format printable document could converted back forth many formats etc companies adobe acrobat provide sdk libraries developers add create pdf features software besides adobe pdf library companies pdftron systems apache pdfbox foxit software provide similar sdks adobe acrobat one example proprietary software allows user annotate highlight add notes already created pdf files one unix application available free software gnu general public license pdfedit freeware foxit reader available microsoft windows macos linux allows annotating documents tracker software pdf-xchange viewer allows annotations markups without restrictions freeware alternative apple macos integrated pdf viewer preview also enable annotations open source software skim latter supporting interaction latex synctex pdfsync integration bibdesk reference management software freeware qiqqa create annotation report summarizes annotations notes one made across library pdfs also web annotation systems support annotation pdf documents formats cases pdfs expected functionality paper documents ink annotation required examples pdf software online services including scribd viewing storing pdfvue online editing thinkfree zamzar conversion 1993 jaws raster image processor global graphics became first shipping prepress rip interpreted pdf natively without conversion another format company released upgrade harlequin rip capability 1997 agfa-gevaert introduced shipped apogee first prepress workflow system based pdf 1997 many commercial offset printers accepted submission press-ready pdf files print source specifically pdf/x-1a subset variations submission press-ready pdf files replacement problematic need receiving collected native working files pdf selected native metafile format mac os x replacing pict format earlier classic mac os imaging model quartz graphics layer based model common display postscript pdf leading nickname display pdf preview application display pdf files version 2.0 later safari web browser system-level support pdf allows mac os x applications create pdf documents automatically provided support os-standard printing architecture files exported pdf 1.3 format according file header taking screenshot mac os x versions 10.0 10.3 image also captured pdf later versions save screen captures png file though behaviour set back pdf desired 2006 pdf widely accepted standard print job format open source development labs printing summit supported print job format common unix printing system desktop application projects gnome kde firefox thunderbird libreoffice openoffice switched emit print jobs pdf desktop printers also support direct pdf printing interpret pdf data without external help currently pdf capable printers also support postscript postscript printers support direct pdf printing free software foundation thought one high priority projects developing free high-quality fully functional set libraries programs implement pdf file format associated technologies iso 32000 standard 2011 however gnu pdf project removed list high priority projects due maturation poppler library enjoyed wider use applications evince gnome desktop environment poppler based xpdf code base also commercial development libraries available listed list pdf software apache pdfbox project apache software foundation open source java library working pdf documents pdfbox licensed apache license | [
3931,
7877,
1811,
5,
7514,
6795,
6085,
2193,
7892,
3620,
6428,
6805,
5041,
5396,
2214,
737,
1104,
740,
6822,
405,
745,
2226,
1114,
4725,
7935,
7212,
433,
2609,
7223,
80,
6497,
1897,
1146,
4025,
797,
4759,
6517,
805,
807,
5811,
6172,
7... | Test |
6,016 | 9 | PostScript:postscript postscript ps page description language electronic publishing desktop publishing business dynamically typed concatenative programming language created adobe systems john warnock charles geschke doug brotz ed taft bill paxton 1982 1984 concepts postscript language seeded 1966 john warnock working evans sutherland computer graphics company time warnock developing interpreter large three-dimensional graphics database new york harbor warnock conceived design system language process graphics concurrently researchers xerox parc developed first laser printer recognized need standard means defining page images 1975-76 bob sproull william newman developed press format eventually used xerox star system drive laser printers press data format rather language lacked flexibility parc mounted interpress effort create successor 1978 warnock left evans sutherland joined xerox parc work martin newell rewrote design system create interpretive language j jam john martin used vlsi design investigation type graphics printing work later evolved expanded interpress language warnock left chuck geschke founded adobe systems december 1982 together doug brotz ed taft bill paxton created simpler language similar interpress called postscript went market 1984 time visited steve jobs urged adapt postscript used language driving laser printers march 1985 apple laserwriter first printer ship postscript sparking desktop publishing dtp revolution mid-1980s combination technical merits widespread availability made postscript language choice graphical output printing applications time interpreter sometimes referred rip raster image processor postscript language common component laser printers 1990s however cost implementation high computers output raw ps code would interpreted printer raster image printer natural resolution required high performance microprocessors ample memory laserwriter used 12 mhz motorola 68000 making faster macintosh computers attached laser printer engines cost thousand dollars added cost ps marginal printer mechanisms fell price cost implementing ps became great fraction overall printer cost addition desktop computers becoming powerful longer made sense offload rasterisation work onto resource-constrained printer 2001 lower-end printer models came support postscript largely due growing competition much cheaper non-postscript ink jet printers new software-based methods render postscript images computer making suitable printer pdf descendant postscript provides one method largely replaced postscript de facto standard electronic document distribution high-end printers postscript processors remain common use dramatically reduce cpu work involved printing documents transferring work rendering postscript images computer printer first version postscript language released market 1984 suffix level 1 added level 2 introduced postscript level 2 introduced 1991 included several improvements improved speed reliability support in-rip separations image decompression example jpeg images could rendered postscript program support composite fonts form mechanism caching reusable content postscript 3 adobe dropped level terminology favor simple versioning came end 1997 along many new dictionary-based versions older operators introduced better color handling new filters allow in-program compression/decompression program chunking advanced error-handling postscript 3 significant terms replacing existing proprietary color electronic prepress systems widely used magazine production introduction smooth shading operations 4096 shades grey rather 256 available postscript level 2 well devicen color space allowed addition additional ink colors called spot colors composite color pages prior introduction postscript printers designed print character output given text—typically ascii—as input number technologies task shared property glyphs physically difficult change stamped onto typewriter keys bands metal optical plates changed degree increasing popularity dot matrix printers characters systems drawn series dots defined font table inside printer grew sophistication dot matrix printers started including several built-in fonts user could select models allowed users upload custom glyphs printer dot matrix printers also introduced ability print raster graphics graphics interpreted computer sent series dots printer using series escape sequences printer control languages varied printer printer requiring program authors create numerous drivers vector graphics printing left special-purpose devices called plotters almost plotters shared common command language hpgl limited use anything printing graphics addition tended expensive slow thus rare laser printers combine best features printers plotters like plotters laser printers offer high quality line art like dot-matrix printers able generate pages text raster graphics unlike either printers plotters laser printer makes possible position high-quality graphics text page postscript made possible exploit fully characteristics offering single control language could used brand printer postscript went beyond typical printer control language complete programming language many applications transform document postscript program execution results original document program sent interpreter printer results printed document one inside another application display document on-screen since document-program regardless destination called device-independent postscript noteworthy implementing 'on-the fly rasterization everything even text specified terms straight lines cubic bézier curves previously found cad applications allows arbitrary scaling rotating transformations postscript program interpreted interpreter converts instructions dots needed form output reason postscript interpreters occasionally called postscript raster image processors rips almost complex postscript handling fonts font system uses ps graphics primitives draw glyphs curves rendered resolution number typographic issues considered approach one issue fonts scale linearly small sizes features glyphs become proportionally large small start look displeasing postscript avoided problem inclusion font hinting additional information provided horizontal vertical bands help identify features letter important rasterizer maintain result significantly better-looking fonts even low resolution formerly believed hand-tuned bitmap fonts required task time technology including hints fonts carefully guarded hinted fonts compressed encrypted adobe called type 1 font also known postscript type 1 font ps1 t1 adobe type 1 type 1 effectively simplification ps system store outline information opposed complete language pdf similar regard adobe would sell licenses type 1 technology wanting add hints fonts license technology left type 3 font also known postscript type 3 font ps3 t3 type 3 fonts allowed sophistication postscript language without standardized approach hinting type 2 font format designed used compact font format cff charstrings implemented reduce overall font file size cff/type2 format later became basis handling postscript outlines opentype fonts cid-keyed font format also designed solve problems ocf/type 0 fonts addressing complex asian-language cjk encoding large character set issues cid-keyed font format used type 1 font format standard cid-keyed fonts type 2 cid-keyed opentype fonts compete adobe system apple designed system truetype around 1991 immediately following announcement truetype adobe published specification type 1 font format retail tools altsys fontographer acquired macromedia january 1995 owned fontlab since may 2005 added ability create type 1 fonts since many free type 1 fonts released instance fonts used tex typesetting system available format early 1990s several systems storing outline-based fonts developed bitstream metafont instance none included general-purpose printing solution therefore widely used late 1990s adobe joined microsoft developing opentype essentially functional superset type 1 truetype formats printed postscript output device unneeded parts opentype font omitted sent device driver would truetype type 1 font depending kind outlines present opentype font 1980s adobe drew revenue licensing fees implementation postscript printers known raster image processor rip number new risc-based platforms became available mid-1980s found adobe support new machines lacking issues cost led third-party implementations postscript becoming common particularly low-cost printers licensing fee sticking point high-end typesetting equipment quest speed demanded support new platforms faster adobe could provide one point microsoft licensed apple postscript-compatible interpreter bought called trueimage apple licensed microsoft new font format truetype apple ended reaching accord adobe licensed genuine postscript printers truetype became standard outline font technology windows macintosh today third-party postscript-compatible interpreters widely used printers multifunction peripherals mfps example csr plc ips ps3 interpreter formerly known phoenixpage standard many printers mfps including developed hewlett-packard sold laserjet color laserjet lines third-party postscript solutions used print mfp manufacturers include jaws harlequin rip global graphics free software version several applications ghostscript several compatible interpreters listed undocumented printing wiki basic inexpensive laser printers support postscript instead coming drivers simply rasterize platform native graphics formats rather converting postscript first postscript support needed printer ghostscript used also number commercial postscript interpreters teletype co. t-script postscript became commercially successful due introduction graphical user interface gui allowing designers directly lay pages eventual output laser printers however gui graphics systems generally much less sophisticated postscript apple quickdraw instance supported basic lines arcs complex b-splines advanced region filling options postscript order take full advantage postscript printing applications computers re-implement features using host platform graphics system led numerous issues on-screen layout would exactly match printed output due differences implementation features computer power grew became possible host ps system computer rather printer led natural evolution ps printing system one could also used host graphics language numerous advantages approach help eliminate possibility different output screen printer also provided powerful graphics system computer allowed printers dumb time cost laser engines falling production setting using postscript display system meant host computer could render low-resolution screen higher resolution printer simply send ps code smart printer offboard printing however postscript written printing mind numerous features made unsuitable direct use interactive display system particular ps based idea collecting ps commands codice_1 command seen point commands read point interpreted output interactive system clearly appropriate ps sort interactivity built example supporting hit detection mouse interactivity obviously apply ps used printer steve jobs left apple started next pitched adobe idea using ps display system new workstation computers result display postscript dps dps added basic functionality improve performance changing many string lookups 32 bit integers adding support direct output every command adding functions allow gui inspect diagram additionally set bindings provided allow ps code called directly c programming language next used bindings nextstep system provide object oriented graphics system although dps written conjunction next adobe sold commercially common feature unix workstations 1990s sun microsystems took another approach creating news instead dps concept allowing ps interact c programs news instead extended ps language suitable running entire gui computer sun added number new commands timers mouse control interrupts systems needed interactivity added data structures language elements allow completely object oriented internally complete gui three fact written news provided time workstations however ongoing efforts standardize x11 system led introduction widespread use sun systems news never became widely used postscript turing-complete programming language belonging concatenative group typically postscript programs produced humans programs however possible write computer programs postscript like programming language postscript interpreted stack-based language similar forth strong dynamic typing data structures inspired found lisp scoped memory since language level 2 garbage collection language syntax uses reverse polish notation makes order operations unambiguous reading program requires practice one keep layout stack mind operators languages term functions take arguments stack place results onto stack literals example numbers effect placing copy stack sophisticated data structures built array dictionary types declared type system sees arrays dictionaries typing discipline applied user-defined types left code implements character used introduce comments postscript programs general convention every postscript program start characters ps interpreter directive devices properly interpret postscript hello world program customary way show small example complete program given language might look like postscript level 2 output device console postscript uses point unit length however unlike versions point postscript uses exactly 72 points inch thus example order draw vertical line 4 cm length sufficient type readably idiomatically one might use following equivalent demonstrates simple procedure definition use mathematical operators codice_2 codice_3 implementations postscript use single-precision reals 24-bit mantissa meaningful use 9 decimal digits specify real number performing calculations may produce unacceptable round-off errors list software used render postscript documents | [
4289,
1811,
5,
7892,
6436,
2214,
6822,
6826,
1113,
6848,
5079,
433,
5786,
80,
5787,
6148,
7223,
1146,
7951,
5450,
6507,
7606,
797,
807,
2644,
816,
4775,
4780,
1944,
6557,
4805,
7663,
3407,
5173,
4453,
1599,
3746,
3751,
2706,
5191,
1616,... | Test |
6,017 | 6 | Unix_filesystem:unix filesystem unix operating systems inspired file system considered central component operating system also one first parts system designed implemented ken thompson first experimental version unix dated 1969 operating systems filesystem provides information storage retrieval one several forms interprocess communication many small programs traditionally form unix system store information files programs read although pipes complemented role starting third edition also filesystem provides access resources so-called device files entry points terminals printers mice rest article uses unix generic name refer original unix operating system many workalikes filesystem appears one rooted tree directories instead addressing separate volumes disk partitions removable media network shares separate trees done dos windows drive drive letter denotes root file system tree volumes mounted directory causing volume file system tree appear directory larger tree root entire tree denoted codice_1 original bell labs unix two-disk setup customary first disk contained startup programs second contained users files programs second disk mounted empty directory named codice_2 first disk causing two disks appear one filesystem second disks contents viewable codice_3 unix directories contain files instead contain names files paired references so-called inodes turn contain file metadata owner permissions time last access etc. name multiple names file system may refer file feature termed hard link mathematical traits hard links make file system limited type directed acyclic graph although directories still form tree typically may hard-linked originally envisioned 1969 unix file system would fact used general graph hard links directories providing navigation instead path names original unix file system supported three types files ordinary files directories special files also termed device files berkeley software distribution bsd system v added file type used interprocess communication bsd added sockets system v added fifo files bsd also added symbolic links often termed symlinks range file types files refer files complement hard links symlinks modeled similar feature multics differ hard links may span filesystems existence independent target object unix systems may support additional types files certain conventions exist locating kinds files programs system configuration files users home directories first documented codice_4 man page since version 7 unix subsequent versions derivatives clones typically similar man page details directory layout varied time although file system layout part single unix specification several attempts exist standardize parts system v application binary interface intel binary compatibility standard common operating system environment linux foundation filesystem hierarchy standard fhs generalized overview common locations files unix operating system | [
3599,
2547,
7161,
4672,
3626,
3638,
6117,
6470,
5783,
6854,
5437,
4375,
6500,
6505,
5457,
4030,
4759,
460,
1534,
7976,
4406,
821,
7258,
5130,
1561,
836,
5843,
3033,
6558,
2683,
5859,
5865,
4444,
4447,
5518,
6577,
6231,
869,
2704,
1605,
... | Test |
6,018 | 4 | The_Cuckoo's_Egg:cuckoo egg cuckoo egg tracking spy maze computer espionage 1989 book written clifford stoll first-person account hunt computer hacker broke computer lawrence berkeley national laboratory lbnl author clifford stoll astronomer training managed computers lawrence berkeley national laboratory lbnl california one day 1986 supervisor dave cleveland asked resolve us 0.75 accounting error computer usage accounts stoll traced error unauthorized user apparently used 9 seconds computer time paid stoll eventually realized unauthorized user hacker acquired superuser access lbnl system exploiting vulnerability movemail function original gnu emacs early course long weekend stoll rounded fifty terminals well teleprinters mostly “ borrowing ” desks co-workers away weekend physically attached fifty incoming phone lines hacker dialed weekend stoll located phone line coming tymnet routing service help tymnet eventually tracked intrusion call center mitre defense contractor mclean virginia next ten months stoll spent enormous amounts time effort tracing hacker origin saw hacker using 1200 baud connection realized intrusion coming telephone modem connection stoll colleagues paul murray lloyd bellknap assisted phone lines returning “ borrowed ” terminals stoll left teleprinter attached intrusion line order see record everything hacker watched hacker sought sometimes gained unauthorized access military bases around united states looking files contained words “ nuclear ” “ sdi ” hacker also copied password files order make dictionary attacks set trojan horses find passwords stoll amazed many high-security sites hacker could easily guess passwords since many system administrators never bothered change passwords factory defaults even military bases hacker sometimes able log “ guest ” password one first — if first — documented cases computer break-in stoll seems first keep daily logbook hacker activities course investigation stoll contacted various agents fbi cia nsa air force osi beginning confusion jurisdiction general reluctance share information fbi particular uninterested large sum money involved studying log book stoll saw hacker familiar vms well unix also noted hacker tended active around middle day pacific time eventually stoll hypothesized since modem bills cheaper night people school day job would lot free time hacking night hacker time zone distance east help tymnet various agents various agencies stoll found intrusion coming west germany via satellite deutsche bundespost german post office also authority german phone system traced calls university bremen order entice hacker reveal stoll set elaborate hoax—known today honeypot—inventing fictitious department lbl supposedly newly formed “ sdi “ contract also fictitious realized hacker particularly interested faux sdi entity filled “ sdinet ” account operated imaginary secretary barbara sherwin large files full impressive-sounding bureaucratese ploy worked deutsche bundespost finally located hacker home hanover hacker name markus hess engaged years selling results hacking soviet kgb ancillary proof hungarian spy contacted fictitious sdinet lbl mail based information could obtained hess apparently kgb method double-checking see hess making information selling stoll later flew germany testify trial hess confederate | [
768,
5272,
3486,
7050,
217,
6020,
1805
] | Test |
6,019 | 3 | Accent_kernel:accent kernel accent operating system kernel developed carnegie mellon university cmu accent developed follow-on aleph kernel developed university rochester fixing several problems re-targeting hardware support networks workstation machines specifically three rivers perq instead minicomputers accent part spice project cmu ran 1981 1985 development accent led directly famous mach kernel original aleph project used data copying allow programs communicate applications could open ports would allow receive data sent programs idea write number servers would control resources machine passing data along reached end user respect similar concept unix although implementation much different using messages instead memory turned number problems notably copying memory data general eclipse expensive 1979 one aleph engineers richard rashid left cmu started work new version aleph avoided problems particular accent targeted workstation machines featuring mmu using mmu copy large blocks memory via mapping making memory appear two different places data changed one program another would physically copied using copy-on-write algorithm understand difference consider two interacting programs one feeding file another aleph data provider would copied 2kb time due features eclipse user process accent data simply appeared user process cost instructions sent mmu user process changed data would anything need copied even portions data actually changed another problem aleph ports identified unique id assigned sequentially simple program guess thereby gaining access resources computer granted made aleph system rather insecure address accent made port id internal kernel instances program opening ports handed back different ids stored mapping kernel whenever message sent kernel delivery would first check program access port question comparing mapping table program guessing port numbers longer worked program port ids gave clue real ids kernel attempt talk one explicitly handed kernel error thus accent ports represented capabilities granting rights use resources result handed valid port id kind capability system using subject-specific identifiers capabilities called c-list system years accent project started looking less less interesting early 1980s many felt future gains performance would made adding cpus machines something accent kernel really equipped handle adding problem new generation powerful workstations appearing meaning accent would likely ported anyway likewise unix grown operating system choice experimental work operating system design well development platform user applications order address changes decided end work accent start new system would use accent ports system within unix kernel creating famed mach kernel features accent | [
3599,
5012,
5275,
5504,
4642,
5571,
1237,
8066
] | Validation |
6,020 | 4 | Clifford_Stoll:clifford stoll clifford paul cliff stoll born june 4 1950 american astronomer author teacher best known investigation 1986 working systems administrator lawrence berkeley national laboratory led capture hacker markus hess stoll subsequent book cuckoo egg details investigation stoll written three books articles non-specialist press e.g. scientific american curta mechanical calculator slide rule frequent contributor mathematics youtube channel numberphile cliff stoll attended hutchinson central technical high school buffalo new york earned b.s astronomy 1973 university buffalo suny studying undergraduate degree suny buffalo stoll worked university electronic music laboratory mentored robert moog received phd university arizona 1980 1960s 1970s stoll assistant chief engineer wbfo public radio station hometown buffalo new york 1986 employed systems administrator lawrence berkeley national laboratory stoll investigated tenacious hacker—later identified kgb recruit markus hess—who stole passwords pirated multiple computer accounts attempted breach us military security identifying intrusion stoll set honeypot hess eventually tracking passing details authorities recognized one first examples digital forensics time gaining cooperation law enforcement challenge due relatively new nature crime described events investigation cuckoo egg tracking spy maze computer espionage paper stalking wily hacker stoll book later chronicled episode wgbh nova titled kgb computer aired pbs stations 1990 1995 book silicon snake oil accompanying article newsweek stoll called prospect e-commerce baloney stoll also raised questions influence internet future society whether would beneficial made various predictions article e.g. e-commerce calling nonviable due lack personal contact secure online funds transfers future printed news publications online database replace daily newspaper article resurfaced boing boing 2010 stoll left self-deprecating comment many mistakes flubs howlers public 1995 howler ... whenever think know happening temper thoughts might wrong cliff ... stoll eighth-grade physics teacher tehiyah day school el cerrito california later taught physics home-schooled teenagers stoll regular contributor msnbc site stoll fcc licensed amateur radio operator call sign k7ta appears frequently brady haran youtube series numberphile stoll sells blown glass klein bottles internet company acme klein bottles stores inventory crawlspace underneath home accesses needed homemade miniature robotic forklift runs company home | [
1715,
3517,
3179,
2195,
5561,
4316,
3700,
7825,
7050,
7181,
217,
6018,
1756,
5150,
4523,
7105,
3486,
3823,
5254,
6488,
8148,
1805
] | Validation |
6,021 | 1 | Enterprise_Information_Technology_Data_Repository_(EITDR):enterprise information technology data repository eitdr enterprise information technology data repository eitdr united states air force official database presented webservice registering information technology systems maintaining portfolio management data database provides portfolio managers senior leaders investment decision support ability track report compliance federal laws regulations eitdr provides automated management processes common access point gather view load update query report store pertinent data disparate systems eitdr serves single point user entry af data electronic interface dod/af systems requiring data united states code title 40 subtitle iii chapter 113 requires air force chief information officer implement portfolio management process maximizing value assessing managing risks associated information technology acquisition use eitdr result law office secretary air force warfighting integration chief information officer saf/xc primary responsibility november 30 2006 eitdr recorded 146 systems operating budgets exceeding 1 million addition fy06 eitdr operations maintenance costs totaled 4.3 million may 1 2017 eitdr replaced itips system record compliance | [
2054
] | Test |
6,022 | 4 | Information_technology_security_audit:information technology security audit computer security audit manual systematic measurable technical assessment system application manual assessments include interviewing staff performing security vulnerability scans reviewing application operating system access controls analyzing physical access systems automated assessments caat include system generated audit reports using software monitor report changes files settings system systems include personal computers servers mainframes network routers switches last decades systematic audit record generation also called audit event reporting described ad hoc early days mainframe mini-computing large scale single-vendor custom software systems companies ibm hewlett packard auditing considered mission-critical function last thirty years commercial off-the-shelf cots software applications components micro computers gradually replaced custom software hardware cost-effective business management solutions transition critical nature audit event reporting gradually transformed low priority customer requirements software consumers little else fall back simply accepted lesser standards normal consumer licenses existing cots software disclaim liability security performance data integrity issues using traditional logging methods applications components submit free-form text messages system logging facilities unix syslog process microsoft windows system security application event logs java applications often fall back standard java logging facility log4j text messages usually contain information assumed security-relevant application developer often computer- network-security expert fundamental problem free-form event records application developer individually determines information included audit event record overall format record presented audit log variation format among thousands instrumented applications makes job parsing audit event records analysis tools novell sentinel product example difficult error-prone domain application specific parsing code included analysis tools also difficult maintain changes event formats inevitably work way newer versions applications time contemporary enterprise operating systems including microsoft windows solaris mac os x freebsd via trustedbsd project support audit event logging due requirements common criteria historically orange book freebsd mac os x make use open source openbsm library command suite generate process audit records importance audit event logging increased recent new post-2000 us worldwide legislation mandating corporate enterprise auditing requirements open source projects openxdas bandit project identity component begun used software security reviews openxdas based open group distributed auditing service specification generally computer security audits performed | [
4382,
3932,
4759,
2094,
8091,
1013,
5051,
7836,
6208,
3050,
2879,
429,
3745,
6157,
1987,
2894,
1805
] | Test |
6,023 | 4 | Computer_surveillance_in_the_workplace:computer surveillance workplace computer surveillance workplace use computers monitor activity workplace computer monitoring method collecting performance data employers obtain digitalised employee monitoring computer surveillance may nowadays used alongside traditional security applications closed-circuit television depending upon technology methods used monitoring applications may track activity may target specific activities employees company-owned computer terminal may monitor various devices installed computer e.g. web cameras microphones includes recordings devices also remote broadcasting live feed webcams microphones tools used monitoring employee computer usage incorporate also known employee monitoring industry employee monitoring used multiple reasons including compliance insider threat management employee monitoring software monitor application software including email instant message filesystem print jobs internet surveillance monitoring internet data traffic web access online activity may include monitoring internet traffic including encrypted web browser traffic secure socket layer ssl connections personal web-based email personal banking sites research done american management association nearly 30 percent employers united states monitor employee e-mails labor union contracts forms employment agreements may offer protection monitoring additionally united states public sector employees may protection fourth amendment united states constitution employees california may additional protection specific portions state statute employers may required maintain documentation emails communications regulatory compliance purposes monitoring email instant messaging communications may part requirements software used type surveillance may impose additional restrictions notification requirements based end user license agreement eula example spectorsoft requires employees signed contract stating computer activity may monitored employed additional legal issues may arise information obtained monitoring used illegal malicious purposes organizations without stated computer usage monitoring policy employees typically use company equipment respective discretion cases may visible restrictions monitoring activities performed computer use computer surveillance within employee discipline evaluation process may viewed employees invasion privacy lack trust employers right monitor employees united states course specific rules regulations must follow depending state legislation despite fact almost 80 major companies america actively monitor employees. public opinion still mostly employees ’ side americans still think monitoring workplace entirely acceptable according pew research center 6 respondents care monitored work | [
7057,
1504,
6417,
6419
] | Test |
6,024 | 8 | Search_engine_optimization:search engine optimization search engine optimization seo process increasing quality quantity website traffic increasing visibility website web page users web search engine seo refers improvement unpaid results known natural organic results excludes direct traffic/visitors purchase paid placement primarily seo pertains search engine seo may target different kinds search including image search video search academic search news search industry-specific vertical search engines optimizing website may involve editing content adding content modifying html associated coding increase relevance specific keywords remove barriers indexing activities search engines promoting site increase number backlinks inbound links another seo tactic may 2015 mobile search surpassed desktop search internet marketing strategy seo considers search engines work computer programmed algorithms dictate search engine behavior people search actual search terms keywords typed search engines search engines preferred targeted audience seo performed website receive visitors search engine higher website ranks search engine results page serp visitors converted customers seo differs local search engine optimization latter focused optimizing business online presence web pages displayed search engines user enters local search products services former instead focused national international searches webmasters content providers began optimizing websites search engines mid-1990s first search engines cataloging early web initially webmasters needed submit address page url various engines would send spider crawl page extract links pages return information found page indexed process involves search engine spider downloading page storing search engine server second program known indexer extracts information page words contains located weight specific words well links page contains information placed scheduler crawling later date website owners recognized value high ranking visibility search engine results creating opportunity white hat black hat seo practitioners according industry analyst danny sullivan phrase search engine optimization probably came use 1997 sullivan credits bruce clay one first people popularize term may 2 2007 jason gambert attempted trademark term seo convincing trademark office arizona seo process involving manipulation keywords marketing service early versions search algorithms relied webmaster-provided information keyword meta tag index files engines like aliweb meta tags provide guide page content using metadata index pages found less reliable however webmaster choice keywords meta tag could potentially inaccurate representation site actual content inaccurate incomplete inconsistent data meta tags could cause pages rank irrelevant searches web content providers also manipulated attributes within html source page attempt rank well search engines 1997 search engine designers recognized webmasters making efforts rank well search engine webmasters even manipulating rankings search results stuffing pages excessive irrelevant keywords early search engines altavista infoseek adjusted algorithms prevent webmasters manipulating rankings relying much factors keyword density exclusively within webmaster control early search engines suffered abuse ranking manipulation provide better results users search engines adapt ensure results pages showed relevant search results rather unrelated pages stuffed numerous keywords unscrupulous webmasters meant moving away heavy reliance term density holistic process scoring semantic signals since success popularity search engine determined ability produce relevant results given search poor quality irrelevant search results could lead users find search sources search engines responded developing complex ranking algorithms taking account additional factors difficult webmasters manipulate 2005 annual conference airweb adversarial information retrieval web created bring together practitioners researchers concerned search engine optimization related topics companies employ overly aggressive techniques get client websites banned search results 2005 wall street journal reported company traffic power allegedly used high-risk techniques failed disclose risks clients wired magazine reported company sued blogger seo aaron wall writing ban google matt cutts later confirmed google fact ban traffic power clients search engines also reached seo industry frequent sponsors guests seo conferences webchats seminars major search engines provide information guidelines help website optimization google sitemaps program help webmasters learn google problems indexing website also provides data google traffic website bing webmaster tools provides way webmasters submit sitemap web feeds allows users determine crawl rate track web pages index status 2015 reported google developing promoting mobile search key feature within future products response many brands began take different approach internet marketing strategies 1998 two graduate students stanford university larry page sergey brin developed backrub search engine relied mathematical algorithm rate prominence web pages number calculated algorithm pagerank function quantity strength inbound links pagerank estimates likelihood given page reached web user randomly surfs web follows links one page another effect means links stronger others higher pagerank page likely reached random web surfer page brin founded google 1998 google attracted loyal following among growing number internet users liked simple design off-page factors pagerank hyperlink analysis considered well on-page factors keyword frequency meta tags headings links site structure enable google avoid kind manipulation seen search engines considered on-page factors rankings although pagerank difficult game webmasters already developed link building tools schemes influence inktomi search engine methods proved similarly applicable gaming pagerank many sites focused exchanging buying selling links often massive scale schemes link farms involved creation thousands sites sole purpose link spamming 2004 search engines incorporated wide range undisclosed factors ranking algorithms reduce impact link manipulation june 2007 new york times saul hansell stated google ranks sites using 200 different signals leading search engines google bing yahoo disclose algorithms use rank pages seo practitioners studied different approaches search engine optimization shared personal opinions patents related search engines provide information better understand search engines 2005 google began personalizing search results user depending history previous searches google crafted results logged users 2007 google announced campaign paid links transfer pagerank june 15 2009 google disclosed taken measures mitigate effects pagerank sculpting use nofollow attribute links matt cutts well-known software engineer google announced google bot would longer treat nofollow links way prevent seo service providers using nofollow pagerank sculpting result change usage nofollow led evaporation pagerank order avoid seo engineers developed alternative techniques replace nofollowed tags obfuscated javascript thus permit pagerank sculpting additionally several solutions suggested include usage iframes flash javascript december 2009 google announced would using web search history users order populate search results june 8 2010 new web indexing system called google caffeine announced designed allow users find news results forum posts content much sooner publishing google caffeine change way google updated index order make things show quicker google according carrie grimes software engineer announced caffeine google caffeine provides 50 percent fresher results web searches last index ... google instant real-time-search introduced late 2010 attempt make search results timely relevant historically site administrators spent months even years optimizing website increase search rankings growth popularity social media sites blogs leading engines made changes algorithms allow fresh content rank quickly within search results february 2011 google announced panda update penalizes websites containing content duplicated websites sources historically websites copied content one another benefited search engine rankings engaging practice however google implemented new system punishes sites whose content unique 2012 google penguin attempted penalize websites used manipulative techniques improve rankings search engine although google penguin presented algorithm aimed fighting web spam really focuses spammy links gauging quality sites links coming 2013 google hummingbird update featured algorithm change designed improve google natural language processing semantic understanding web pages hummingbird language processing system falls newly recognized term 'conversational search system pays attention word query order better match pages meaning query rather words regards changes made search engine optimization content publishers writers hummingbird intended resolve issues getting rid irrelevant content spam allowing google produce high-quality content rely 'trusted authors leading search engines google bing yahoo use crawlers find pages algorithmic search results pages linked search engine indexed pages need submitted found automatically yahoo directory dmoz two major directories closed 2014 2017 respectively required manual submission human editorial review google offers google search console xml sitemap feed created submitted free ensure pages found especially pages discoverable automatically following links addition url submission console yahoo formerly operated paid submission service guaranteed crawling cost per click however practice discontinued 2009 search engine crawlers may look number different factors crawling site every page indexed search engines distance pages root directory site may also factor whether pages get crawled today people searching google using mobile device november 2016 google announced major change way crawling websites started make index mobile-first means mobile version website becomes starting point google includes index avoid undesirable content search indexes webmasters instruct spiders crawl certain files directories standard robots.txt file root directory domain additionally page explicitly excluded search engine database using meta tag specific robots usually meta name= robots content= noindex search engine visits site robots.txt located root directory first file crawled robots.txt file parsed instruct robot pages crawled search engine crawler may keep cached copy file may occasion crawl pages webmaster wish crawled pages typically prevented crawled include login specific pages shopping carts user-specific content search results internal searches march 2007 google warned webmasters prevent indexing internal search results pages considered search spam variety methods increase prominence webpage within search results cross linking pages website provide links important pages may improve visibility writing content includes frequently searched keyword phrase relevant wide variety search queries tend increase traffic updating content keep search engines crawling back frequently give additional weight site adding relevant keywords web page metadata including title tag meta description tend improve relevancy site search listings thus increasing traffic url canonicalization web pages accessible via multiple urls using canonical link element via 301 redirects help make sure links different versions url count towards page link popularity score seo techniques classified two broad categories techniques search engine companies recommend part good design white hat techniques search engines approve black hat search engines attempt minimize effect latter among spamdexing industry commentators classified methods practitioners employ either white hat seo black hat seo white hats tend produce results last long time whereas black hats anticipate sites may eventually banned either temporarily permanently search engines discover seo technique considered white hat conforms search engines guidelines involves deception search engine guidelines written series rules commandments important distinction note white hat seo following guidelines ensuring content search engine indexes subsequently ranks content user see white hat advice generally summed creating content users search engines making content easily accessible online spider algorithms rather attempting trick algorithm intended purpose white hat seo many ways similar web development promotes accessibility although two identical black hat seo attempts improve rankings ways disapproved search engines involve deception one black hat technique uses hidden text either text colored similar background invisible div positioned screen another method gives different page depending whether page requested human visitor search engine technique known cloaking another category sometimes used grey hat seo black hat white hat approaches methods employed avoid site penalized act producing best content users grey hat seo entirely focused improving search engine rankings search engines may penalize sites discover using black hat methods either reducing rankings eliminating listings databases altogether penalties applied either automatically search engines algorithms manual site review one example february 2006 google removal bmw germany ricoh germany use deceptive practices companies however quickly apologized fixed offending pages restored google search engine results page seo appropriate strategy every website internet marketing strategies effective paid advertising pay per click ppc campaigns depending site operator goals search engine marketing sem practice designing running optimizing search engine ad campaigns difference seo simply depicted difference paid unpaid priority ranking search results purpose regards prominence relevance website developers regard sem utmost importance consideration visibility navigate primary listings search successful internet marketing campaign may also depend upon building high quality web pages engage persuade setting analytics programs enable site owners measure results improving site conversion rate november 2015 google released full 160 page version search quality rating guidelines public revealed shift focus towards usefulness mobile search recent years mobile market exploded overtaking use desktops shown statcounter october 2016 analyzed 2.5 million websites found 51.3 pages loaded mobile device google one companies utilizing popularity mobile usage encouraging websites use google search console mobile-friendly test allows companies measure website search engine results user-friendly seo may generate adequate return investment however search engines paid organic search traffic algorithms change guarantees continued referrals due lack guarantees certainty business relies heavily search engine traffic suffer major losses search engines stop sending visitors search engines change algorithms impacting website placement possibly resulting serious loss traffic according google ceo eric schmidt 2010 google made 500 algorithm changes – almost 1.5 per day considered wise business practice website operators liberate dependence search engine traffic addition accessibility terms web crawlers addressed user web accessibility become increasingly important seo optimization techniques highly tuned dominant search engines target market search engines market shares vary market market competition 2003 danny sullivan stated google represented 75 searches markets outside united states google share often larger google remains dominant search engine worldwide 2007 2006 google 85–90 market share germany hundreds seo firms us time five germany june 2008 market share google uk close 90 according hitwise market share achieved number countries 2009 large markets google leading search engine cases google leading given market lagging behind local player notable example markets china japan south korea russia czech republic respectively baidu yahoo japan naver yandex seznam market leaders successful search optimization international markets may require professional translation web pages registration domain name top level domain target market web hosting provides local ip address otherwise fundamental elements search optimization essentially regardless language october 17 2002 searchking filed suit united states district court western district oklahoma search engine google searchking claim google tactics prevent spamdexing constituted tortious interference contractual relations may 27 2003 court granted google motion dismiss complaint searchking failed state claim upon relief may granted march 2006 kinderstart filed lawsuit google search engine rankings kinderstart website removed google index prior lawsuit amount traffic site dropped 70 march 16 2007 united states district court northern district california san jose division dismissed kinderstart complaint without leave amend partially granted google motion rule 11 sanctions kinderstart attorney requiring pay part google legal expenses | [
2451,
2819,
98,
5558,
5474,
6092,
3857,
6808,
5570,
4600,
833,
317,
7198,
49,
84,
7482,
7405,
5612,
80,
4198,
6952,
5351,
2261,
2712
] | Test |
6,025 | 7 | Peer-to-peer:peer-to-peer peer-to-peer p2p computing networking distributed application architecture partitions tasks workloads peers peers equally privileged equipotent participants application said form peer-to-peer network nodes peers make portion resources processing power disk storage network bandwidth directly available network participants without need central coordination servers stable hosts peers suppliers consumers resources contrast traditional client-server model consumption supply resources divided emerging collaborative p2p systems going beyond era peers similar things sharing resources looking diverse peers bring unique resources capabilities virtual community thereby empowering engage greater tasks beyond accomplished individual peers yet beneficial peers p2p systems previously used many application domains architecture popularized file sharing system napster originally released 1999 concept inspired new structures philosophies many areas human interaction social contexts peer-to-peer meme refers egalitarian social networking emerged throughout society enabled internet technologies general p2p systems previously used many application domains concept popularized file sharing systems music-sharing application napster originally released 1999 peer-to-peer movement allowed millions internet users connect directly forming groups collaborating become user-created search engines virtual supercomputers filesystems basic concept peer-to-peer computing envisioned earlier software systems networking discussions reaching back principles stated first request comments rfc 1 tim berners-lee vision world wide web close p2p network assumed user web would active editor contributor creating linking content form interlinked web links early internet open present day two machines connected internet could send packets without firewalls security measures contrasts broadcasting-like structure web developed years precursor internet arpanet successful client-server network every participating node could request serve content however arpanet self-organized lacked ability provide means context content-based routing beyond 'simple address-based routing therefore usenet distributed messaging system often described early peer-to-peer architecture established developed 1979 system enforces decentralized model control basic model client-server model user client perspective offers self-organizing approach newsgroup servers however news servers communicate one another peers propagate usenet news articles entire group network servers consideration applies smtp email sense core email-relaying network mail transfer agents peer-to-peer character periphery e-mail clients direct connections strictly client-server relationship may 1999 millions people internet shawn fanning introduced music file-sharing application called napster napster beginning peer-to-peer networks know today participating users establish virtual network entirely independent physical network without obey administrative authorities restrictions peer-to-peer network designed around notion equal peer nodes simultaneously functioning clients servers nodes network model network arrangement differs client–server model communication usually central server typical example file transfer uses client-server model file transfer protocol ftp service client server programs distinct clients initiate transfer servers satisfy requests peer-to-peer networks generally implement form virtual overlay network top physical network topology nodes overlay form subset nodes physical network data still exchanged directly underlying tcp/ip network application layer peers able communicate directly via logical overlay links corresponds path underlying physical network overlays used indexing peer discovery make p2p system independent physical network topology based nodes linked within overlay network resources indexed located classify networks unstructured structured hybrid two unstructured peer-to-peer networks impose particular structure overlay network design rather formed nodes randomly form connections gnutella gossip kazaa examples unstructured p2p protocols structure globally imposed upon unstructured networks easy build allow localized optimizations different regions overlay also role peers network unstructured networks highly robust face high rates churn —that large numbers peers frequently joining leaving network however primary limitations unstructured networks also arise lack structure particular peer wants find desired piece data network search query must flooded network find many peers possible share data flooding causes high amount signaling traffic network uses cpu/memory requiring every peer process search queries ensure search queries always resolved furthermore since correlation peer content managed guarantee flooding find peer desired data popular content likely available several peers peer searching likely find thing peer looking rare data shared peers highly unlikely search successful structured peer-to-peer networks overlay organized specific topology protocol ensures node efficiently search network file/resource even resource extremely rare common type structured p2p networks implement distributed hash table dht variant consistent hashing used assign ownership file particular peer enables peers search resources network using hash table key value pairs stored dht participating node efficiently retrieve value associated given key however order route traffic efficiently network nodes structured overlay must maintain lists neighbors satisfy specific criteria makes less robust networks high rate churn i.e large numbers nodes frequently joining leaving network recent evaluation p2p resource discovery solutions real workloads pointed several issues dht-based solutions high cost advertising/discovering resources static dynamic load imbalance notable distributed networks use dhts include tixati alternative bittorrent distributed tracker kad network storm botnet yacy coral content distribution network prominent research projects include chord project kademlia past storage utility p-grid self-organized emerging overlay network coopnet content distribution system dht-based networks also widely utilized accomplishing efficient resource discovery grid computing systems aids resource management scheduling applications hybrid models combination peer-to-peer client-server models common hybrid model central server helps peers find spotify example hybrid model 2014 variety hybrid models make trade-offs centralized functionality provided structured server/client network node equality afforded pure peer-to-peer unstructured networks currently hybrid models better performance either pure unstructured networks pure structured networks certain functions searching require centralized functionality benefit decentralized aggregation nodes provided unstructured networks coopnet cooperative networking proposed system off-loading serving peers recently downloaded content proposed computer scientists venkata n. padmanabhan kunwadee sripanidkulchai working microsoft research carnegie mellon university basically server experiences increase load redirects incoming peers peers agreed mirror content thus off-loading balance server information retained server system makes use fact bottle-neck likely outgoing bandwidth cpu hence server-centric design assigns peers peers 'close ip neighbors prefix range attempt use locality multiple peers found file designates node choose fastest neighbors streaming media transmitted clients cache previous stream transmit piece-wise new nodes peer-to-peer systems pose unique challenges computer security perspective like form software p2p applications contain vulnerabilities makes particularly dangerous p2p software however peer-to-peer applications act servers well clients meaning vulnerable remote exploits also since node plays role routing traffic network malicious users perform variety routing attacks denial service attacks examples common routing attacks include incorrect lookup routing whereby malicious nodes deliberately forward requests incorrectly return false results incorrect routing updates malicious nodes corrupt routing tables neighboring nodes sending false information incorrect routing network partition new nodes joining bootstrap via malicious node places new node partition network populated malicious nodes prevalence malware varies different peer-to-peer protocols studies analyzing spread malware p2p networks found example 63 answered download requests gnutella network contained form malware whereas 3 content openft contained malware cases top three common types malware accounted large majority cases 99 gnutella 65 openft another study analyzing traffic kazaa network found 15 500,000 file sample taken infected one 365 different computer viruses tested corrupted data also distributed p2p networks modifying files already shared network example fasttrack network riaa managed introduce faked chunks downloads downloaded files mostly mp3 files files infected riaa virus unusable afterwards contained malicious code riaa also known uploaded fake music movies p2p networks order deter illegal file sharing consequently p2p networks today seen enormous increase security file verification mechanisms modern hashing chunk verification different encryption methods made networks resistant almost type attack even major parts respective network replaced faked nonfunctional hosts decentralized nature p2p networks increases robustness removes single point failure inherent client-server based system nodes arrive demand system increases total capacity system also increases likelihood failure decreases one peer network fails function properly whole network compromised damaged contrast typical client–server architecture clients share demands system resources case clients join system fewer resources available serve client central server fails entire network taken advantages disadvantages p2p networks related topic data backup recovery availability centralized network system administrators forces controlling availability files shared administrators decide longer distribute file simply remove servers longer available users along leaving users powerless deciding distributed throughout community makes entire system vulnerable threats requests government large forces example youtube pressured riaa mpaa entertainment industry filter copyrighted content although server-client networks able monitor manage content availability stability availability content choose host client trouble accessing obscure content shared stable centralized network p2p networks however unreliable sharing unpopular files sharing files p2p network requires least one node network requested data node must able connect node requesting data requirement occasionally hard meet users may delete stop sharing data point sense community users p2p network completely responsible deciding content available unpopular files eventually disappear become unavailable people stop sharing popular files however highly easily distributed popular files p2p network actually stability availability files central networks centralized network simple loss connection server clients enough cause failure p2p networks connections every node must lost order cause data sharing failure centralized system administrators responsible data recovery backups p2p systems node requires backup system lack central authority p2p networks forces recording industry riaa mpaa government unable delete stop sharing content p2p systems p2p networks clients provide use resources means unlike client-server systems content-serving capacity peer-to-peer networks actually increase users begin access content especially protocols bittorrent require users share refer performance measurement study property one major advantages using p2p networks makes setup running costs small original content distributor many file peer-to-peer file sharing networks gnutella g2 edonkey network popularized peer-to-peer technologies peer-to-peer networking involves data transfer one user another without using intermediate server companies developing p2p applications involved numerous legal cases primarily united states conflicts copyright law two major cases grokster vs riaa mgm studios inc. v. grokster ltd. last case court unanimously held defendant peer-to-peer file sharing companies grokster streamcast could sued inducing copyright infringement companies power ledger bovlabs employ peer-to-peer energy trading platforms cooperation among community participants key continued success p2p systems aimed casual human users reach full potential large numbers nodes contribute resources current practice p2p networks often contain large numbers users utilize resources shared nodes share anything often referred freeloader problem freeloading profound impact network cases cause community collapse types networks users natural disincentives cooperate cooperation consumes resources may degrade performance studying social attributes p2p networks challenging due large populations turnover asymmetry interest zero-cost identity variety incentive mechanisms implemented encourage even force nodes contribute resources researchers explored benefits enabling virtual communities self-organize introduce incentives resource sharing cooperation arguing social aspect missing today p2p systems seen goal means self-organized virtual communities built fostered ongoing research efforts designing effective incentive mechanisms p2p systems based principles game theory beginning take psychological information-processing direction peer-to-peer networks e.g freenet place heavy emphasis privacy anonymity—that ensuring contents communications hidden eavesdroppers identities/locations participants concealed public key cryptography used provide encryption data validation authorization authentication data/messages onion routing mix network protocols e.g tarzan used provide anonymity although peer-to-peer networks used legitimate purposes rights holders targeted peer-to-peer involvement sharing copyrighted material peer-to-peer networking involves data transfer one user another without using intermediate server companies developing p2p applications involved numerous legal cases primarily united states primarily issues surrounding copyright law two major cases grokster vs riaa mgm studios inc. v. grokster ltd. cases file sharing technology ruled legal long developers ability prevent sharing copyrighted material establish criminal liability copyright infringement peer-to-peer systems government must prove defendant infringed copyright willingly purpose personal financial gain commercial advantage fair use exceptions allow limited use copyrighted material downloaded without acquiring permission rights holders documents usually news reporting lines research scholarly work controversies developed concern illegitimate use peer-to-peer networks regarding public safety national security file downloaded peer-to-peer network impossible know created file users connected network given time trustworthiness sources potential security threat seen peer-to-peer systems study ordered european union found illegal downloading may lead increase overall video game sales newer games charge extra features levels paper concluded piracy negative financial impact movies music literature study relied self-reported data game purchases use illegal download sites pains taken remove effects false misremembered responses peer-to-peer applications present one core issues network neutrality controversy internet service providers isps known throttle p2p file-sharing traffic due high-bandwidth usage compared web browsing e-mail many uses internet data transferred short intervals relative small quantities p2p file-sharing often consists relatively heavy bandwidth usage due ongoing file transfers swarm/network coordination packets october 2007 comcast one largest broadband internet providers united states started blocking p2p applications bittorrent rationale p2p mostly used share illegal content infrastructure designed continuous high-bandwidth traffic critics point p2p networking legitimate legal uses another way large providers trying control use content internet direct people towards client-server-based application architecture client-server model provides financial barriers-to-entry small publishers individuals less efficient sharing large files reaction bandwidth throttling several p2p applications started implementing protocol obfuscation bittorrent protocol encryption techniques achieving protocol obfuscation involves removing otherwise easily identifiable properties protocols deterministic byte sequences packet sizes making data look random isp solution high bandwidth p2p caching isp stores part files accessed p2p clients order save access internet researchers used computer simulations aid understanding evaluating complex behaviors individuals within network networking research often relies simulation order test evaluate new ideas important requirement process results must reproducible researchers replicate validate extend existing work research reproduced opportunity research hindered even though new simulators continue released research community tends towards handful open-source simulators demand features simulators shown criteria survey high therefore community work together get features open-source software would reduce need custom simulators hence increase repeatability reputability experiments besides stated facts work done ns-2 open source network simulator one research issue related free rider detection punishment explored using ns-2 simulator | [
7148,
3932,
5014,
6415,
367,
8,
1079,
6424,
7169,
6093,
382,
6430,
1460,
2923,
7538,
2563,
2566,
1846,
734,
7549,
6450,
744,
4706,
6458,
6122,
52,
2238,
5773,
426,
2960,
2961,
1886,
6487,
7214,
7217,
5784,
5440,
6499,
4014,
84,
5447,
... | Test |
6,026 | 4 | Pirni:pirni pirni pro network security tool designed ios specifically iphone ipod touch devices capable intercepting traffic wireless network segment capturing passwords regular expressions entered user core system pirni written c open-source software licensed gnu general public license pirni pro succeeding version pirni commercial software available cydia store jailbroken apple devices pirni pro supports active dissection non-ciphered protocols given user supplied regular expression dissection application description contains following addition software also offers following features | [
6788,
3383,
4208,
5571,
1435,
1805
] | Test |
6,027 | 2 | SMSQ/E:smsq/e smsq/e computer operating system originally developed france tony tebby designer original qdos operating system sinclair ql personal computer began life smsq qdos-compatible version sms2 intended miracle systems qxl emulator card pcs later developed extended version smsq/e atari st consists qdos compatible sms kernel rewritten superbasic interpreter called sbasic complete set superbasic procedures functions set extended device drivers originally written ql emulator atari st also integrates many extensions previously available separately ql like toolkit ii quite essential superbasic add-on pointer environment ql mouse windowing system hotkey system 2 smsq/e run unmodified ql runs advanced ql compatible platforms miracle systems super goldcard cpu plug-in cards q60 motherboard late 1995 german author marcel kilgus acquired smsq/e sources adaptation ql emulator qpc emulate specific ql hardware anymore employed specially adapted device drivers achieve tighter integration faster emulation 2000 version 2.94 first ql operating system broke free bounds ql 8 colour screen introducing gd2 graphic device interface version 2 ql compatible 16-bit high colour graphics sub-system version 2.99 system exclusively developed tony tebby marcel kilgus 2002 mr tebby released source code n't include qpc specific parts albeit license open source open source definition step tony tebby finally left ql scene development volunteers continues day early 2013 current source code re-released bsd license currently smsq/e consists approximately 2000 68k assembler source files containing 222,000 lines code | [
7448,
7839,
5571
] | Test |
6,028 | 6 | UBIFS:ubifs ubifs ubi file system fully unsorted block image file system flash file system unmanaged flash memory devices ubifs works top ubi unsorted block image layer top memory technology device mtd layer file system developed nokia engineers help university szeged hungary development began earnest 2007 first stable release made linux kernel 2.6.27 october 2008 two major differences ubifs jffs2 ubifs supports write caching ubifs errs pessimistic side free space calculation ubifs tends perform better jffs2 large nand flash devices consequence ubifs design goals faster mounting quicker access large files improved write speeds ubifs also preserves improves upon jffs2 on-the-fly compression recoverability power fail tolerance ubifs on-the-fly data compression allows zlib deflate algorithm lzo zstandard ubifs stores indexes flash whereas jffs2 stores filesystem indexes memory directly impacts scalability jffs2 tables must rebuilt every time volume mounted also jffs2 tables may consume enough system ram images may unusable ubi unsorted block images erase block management layer flash memory devices ubi serves two purposes tracking nand flash bad blocks providing wear leveling wear leveling spreads erases writes across entire flash device ubi presents logical erase blocks higher layers maps physical erase blocks ubi written specifically ubifs ubifs deal wear leveling bad blocks however ubi may also useful squashfs nand flash squashfs aware nand flash bad blocks ubi documentation explains complete flash translation layer ftl although ftl also handles bad blocks wear leveling interface ftl provides block device small typically 512 byte sectors written completely independently contrast ubi interface directly exposes erase blocks programmable pages different sizes much larger typical block device sectors filesystems use ubi must aware sizes restrictions blocks must erased written ubi augmented linux 3.7 fastmap support fastmap maintains on-disk version information previously created memory scanning entire flash device code falls back previous mechanism full scan failures older ubi systems simply ignore fastmap information | [
3599,
2547,
7161,
4672,
6431,
3626,
5049,
6117,
759,
6854,
5437,
4375,
6500,
6505,
5457,
460,
1534,
7976,
4406,
821,
7258,
5130,
1561,
836,
5843,
2313,
6558,
2683,
5859,
5865,
4444,
2338,
5518,
6231,
869,
2704,
1605,
174,
2710,
1624,
59... | Test |
6,029 | 9 | PHP:php php hypertext preprocessor simply php general-purpose programming language originally designed web development originally created rasmus lerdorf 1994 php reference implementation produced php group php originally stood personal home page stands recursive initialism php hypertext preprocessor php code may executed command line interface cli embedded html code used combination various web template systems web content management systems web frameworks php code usually processed php interpreter implemented module web server common gateway interface cgi executable web server outputs results interpreted executed php code may type data generated html code binary image data php used many programming tasks outside web context standalone graphical applications robotic drone control standard php interpreter powered zend engine free software released php license php widely ported deployed web servers almost every operating system platform free charge php language evolved without written formal specification standard 2014 original implementation acting de facto standard implementations aimed follow since 2014 work gone create formal php specification majority sites web using php still version 5.6 older versions prior 7.1 longer officially supported php development team security support provided longer third parties debian php development began 1994 rasmus lerdorf wrote several common gateway interface cgi programs c used maintain personal homepage extended work web forms communicate databases called implementation personal home page/forms interpreter php/fi php/fi could used build simple dynamic web applications accelerate bug reporting improve code lerdorf initially announced release php/fi personal home page tools php tools version 1.0 usenet discussion group comp.infosystems.www.authoring.cgi june 8 1995 release already basic functionality php today included perl-like variables form handling ability embed html syntax resembled perl simpler limited less consistent early php intended new programming language grew organically lerdorf noting retrospect n't know stop never intent write programming language ... absolutely idea write programming language kept adding next logical step way development team began form months work beta testing officially released php/fi 2 november 1997 fact php originally designed instead developed organically led inconsistent naming functions inconsistent ordering parameters cases function names chosen match lower-level libraries php wrapping early versions php length function names used internally hash function names chosen improve distribution hash values zeev suraski andi gutmans rewrote parser 1997 formed base php 3 changing language name recursive acronym php hypertext preprocessor afterwards public testing php 3 began official launch came june 1998 suraski gutmans started new rewrite php core producing zend engine 1999 also founded zend technologies ramat gan israel may 22 2000 php 4 powered zend engine 1.0 released august 2008 branch reached version 4.4.9 php 4 longer development security updates released july 14 2004 php 5 released powered new zend engine ii php 5 included new features improved support object-oriented programming php data objects pdo extension defines lightweight consistent interface accessing databases numerous performance enhancements 2008 php 5 became stable version development late static binding missing php added version 5.3 many high-profile open-source projects ceased support php 4 new code february 5 2008 gophp5 initiative provided consortium php developers promoting transition php 4 php 5 time php interpreters became available existing 32-bit 64-bit operating systems either building php source code using pre-built binaries php versions 5.3 5.4 available microsoft windows binary distributions 32-bit ia-32 builds requiring windows 32-bit compatibility mode using internet information services iis 64-bit windows platform php version 5.5 made 64-bit x86-64 builds available microsoft windows official security support php 5.6 ended 31 december 2018 debian 8.0 jessie extend support june 2020 php received mixed reviews due lacking native unicode support core language level 2005 project headed andrei zmievski initiated bring native unicode support throughout php embedding international components unicode icu library representing text strings utf-16 internally since would cause major changes internals language user code planned release version 6.0 language along major features development however shortage developers understood necessary changes performance problems arising conversion utf-16 rarely used web context led delays project result php 5.3 release created 2009 many non-unicode features back-ported php 6 notably namespaces march 2010 project current form officially abandoned php 5.4 release prepared containing remaining non-unicode features php 6 traits closure re-binding initial hopes new plan would formed unicode integration none adopted 2014 2015 new major php version developed numbered php 7 numbering version involved debate php 6 unicode experiment never released several articles book titles referenced php 6 name might caused confusion new release reuse name vote name php 7 chosen foundation php 7 php branch originally dubbed php next generation phpng authored dmitry stogov xinchen hui nikita popov aimed optimize php performance refactoring zend engine retaining near-complete language compatibility wordpress-based benchmarks served main benchmark suite phpng project showed almost 100 increase performance changes phpng also expected make easier improve performance future compact data structures changes seen better suited successful migration just-in-time jit compiler significant changes reworked zend engine called zend engine 3 succeeding zend engine 2 used php 5 major internal changes phpng must receive new major version number php rather minor php 5 release according php release process major versions php allowed break backward-compatibility code therefore php 7 presented opportunity improvements beyond phpng require backward-compatibility breaks particular involved following changes php 7 also included new language features notably introduces return type declarations functions complement existing parameter type declarations support scalar types integer float string boolean parameter return type declarations beginning june 28 2011 php development team implemented timeline release new versions php system least one release occur every month per year minor release occur may include new features every minor release least supported two years security bug fixes followed least one year security fixes total three-year release process every minor release new features unless small self-contained introduced minor release three-year release process mascot php project elephpant blue elephant php logo side designed vincent pontier 1998 php letters forming shape elephant viewed sideways angle elephpant sometimes differently colored plush toy form many variations mascot made years elephpants based original design vincent pontier considered official community highly collectible extremely rare different variations listed field guide elephpants following hello world program written php code embedded html document doctype html title php hello world program /title php echo p hello world /p however requirement exists php code embedded html simplest version hello world may written like closing tag omitted preferred files containing pure php code well requirement php file contain php code interpreter output data outside php tags unchanged simple text file containing codice_13 give output php interpreter executes php code within delimiters anything outside delimiters processed php although non-php text still subject control structures described php code common delimiters php open close php sections shortened form also exists short delimiter makes script files less portable since support disabled local php configuration therefore discouraged recommendation echo short tag prior php 5.4.0 short syntax echo works codice_14 configuration setting enabled php 5.4.0 later always available purpose delimiters separate php code non-php content javascript code html markup first form delimiters php xhtml xml documents creates correctly formed xml processing instructions means resulting mixture php code markup server-side file well-formed xml variables prefixed dollar symbol type need specified advance php 5 introduced type hinting allows functions force parameters objects specific class arrays interfaces callback functions however php 7.0 type hints could used scalar types integer string unlike function class names variable names case sensitive double-quoted heredoc strings provide ability interpolate variable value string php treats newlines whitespace manner free-form language statements terminated semicolon php three types comment syntax /* */ marks block inline comments // used one-line comments codice_15 statement one several facilities php provides output text terms keywords language syntax php similar c style syntax conditions loops function returns similar syntax languages c c++ c java perl php stores integers platform-dependent range either 64-bit 32-bit 128-bit signed integer equivalent c-language long type unsigned integers converted signed values certain situations behavior different programming languages integer variables assigned using decimal positive negative octal hexadecimal binary notations floating point numbers also stored platform-specific range specified using floating point notation two forms scientific notation php native boolean type similar native boolean types java c++ using boolean type conversion rules non-zero values interpreted true zero false perl c++ null data type represents variable value codice_16 allowed value data type old versions interpreter allowed multiple copies value exist variables resource type represent references resources external sources typically created functions particular extension processed functions extension examples include file image database resources arrays contain elements type php handle including resources objects even arrays order preserved lists values hashes keys values two intermingled php also supports strings used single quotes double quotes nowdoc heredoc syntax standard php library spl attempts solve standard problems implements efficient data access interfaces classes php defines large array functions core language many also available various extensions functions well documented online php documentation however built-in library wide variety naming conventions associated inconsistencies described history custom functions may defined developer function myage int birthyear string echo currently myage 1995 old 2019 output sample program currently 24 years old lieu function pointers functions php referenced string containing name manner normal php functions used example callbacks within function tables user-defined functions may created time without prototyped functions may defined inside code blocks permitting run-time decision whether function defined codice_17 function determines whether function given name already defined function calls must use parentheses exception zero-argument class constructor functions called php operator codice_18 case parentheses optional php 5.3 support anonymous functions closures exist php codice_19 exists since php 4.0.1 merely thin wrapper around codice_20 allows normal php functions created program execution php 5.3 added syntax define anonymous function closure capture variables surrounding scope function getadder x adder getadder 8 echo adder 2 // prints 10 example codice_21 function creates closure using passed argument keyword codice_22 imports variable lexical context takes additional argument returns created closure caller function first-class object meaning stored variable passed parameter functions etc unusually dynamically typed language php supports type declarations function parameters enforced runtime supported classes interfaces since php 5.0 arrays since php 5.1 callables since php 5.4 scalar integer float string boolean types since php 7.0 php 7.0 also type declarations function return types expressed placing type name list parameters preceded colon example codice_23 function earlier example could annotated types like php 7 function getadder int x closure adder getadder 8 echo adder 2 // prints 10 echo adder null // throws exception incorrect type passed adder getadder // would also throw exception default scalar type declarations follow weak typing principles example parameter type codice_24 php would allow integers also convertible numeric strings floats booleans passed function would convert however php 7 strict typing mode used disallows conversions function calls returns within file basic object-oriented programming functionality added php 3 improved php 4 allowed php gain abstraction making creative tasks easier programmers using language object handling completely rewritten php 5 expanding feature set enhancing performance previous versions php objects handled like value types drawback method code make heavy use php reference variables wanted modify object passed rather creating copy new approach objects referenced handle value php 5 introduced private protected member variables methods along abstract classes final classes abstract methods final methods also introduced standard way declaring constructors destructors similar object-oriented languages c++ standard exception handling model furthermore php 5 added interfaces allowed multiple interfaces implemented special interfaces allow objects interact runtime system objects implementing arrayaccess used array syntax objects implementing iterator iteratoraggregate used codice_6 language construct virtual table feature engine static variables bound name instead reference compile time developer creates copy object using reserved word codice_26 zend engine check whether codice_27 method defined call default codice_27 copy object properties codice_27 method defined responsible setting necessary properties created object convenience engine supply function imports properties source object programmer start by-value replica source object override properties need changed following basic example object-oriented programming php php abstract class user class student extends user class teacher extends user students teachers echo students \n foreach students student echo teachers \n foreach teachers teacher // output program // students // hello name alice learn computer science // hello name bob learn computer science // hello name charlie learn business studies // teachers // hello name dan teach computer science information security // hello name erin teach computer science 3d graphics programming // hello name frankie teach online marketing business studies e-commerce visibility php properties methods defined using keywords codice_30 codice_31 codice_32 default public var used codice_33 synonym codice_30 items declared codice_30 accessed everywhere codice_32 limits access inherited classes class defines item codice_31 limits visibility class defines item objects type access private protected members even though instance original complete widely used php implementation powered zend engine known simply php disambiguate implementations sometimes unofficially called zend php zend engine compiles php source code on-the-fly internal format execute thus works interpreter also reference implementation php php formal specification semantics zend php define semantics php due complex nuanced semantics php defined zend works difficult competing implementations offer complete compatibility php single-request-per-script-execution model fact zend engine interpreter leads inefficiency result various products developed help improve php performance order speed execution time compile php source code every time web page accessed php scripts also deployed php engine internal format using opcode cache works caching compiled form php script opcodes shared memory avoid overhead parsing compiling code every time script runs opcode cache zend opcache built php since version 5.5 another example widely used opcode cache alternative php cache apc available pecl extension zend php still popular implementation several implementations developed compilers support jit compilation hence offer performance benefits zend php expense lacking full php compatibility alternative implementations include following php free software released php license stipulates restriction use php makes php license incompatible general public license gpl zend license incompatible due advertising clause similar original bsd license php includes various free open-source libraries source distribution uses resulting php binary builds php fundamentally internet-aware system built-in modules accessing file transfer protocol ftp servers many database servers including postgresql mysql microsoft sql server sqlite embedded database ldap servers others numerous functions familiar c programmers stdio family available standard php builds php allows developers write extensions c add functionality php language php extensions compiled statically php loaded dynamically runtime numerous extensions written add support windows api process management unix-like operating systems multibyte strings unicode curl several popular compression formats php features made available extensions include integration irc dynamic generation images adobe flash content php data objects pdo abstraction layer used accessing databases even speech synthesis language core functions dealing strings arrays also implemented extensions php extension community library pecl project repository extensions php language projects zephir provide ability php extensions created high-level language compiled native php extensions approach instead writing php extensions directly c simplifies development extensions reduces time required programming testing php group consisted ten people thies c. arntzen stig bakken shane caraveo andi gutmans rasmus lerdorf sam ruby sascha schumann zeev suraski jim winstead andrei zmievski zend technologies provides php certification based php 5.5 exam programmers become certified php developers two primary ways adding support php web server – native web server module cgi executable php direct module interface called server application programming interface sapi supported many web servers including apache http server microsoft iis netscape defunct iplanet web servers omnihttpd support internet server application programming interface isapi microsoft web server module interface php module support web server always used common gateway interface cgi fastcgi processor case web server configured use php cgi executable process requests php files php-fpm fastcgi process manager alternative fastcgi implementation php bundled official php distribution since version 5.3.3 compared older fastcgi implementation contains additional features mostly useful heavily loaded web servers using php command-line scripting php command-line interface cli executable needed php supports cli server application programming interface sapi php 4.3.0 main focus sapi developing shell applications using php quite differences cli sapi sapis although share many behaviors php direct module interface called sapi different web servers case php 5 apache 2.0 windows provided form dll file called module among functions provides interface php web server implemented form server understands form known sapi different kinds sapis various web server extensions example addition listed sapis php language include common gateway interface cgi command-line interface cli php also used writing desktop graphical user interface gui applications using php-gtk extension php-gtk included official php distribution extension used php versions 5.1.0 newer common way installing php-gtk compiling source code php installed used cloud environments software development kits sdks provided using cloud-specific features example numerous configuration options supported affecting core php features extensions configuration file codice_40 searched different locations depending way php used configuration file split various sections configuration options also set within web server configuration php general-purpose scripting language especially suited server-side web development case php generally runs web server php code requested file executed php runtime usually create dynamic web page content dynamic images used websites elsewhere also used command-line scripting client-side graphical user interface gui applications php deployed web servers many operating systems platforms used many relational database management systems rdbms web hosting providers support php use clients available free charge php group provides complete source code users build customize extend use originally designed create dynamic web pages php focuses mainly server-side scripting similar server-side scripting languages provide dynamic content web server client microsoft asp.net sun microsystems javaserver pages codice_41 php also attracted development many software frameworks provide building blocks design structure promote rapid application development rad include prado cakephp symfony codeigniter laravel yii framework phalcon zend framework offering features similar web frameworks lamp architecture become popular web industry way deploying web applications php commonly used p bundle alongside linux apache mysql although p may also refer python perl mix three similar packages wamp mamp also available windows macos first letter standing respective operating system although php apache provided part macos base install users packages seek simpler installation mechanism easily kept date 20 million internet domains web services hosted servers php installed codice_42 recorded popular apache http server module php used server-side programming language 79.1 websites 83.5 previously language could determined web content management systems written php include mediawiki joomla ez publish ez platform silverstripe wordpress drupal moodle websites written php back-end and/or user-facing portion include facebook digg tumblr dailymotion slack specific advanced usage scenarios php offers well defined documented way writing custom extensions c c++ besides extending language form additional libraries extensions providing way improving execution speed critical room improvements using true compiled language php also offers well defined ways embedding software projects way php easily used internal scripting language another project also providing tight interfacing project specific internal data structures php received mixed reviews due lacking support multithreading core language level though using threads made possible pthreads pecl extension php used 240 million websites 39 sampled installed 2.1 million web servers command line interface php-cli two activex windows script host scripting engines php produced php 5 used web last updated security updates january 2019 php 5.6.40 2017 3 vulnerabilities listed national vulnerability database linked php historically 30 vulnerabilities listed since 1996 database linked php technical security flaws language core libraries frequent 22 2009 1 total although php applies 20 programs listed recognizing programmers make mistakes languages include taint checking automatically detect lack input validation induces many issues feature developed php inclusion release rejected several times past advanced protection patches suhosin hardening-patch especially designed web hosting environments historically old versions php configuration parameters default values runtime settings made php applications prone security issues among codice_43 codice_44 configuration directives best known latter made url parameters become php variables opening path serious security vulnerabilities allowing attacker set value uninitialized global variable interfere execution php script support magic quotes register globals settings deprecated php 5.3.0 removed php 5.4.0 another example potential runtime-settings vulnerability comes failing disable php execution example using codice_45 configuration directive directory uploaded files stored enabling result execution malicious code embedded within uploaded files best practice either locate image directory outside document root available web server serve via intermediary script disable php execution directory stores uploaded files also enabling dynamic loading php extensions via codice_46 configuration directive shared web hosting environment lead security issues implied type conversions result different values treated equal sometimes programmer intent lead security issues example result comparison codice_47 first compared value treated scientific notation value zero errors like resulted authentication vulnerabilities simple machines forum typo3 phpbb md5 password hashes compared recommended way use hash_equals timing attack safety codice_48 identity operator codice_49 results codice_50 2013 analysis 170,000 website defacements published zone-h frequently 53 used technique exploitation file inclusion vulnerability mostly related insecure usage php functions codice_51 codice_52 codice_53 | [
1437,
4296,
2909,
4302,
5726,
7166,
5731,
4315,
4316,
4345,
5765,
54,
2961,
7213,
2966,
5786,
5787,
80,
84,
87,
1524,
7236,
4390,
7246,
103,
109,
3005,
1550,
1553,
4425,
5846,
5863,
4441,
4445,
160,
163,
1598,
166,
7305,
7308,
179,
16... | Test |
6,030 | 3 | Silicon_Dreams:silicon dreams silicon dreams trilogy interactive fiction games developed level 9 computing 1980s first game snowball released 1983 followed year later return eden worm paradise 1985 next year vended together first second last silicon dreams early advertisements gave title silicon dream pluralised later level 9 games trilogy used interpreted language termed a-code usable major types home computer time either diskette cassette level 9 self-published game separately compilation published telecomsoft sold united states tradename firebird europe tradename rainbird trilogy set too-distant future humans started colonising space first two instalments player role kim kimberly undercover agent whose goal snowball save colonist spacecraft crashing star return eden stop defence system destination planet eden destroying craft worm paradise player role unnamed citizen eden must travel around city enoch learn secrets earn money save planet games use text parser entering commands prompt parser interpret thousand words control movement actions looks command picking two three words knows ignoring order tries guess meant movement usual commands moving 'north 'south 'east 'west available abbreviated forms n e w well 'up 'down u 'd respectively number directions 'modes movement like 'jump actions understands pick objects opening doors lighting lamps well dropping objects wielding additionally commands invoke 'save 'restore game positions cassette tape floppy disk systems also ram ask 'help turn pictures turn 'words 'pictures respectively 'oops command undo previous commands silicon dreams played three separate games obtain maximum score games must completed order carrying score one adventure next points scored collecting treasures rather specific tasks helping satisfy goal individual game snowball goal get main control room prevent starship snowball 9 crashing star return eden goal get city enoch stop robots destroying snowball 9 worm paradise goal find much information city possible obtain money become member governing party eden saving planet process trilogy set future human race colonizing stars transport network developed entire solar system using accelerator chains big 5 nations earth initiated plan colonise galaxy known terran expansionary phase lasted ninety years 2120 2210 first major activity launch probes outer space probes reported earth-sized planet encountered centuries-long voyage probe followed survey ship ten years later ship mission map planet habitable would signal earth waiting colonists arrive terraform planet second part phase survey ship mined materials asteroids used build robot factory space — process could take decades resulting robots built space factories turn produced better robots also built large satellite dishes collect data sent earth containing latest technological advances terraforming performed robots landed planet built cities also launching probes survey ships space earth received news habitable planet third final part done ten giant passenger discs carrying two hundred thousand colonists stasis towed space next came engine unit linked front discs colony ship completed ready go 2190s fifty colony ships launched eec ceres base among snowball 9 carried first colonists planet eden eridani system next three years accelerator chains beyond pluto fired ten-ton blocks ammonia ice travelling ship snowball 9 caught ice blocks hooks piled around passenger discs forming hollow shell would cover ship would serve shield needed fuel fusion engines later part trip ice shell gave snowball series name receiving last ice block crew put ship autopilot went hibernate passengers leaving ship maintenance robots except brief period activity start deceleration crew slept trip awaking one year reaching eden plan continue deceleration consuming last ice shell put ship orbit around planet delivering passengers gliders would retrieved hooks reused protagonist two first instalments kim kimberley tall athletic intelligent woman brown eyes fair hair born raised hampstead crèche closed thirteen years old due violations android protection acts finished education milton keynes school life malta returned england national service started standard security work occasional surveillance subversive members society ended working counter-espionage agent whilst mid-twenties kim accepted travel undercover snowball 9 last resort worst-case scenario snowball 9 approaches eden something goes wrong crew member murders shipmates destroys communication system sets ship collision course sun robots little automata continue everyday operations oblivious danger ship computer capable thinking awakens kim kimberley deranged crew member destroys exits modified stasis chamber goal finding way reach control room avert disaster snowball originally released 1983 company fourth adventure game using a-code system nick mike pete austin headed development though level 9 previous games featured fantasy theme austin brothers chose science fiction theme original release used version 1 system initially released bbc micro sinclair zx spectrum nascom later followed versions commodore 64 camputers lynx oric-1 atari 8-bit well memotech mtx amstrad cpc enterprise msx noteworthy including seven thousand locations achieve sixty-eight hundred locations passenger disks form colour-coded maze minimal descriptions another peculiar aspect game confusion behind main character gender interview sinclair user chris bourne asked androgynous kim man woman pete austin pointed credit end design 'ms kimberley costume also admitted kim kimberley deliberately unisex name debate came end release return eden made explicit kim man surviving crew members confuse woman tried destroy ship snowball 9 orbiting eden surviving crew members put kim trial evidence mempak control room shows hijacker rather saviour despite fact recording damaged thus unreliable sentence death thrown space kim manages escape aboard stratoglider hour later lands eden point game starts first thing player must find shelter kim moves game snowball 9 crew use ship engine try burn native robots take proof snowball 9 ship expecting hostile alien craft must destroy objective contact robots time ends snowball 9 everyone aboard unlike predecessor return eden two hundred fifty locations level 9 first game feature graphics adventure games included graphics version 2 a-code system allowed level 9 encode location graphics little forty bytes size made possible add graphics every location game formats 32 k ram user could choose display play game text-only mode released platforms predecessor game first cover depicted robot fighting monster plant enoch robot resembled comic book character avoid legal troubles level 9 commissioned godfrey dowson new cover dowson illustration depicted another robot jungle looking towards enoch level 9 satisfied result asked dowson liked third cover much hired dowson artwork re-release old games well future titles pete austin commented game alien theme park gone wild eden universe like larry niven future space ... intended comment superpower intervention third world hundred years arrival colonists aboard snowball 9 planet eden become home half billion people paradise managed robots crime taxes unemployment freedom population lives domed megapolis perhaps due war occurred return eden contact cities surrounding natural world occasional sighting flying saucers keeps population afraid going outside main character nameless citizen enoch starts game beautiful garden everything seems fine picks apple tree worm pops player follows outside garden desert awakens simulation one many forms entertainment available reign third kim garden eden prison allegory sets mood entire game objective explore city player must gather clues unmask government conspiracy behind flying saucers worm paradise third final instalment silicon dreams trilogy departure previous games evolved alongside 12 month enhancement level 9 adventure system standard features include 1,000 word vocabulary highly-advanced english input memory-enhancing text compression familiar much appreciated type-ahead multi-tasking player need never wait picture drawn first game using version 3 a-code system released four fewer platforms excluding lynx memotech mtx nascom oric-1 compared two previous releases another difference player seven days within game clock complete game quests also time-based require player arrive certain locations specific hours achieve desired goal game play remains backdrop longer action adventure political thriller resembles novel nineteen eighty-four similar happened snowball released certain confusion main character identity time story set level 9 fact sheet says ... couple years later kim kimberley become legend eden another article stated worm paradise set 100 years later kim kimberley iii ... furthermore pete austin said worm set eden 50 years future player kim becomes mayor runs place notice sources termed game original name worm paradise silicon dreams second title published telecomsoft first jewels darkness four-game publishing deal signed level 9 april 1986 deal gave level 9 often referred british infocom opportunity revise previous titles add support 16-bit market well possible entry potential lucrative us market subsequently trilogy released total twelve platforms leaving bbc micro enterprise compared worm paradise adding support apple ii amiga amstrad pcw atari st ibm pc dos macintosh games updated version 3 a-code system updated text new graphics inclusion release silicon dreams trilogy 1986 expanded text-only versions releases rainbird release came 215 x 153 x 27 mm cardboard box firebird release came 227 x 163 x 30 mm black plastic box featured 150 x 210 mm 68-page booklet loading instructions guide playing game peter mcbride novella eden song served introduction worm paradise novella also used copy protection device upon restore saved game player enter word page line reference although adventure game released sinclair ql called return eden written oliver neef rich mellor written level 9 game name level 9 never released version trilogy sinclair ql games released individually generally received good initial reviews snowball best text-only adventure prize crash 1984 readers awards return eden received 90 score sinclair programs worm paradise rated sinclair megagame sinclair user classic trilogy released received unanimously good reviews zx spectrum press sinclair user gave sinclair user classic terming ... unqualified success level 9 rainbird sinclair awarded sinclair mega game zx computing monster hit commodore 64 magazine zzap 64 gave 90 score awarded zzap 64 sizzler however reviews found graphics ... truly abysmal blotchy often unrecognisable ... simple design ... others called ... smidgens better added jewel darkness possibly even two smidgens far disappointment zx spectrum version placed fourth september third october 1987 sinclair adventure charts | [
6163,
6778,
3772,
3090
] | Train |
6,031 | 5 | Hypertext_caching_protocol:hypertext caching protocol hypertext caching protocol abbreviated htcp used discovering http caches cached data managing sets http caches monitoring cache activity permits full request response headers used cache management expands domain cache management include monitoring remote cache additions deletions requesting immediate deletions sending hints web objects third party locations cacheable objects unavailability web objects multi-octet htcp protocol elements transmitted network byte order reserved fields set binary zero senders left unexamined receivers headers must presented crlf line termination http hostnames specified compatible sender receiver private naming scheme hosts.txt nis use names depending schemes sent htcp neighbors known participate said schemes raw addresses dotted quad ipv4 colon-format ipv6 universal public dns names use private names addresses require special operational care udp must supported htcp agents must isolated network failures delays htcp agent prepared act useful ways response forthcoming responses delayed reordered damaged tcp optional expected used protocol debugging iana assigned port 4827 standard tcp udp port number htcp htcp message following general format | [
3383,
2043,
7637,
4828,
2077,
3999,
3819,
2901
] | Validation |
6,032 | 3 | Automotive_Network_Exchange:automotive network exchange anxebusiness corp. anx company owns operates automotive network exchange anx large private extranet connects automotive suppliers automotive manufacturers since 2006 anx expanded areas provides managed security compliance connectivity solutions businesses healthcare retail automotive sectors automotive network exchange private extranet initially set maintained automotive industry action group telcordia general motors ford chrysler built private network auto industry 1995 provide consistent reliable speed guaranteed security data transmissions automakers suppliers anx network allows trading partners collaborate electronically product design development solicit process orders facilitate just-in-time manufacturing post shipping schedules 1999 automotive industry action group sold anx network science applications international corporation saic overseer anx network became anx next six years 4,000 companies joined anx network making one largest extranets world 2006 private equity firm one equity partners acquired anxebusiness saic automotive industry heavily dependent collaboration manufacturers suppliers entities act federated virtual companies critical materials parts components services high velocity supply chains imperative success virtual companies must flexible accommodate needs virtual automotive manufacturer enabling formation “ many-to-many ” relationships trading partners simultaneously subscribe multiple model programs opt situation dictates anx network designed built operated deliver highly secure collaboration strategic business partners anx network secure private network uses standard open internet protocols carries traffic private lines leased various carriers ipsec end-to-end encryption anx network provides secure service customers like typical vpn ’ different typical vpn routers make network check every packet make sure comes ip address private network thus nobody customers get network triple des encryption protects customer ’ data potential malicious behavior another customer | [
6032,
173,
2644
] | Test |
6,033 | 6 | Badblocks:badblocks badblocks linux utility check bad sectors disk drive creates list sectors used programs like mkfs used future thus cause corruption data part e2fsprogs project port available bsd operating systems run standalone program badblocks gives list blocks problems makes good option checking whether disk drive healthy independent smart data file system checks common use case invocation badblocks part e2fsck passing option codice_1 scan bad blocks prevent data stored blocks done adding list found bad blocks bad block inode prevent affected sectors allocated file directory test done using read-only codice_1 non-destructive read-write codice_3 test method running codice_4 display list bad blocks recorded codice_5 codice_6 badblocks -nvs /dev/sdb would check drive sdb non-destructive read-write mode display progress writing block numbers checked would check sixth partition drive sdb destructive read-write mode -w write-mode writes 4 different patterns whole partition verifies reading back displays progress writing block numbers checked -s show -v verbose data partition overwritten block level entire drive block size 4096 destroys mbrs partitions data alike modern disk drives probably show defective sectors silently remap bad sectors spare tracks running program new drive several days test whole surface reading afterwards s.m.a.r.t data eventually show reallocated sectors using codice_7 option device containing existing file system erases data device | [
4987,
5783,
5571,
3587,
5789,
578,
6367
] | Test |
6,034 | 7 | Fragmented_object:fragmented object fragmented objects truly distributed objects novel design principle extending traditional concept stub based distribution contrast distributed objects physically distributed encapsulate distribution object parts object named fragments may exist different nodes provide object interface client accessing fragmented object unique object identity presumes local fragment fragmented objects may act like rpc-based infrastructure caching smart proxy well therefore clients distinguish access local object local stub local fragment full transparency gained following characteristics fragmented objects arbitrary protocols may chosen internal communication fragments instance allows hide real-time protocols e.g. rtp media streaming behind standard corba interface internal structure fragmented object arranged object developer/deployer may client–server hierarchical peer-to-peer others thus downward compatibility stub based distribution ensured distribution state functionality hidden behind object interface respective distribution fragments also arbitrary addition application using fragmented object also tolerate change distributions achieved exchanging fragment one multiple hosts procedure either triggered user changes object properties fragmented object collectivity fragments e.g. fragment considered failed course exchange request may trigger one internal changes object developer migrate state functionality fragments providing different fragment implementations dynamically change inside fragmented objects flexible internal partitioning achieved providing transparent fault-tolerant replications well | [
6025,
2109
] | Test |
6,035 | 4 | Alan_Sherman:alan sherman alan theodore sherman born february 26 1957 full professor computer science umbc director umbc center information security assurance cisa director umbc chess program sherman editor cryptologia member phi beta kappa sigma xi sherman earned bachelor degree mathematics brown university 1978 master degree electrical engineering computer science mit 1981 ph.d. degree computer science mit 1987 professor sherman research interests include security voting systems cryptology information assurance discrete algorithms sherman faculty advisor umbc chess club since 1991 playing student vs. faculty match recruits chess players worldwide academic scholarships umbc ranked among best college teams winning pan american intercollegiate team chess championship 1996 1998 1999 2000 2001 2002 2005 2008 2009 2012 1997 received meritorious service award uscf contributions college chess | [
5568,
1805,
1243
] | Test |
6,036 | 4 | V-Key:v-key v-key software-based digital security solutions provider headquartered singapore provides back-end front-end solutions financial institutions mobile payment providers governments implement cloud-based payments authentication mobile banking secured mobile applications user access data protection v-key founded 2011 entrepreneur eddie chau benjamin mah joseph gan.eddie chau also formed digital agency brandtology acquired isentia 2014 started v-key primarily secure mobile devices applications patented technology benjamin mah co-founder chief executive officer v-key general manager e-cop acquired wholly owned subsidiary temasek holdings regional director encentuate acquired ibm co-founded v-key concurrently venture partner venture craft chairman jumpstart asia mentor uob finlabs joseph gan third co-founder v-key joining v-key centre strategic infocomm technologies csit head cryptography lab oversaw research development cryptographic solutions ministry defence singapore companies funded v-key ipv capital ant financial services runs alipay mobile wallet app v-key provides security solutions businesses support cloud-based payments digital identity authentication mobile banking well secured mobile applications via core technology—v-os v-os virtual secure element globally patented certified industry bodies including info-communications media development authority singapore imda national institute standards technology fips 140-2 validation united states technology provides secure data transmission solution used encrypted communications mobile soft token replace hardware tokens well mobile authentication solutions v-key partners financial institutions governments mobile payment providers various markets technology used v-key received following awards | [
298,
7633,
6515,
2566,
7865,
3794
] | Validation |
6,037 | 1 | PastPerfect_Museum_Software:pastperfect museum software pastperfect museum software application collections archiving designed museums may used various institutions including libraries archives natural history collections pastperfect allows database storage artifacts documents photographs library books pastperfect utilized 9000 museums nationwide pastperfect introduced 1998 primary product pastime software company inc released version 2 later year updated version three 2001 version four 2004 updated version five 2010 remains current edition program pastime software company eventually changed name pastperfect software inc. 2007 pastperfect operates four basic catalogs sorting collections material archive catalog storing documents photograph catalog storing photos tintypes paintings etc objects catalog storing three-dimensional artifacts library catalog storing books would included institution library images uploaded catalog multiple photos per record also stores donor information automatically generates deed gift forms thank letters upon completing certain steps accessioning process certain extensions allow inclusion oral history records transcripts additional online function allows institutions digitize collections make free browse internet pastperfect also contains contact list function storing donors members employee contact information similar catalog format rest program | [] | Test |
6,038 | 7 | MVaaS:mvaas mvaas acronym managed video service refers systems architecture used companies provide enable video monitoring services allow customers easily manage large numbers digital video recorders dvrs network video recorders nvrs scalable video monitoring architecture information customer ’ physical locations video recorders cameras locations customer ’ users must stored central database traditional architecture customer responsible hosting database mvaas architecture database managed video monitoring provider customer customer interacts database video recorders using website also managed video monitoring provider customer freed details hosting database web site information sometimes said “ cloud ” indeed term mvaas intentionally similar common term saas software service term managed video refers fact architecture customer ’ video remains video recorders customer premises stored central database central database holds information mediates access video important maintaining configuring video recorders contain video ensures customer always ultimate control video frees customer video monitoring company continuously consume bandwidth transfer video video recorders central database mvaas architecture additional information may stored central database besides information video recorders users example video monitoring company may store observations comments camera log camera monitored alternative mvaas hosted video service hvaas architecture like mvaas except customer ’ video physically stored central database customers prefer allows simplify video recorders premises | [
2961,
330,
2054
] | Test |
6,039 | 2 | FLASK:flask flux advanced security kernel flask operating system security architecture provides flexible support security policies joint venture national security agency university utah secure computing corporation project designed provide framework secure operating system development implementation started mach microkernel since shifted focus linux operating system flask core framework security-focused operating systems nsa security-enhanced linux selinux opensolaris fmac trustedbsd means selinux thought implementation flask | [
5275,
6725,
5571,
5021,
578,
6842,
1805
] | Validation |
6,040 | 2 | IPad_Air_2:ipad air 2 ipad air 2 second-generation ipad air tablet computer designed developed marketed apple inc announced october 16 2014 alongside ipad mini 3 released october 22 2014 ipad air 2 thinner faster predecessor ipad air features touch id height screen size ipad air ipad air 2 discontinued march 21 2017 successor 2019 ipad air released march 18 2019 ipad air 2 announced keynote october 16 2014 first ipad feature touch id theme keynote way long air 2 began arriving retail stores october 22 2014 slogan device change air release new ipad pro slogan device changed light heavyweight ipad air 2 ships ios 10 formerly ios 8 later ios 9 operating system pre-installed includes version apple pay in-store nfc functionality removed included touch id sensor allows user pay items online without needing enter user card details ios 10 comes several built-in applications camera photos messages facetime mail music safari maps siri calendar itunes store app store notes contacts ibooks home reminders clock videos news photo booth podcasts apple app store digital application distribution platform ios allows users browse download applications made various developers itunes store additional apps made apple available free download imovie garageband itunes u find iphone find friends apple store trailers remote iwork apps pages keynote numbers like ios devices ipad air 2 also sync content data mac pc using itunes although tablet designed make phone calls cellular network place receive phone calls iphone cellular connection using apple continuity feature supported ios 8 later versions ios os x yosemite later versions macos using voip application skype june 8 2015 announced wwdc ipad air 2 would support ios 9 new features released q3 2015 air 2 users ios 9 able use slide picture picture split view slide allows user slide second app side screen smaller window display information alongside initial app picture picture allows user watch video small resizable moveable window remaining another app split view allows user run two apps simultaneously 50/50 view ipad air 2 inherits hardware similar iphone 6 iphone 6 plus major change processor apple a8x high-end 3-core variant apple a8 ipad air 2 2 gb ram making ipad air 2 first ios device 1 gb ram powervr gpu 8 cores also uses apple m8 motion co-processor barometer first generation ipad inherit fingerprint touch id sensor iphone addition compared ipad air includes improved 8-megapixel 3264×2448 rear-facing camera 10 fps burst mode slow motion video 120 fps similar iphone 5s camera capabilities front-facing facetime hd camera also improved larger ƒ/2.2 aperture allows 81 light image apple added gold option existing silver space gray color choices ipad air 2 previous existing colors used preceding ipad air unlike ipad predecessors mute/orientation lock switch removed accommodate reduced depth instead user must use control center access functions slightly smaller battery compared ipad air although apple claims 10-hour battery life ipad air 2 available 16 32 64 128 gb storage options storage expansion options apple released camera connection kit sd card reader used transfer photos videos ipad verge called air 2 best tablet ever made giving score 9.3 10 noting offered iterative improvement missed opportunities design | [
6788,
3940,
7890,
5732,
722,
1094,
4320,
2926,
4690,
5037,
734,
5752,
405,
6125,
2954,
1123,
7572,
6482,
6847,
6142,
2609,
1895,
4373,
7226,
4376,
2978,
5091,
4749,
5450,
7601,
3346,
6165,
4389,
5463,
102,
5469,
4768,
3001,
2284,
3008,
... | Test |
6,041 | 3 | Macintosh_Quadra_605:macintosh quadra 605 macintosh quadra 605 also sold macintosh lc 475 macintosh performa 475 personal computer designed manufactured sold apple computer inc. october 1993 july 1996 model names reflect decision made apple 1993 follow emerging industry trend naming product families target customers quadra business lc education performa home accordingly performa 475 476 sold department stores electronics stores circuit city whereas quadra purchased authorized apple reseller introduced quadra 605 least expensive new computer apple lineup performa 410 introduced time price 1,000 usd included monitor based much older macintosh lc ii 16 mhz 68030 processor quadra 605 reuses macintosh lc iii pizza box form factor minor modifications quadra 605 discontinued october 1994 lc 475 variant continued sold schools july 1996 apple offered direct replacement machines making final macintosh use lc lightweight slim-line form factor apple would release another desktop computer mac mini nearly ten years later models come standard 68lc040 cpu running 25 mhz 4 mb ram board 512 kb vram expandable 1 mb 1 lc iii-style processor direct slot 1 adb 2 serial ports external scsi port manual-inject floppy drive introduced october 18 1993 introduced october 21 1993 central processing unit 25 mhz mc68lc040 32-bit bus 8 kb on-chip l1 cache divided 4 kb data 4 kb instruction cache caches although l2 cache possible via lc pds card 68lc040 replaced 68040 includes onboard floating point unit approximately triple speed floating point operations random access memory 4 mb motherboard one 72-pin simm socket 80 ns faster simms official supported maximum ram 36 mb one 32 mb 72-pin simm plus 4 mb motherboard larger simms work—up 128 mb may used limits ram type physical limits might apply side simm facing cpu thicker chips clips simm socket close around automatically possible manually push clips enough hold simm place djmemc memory controller used quadra 605 predecessors quadra/centris 610 quadra/centris 650 quadra 800 recognize simms 32 mb newer memcjr used quadra 605 recognizes larger sizes video video provided one da15f connector compatible vga monitors use adaptor two internal video ram slots take either two 256 kb 80 ns 68-pin vram simms two 512 kb simms installing one 512 kb one 256 kb vram simm garbles display resolutions colors available two vram configurations shown table audio recording possible 11,000 22,000 samples/second filters applied 3.5 khz 7 khz respectively recording floppy drive 1.4 mb superdrive manual-inject hard drive 80 mb 160 mb 230 mb scsi hard drive depending model battery quadra 605s take lithium half-aa cell 3.6 v battery battery drained video start start quadra 605 flat missing battery turned seconds turned second leaves enough charge system capacitors video start power supply 30 watts standard many second-hand machines come replacement psus either third-party apple replacement stripped earlier lc models go 45 watts quadra 605 registered energy star-compliant product weight 8.8 lb 4 kg standard quadra 605 support monitor 35 lb 15.9 kg dimensions 2.9 high x 12.2 wide x 15.3 deep 7.4 cm high x 31 cm wide x 38.8 cm deep quadra 605 contains one lc iii-style 68030-compatible lc processor direct slot mechanically compatible previous models lc pds take 96-pin 114-pin lc pds slot cards true lc pds emulates previous machine 68030 slot due success lc pds earlier macs many expansion options already manufactured apple kept slot type 68040 machines quadra 605 lc pds mostly 68030-compatible expansion cards made specifically '030 processors 68881 68882 fpus work addition utilize apple iie card allows 605 emulate apple iie quadra 605 one scsi bus 50-pin internal connector space one low-profile 3.5 scsi device one 25-pin db25f external connector scsi provided ncr 53c96 controller achieve 6 mb/s internally fast enough drive 4 mb/s externally two serial ports provided quadra 605 one 8-pin mini-din printer port one 9-pin mini-din modem port similar printer port extra pin supply +5 v power adb power supply apple recommends 100 drawn pin quadra 605 like macintoshes manufactured 1999 includes apple desktop bus port use keyboard mouse low-speed low-power peripherals earlier models also contain rom simm socket located left vram simms made slot boards contain solder pads indicating position roms used production machines two surface mount chips located directly behind cpu quadra 605s use 1024 kb rom version 7c quadra 605 compatible apple macintosh processor upgrade card provided 50 mhz powerpc 601 cpu daystar digital sonnet manufactured 100 mhz versions card could also used quadra 605 upgrade cards fitted lc pds expansion slot making slot unavailable expansion cards quadra 605s cuda reset switch used manually reset pram located towards rear motherboard front audio port labeled s1 others include switch instead two solder pads within silkscreened square keyboard power-on key start quadra 605 soft power-on rocker switch back turn quadra 605 pressing power-on key booted selecting shut command finder quadra 605 completed shutdown process prompt operator manually turn quadra 605s reset button programmer button key combinations perform functions reset users hold command control power keys programmer button click users hold command power keys hard crash situations even enough restore system case power switch recourse modified quadra 605 motherboard used basis early apple interactive television box prototypes later prototypes used board design still retained resemblance 605 standard gestalt id 25 mhz quadra 605 94 id logic board quadra 605 shares lc/performa models depends two things jumper j18 located behind hard drive identify computer quadra 605 id 94 25 mhz lc475/performa 47x id 89 25 mhz over-clocking under-clocking motherboard also changes gestalt id list gestalt ids returned various logic board modifications speed reported newer technology clockometer follows standard quadra 605 capable running classic mac os versions 7.1 7.1.1 pro 7.5 7.5.1 7.5.3 7.5.5 7.6 7.6.1 8.0 8.1 powerpc upgrade installed run 8.5 8.5.1 8.6 9.0 9.0.1 9.0.2 9.0.3 9.0.4 9.1 versions system software 7.5 require use system enabler 065 quadra 605 running version system 7.1 over-clocking standard 25 mhz 33 mhz change gestalt id enabler recognize new id under-clocking 20 mhz however change gestalt id one enabler n't recognize compatible system wo n't boot system 7.5 later affected issue | [
7890,
5732,
722,
1094,
2926,
5037,
5752,
405,
2954,
7572,
6482,
6142,
4373,
7226,
2978,
7601,
4749,
3346,
5100,
6165,
4389,
5463,
102,
5469,
4768,
3008,
5477,
6200,
6202,
3387,
3390,
1216,
2331,
4820,
4453,
1234,
1237,
7311,
889,
550,
5... | Test |
6,042 | 4 | Network_intelligence:network intelligence network intelligence ni technology builds concepts capabilities deep packet inspection dpi packet capture business intelligence bi examines real time ip data packets cross communications networks identifying protocols used extracting packet content metadata rapid analysis data relationships communications patterns also sometimes referred network acceleration piracy ni used middleware capture feed information network operator applications bandwidth management traffic shaping policy management charging billing including usage-based content billing service assurance revenue assurance market research mega panel analytics lawful interception cyber security currently incorporated wide range applications vendors provide technology solutions communications service providers csps governments large enterprises ni extends network controls business capabilities security functions data mining new products services needed since emergence web 2.0 wireless 3g 4g technologies evolution growth internet wireless technologies offer possibilities new types products services well opportunities hackers criminal organizations exploit weaknesses perpetrate cyber crime network optimization security solutions therefore need address exponential increases ip traffic methods access types activity volume content generated traditional dpi tools established vendors historically addressed specific network infrastructure applications bandwidth management performance optimization quality service qos dpi focuses recognizing different types ip traffic part csp ’ infrastructure ni provides granular analysis enables vendors create information layer metadata ip traffic feed multiple applications detailed expansive visibility network-based activity ni technology goes beyond traditional dpi since recognizes protocols also extracts wide range valuable metadata ni ’ value-add solutions traditionally based dpi attracted attention industry analysts specialize dpi market research example heavy reading includes ni companies deep packet inspection semi-annual market tracker much way bi technology synthesizes business application data variety sources business visibility better decision-making ni technology correlates network traffic data variety data communication vehicles network visibility enabling better cyber security ip services ongoing changes communications networks information exchanged people longer linked exclusively physical subscriber lines person communicate multiple ways – ftp webmail voip instant messaging online chat blogs social networks – different access points via desktops laptops mobile devices ni provides means quickly identify examine correlate interactions involving internet users applications protocols whether protocols tunneled follow osi model technology enables global understanding network traffic applications need correlate information contacts accesses database information viewed combined traditional bi tools examine service quality customer care ni creates powerful nexus subscriber network data telcos internet service providers isps mobile network operators mnos increasing competitive pressures move smart pipe business models cost savings revenue opportunities driving smart pipe strategies also apply network equipment providers software vendors systems integrators serve industry ni captures detailed information hundreds ip applications cross mobile networks provides required visibility analysis user demand create deliver differentiating services well manage usage deployed customer metrics especially important telecom companies understand consumer behaviors create personalized ip services ni enables faster sophisticated audience measurement user behavior analysis customer segmentation personalized services real-time network metrics equally important companies deliver manage services ni classifies protocols applications layers 2 7 generates metadata communication sessions correlates activity layers applicable bandwidth resource optimization quality service qos content-based billing quality experience qoe voip fraud monitoring regulatory compliance economics deployment speed cloud computing fueling rapid adoption companies government agencies among concerns however risks information security e-discovery regulatory compliance auditing ni mitigates risks providing infrastructure service iaas platform service paas software service saas vendors real-time situational awareness network activity critical transparency allay fears potential customers vendor demonstrate hardened network security prevent data leakage data theft irrefutable audit trail network transaction – communication content – related customer ’ account assuming compliance regulation standards ni extracts correlates information contacts providing situational awareness lawful interception cyber security real-time data capture extraction analysis allow security specialists take preventive measures protect network assets real time complement post-mortem analysis attack ni combines real-time network monitoring ip metadata extraction enhances effectiveness applications database security database auditing network protection network visibility afforded ni also used build enhancements next-generation solutions network performance management wan optimization customer experience management content filtering internal billing networked applications | [
906,
2961,
5564,
5943,
651,
6879,
330
] | Validation |
6,043 | 4 | Check_Point:check point check point multinational provider software combined hardware software products security including network security endpoint security cloud security mobile security data security security management check point established ramat-gan israel 1993 gil shwed ceo marius nacht chairman shlomo kramer left check point 2003 shwed initial idea company core technology known stateful inspection became foundation company first product firewall-1 soon afterwards also developed one world first vpn products vpn-1 shwed developed idea serving unit 8200 israel defense forces worked securing classified networks initial funding us 400,000 provided venture capital fund brm group 1994 check point signed oem agreement sun microsystems followed distribution agreement hp 1995 year u.s. head office established redwood city california february 1996 company named worldwide firewall market leader idc market share 40 percent june 1996 check point raised 67 million initial public offering nasdaq 1998 check point established partnership nokia bundled check point software nokia computer network security appliances 2003 class action lawsuit filed check point violation securities exchange act failing disclose major financial information first decade 21st century check point started acquiring security companies including nokia network security business unit 2009 2019 researchers check point found security breach xiaomi phone apps security flaw reported preinstalled check point presently focused calls fifth generation cyber security “ gen v. ” identifies fifth generation focused large-scale fast moving attacks across mobile cloud on-premise networks easily bypass conventional static detection-based defenses used organizations today years many employees worked check point left start software companies include shlomo kremer started imperva nir zuk founded palo alto networks ruvi kitov reuven harrison tufin yonadav leitersdorf founded indeni check point offers following primary products 2005 check point tried acquire intrusion prevention system developers sourcefire 225 million later withdrew offer became clear us authorities specifically committee foreign investment united states would try block acquisition sofaware technologies founded 1999 cooperation check point sofaware founders adi ruppin etay bogner purpose extending check point enterprise market small business consumer branch office market sofaware co-founder adi ruppin said company wanted make technology simple use affordable lift burden security management end users adding features 2001 sofaware began selling firewall appliances sofaware s-box brand 2002 company started selling safe office safe home line security appliances check point brand fourth quarter 2002 sales sofaware safe office firewall/vpn appliances increased greatly sofaware held 1 revenue position worldwide firewall/vpn sub- 490 appliance market 38 revenue market share relations check point sofaware founders went sour company acquisition 2002 2004 etay bogner co-founder sofaware sought court approval file shareholder derivative suit claiming check point transferring funds sofaware required use sofaware products technology derivative suit ultimately successful check point ordered pay sofaware 13 million shekels breach contract 2006 tel aviv district court judge ruled bogner sofaware could sue check point proxy 5.1 million alleged damage sofaware bogner claimed check point owned 60 sofaware behaved belligerently withheld monies due use sofaware technology products check point appealed ruling lost 2009 israeli supreme court ruled group founders sofaware includes bogner veto power decision sofaware court ruled three founders could exercise veto power group majority rule 2011 check point settled litigation relating sofaware part settlement acquired sofaware shares held bogner ruppin began process acquiring remaining shares resulting sofaware becoming wholly owned subsidiary | [
1459,
385,
1838,
4689,
2213,
7193,
62,
7597,
88,
6868,
5452,
91,
6874,
5459,
6515,
4034,
6526,
1931,
6179,
6899,
5124,
2296,
4783,
496,
5144,
142,
6560,
6219,
4456,
3756,
7319,
4115,
3764,
5905,
3089,
4492,
4138,
910,
2746,
3111,
2399,
... | Test |
6,044 | 5 | Generic_Stream_Encapsulation:generic stream encapsulation gse provides additional features beyond pure carriage ip datagrams increase protocol flexibility applicability key gse functions/characteristics protocol specification published etsi ts 102 606 accompanying implementation guidelines document published etsi ts 102 771 ip datagrams ethernet frames network layer packets encapsulated one gse packets encapsulation process adds control information network protocol type address label provides overall integrity check needed payload frame may encapsulated single gse packet sliced fragments encapsulated several gse packets gse packets general variable length order match input ip traffic minimum overhead gse packets may sent different base band frames necessarily consecutive transmission parameters modulation format coding rate constraint gse packet position within base band frame assumed however gse packets may reordered encapsulator de-encapsulator general base band frame contain single gse packet base band frames may fixed variable length gse provide mechanism integrity check single gse packet crc-32 appended last fragment fragmented payload verify correctness reassembly operation gse relies physical layer able ensure required error detection and/or correction probability gse packet header highly dynamic provides many options minimum header two bytes comprising three flags fields 12-bit payload length field diagram shows possible fields basic mechanism gse payload fragmentation uses start end flags start flag indicates beginning payload frame end flag indicates end shown diagram dvb-s2 dvb-t2 dvb-c2 acm/vcm modes may cause base band frames vary size depending transmission conditions hence may situations first fragments payload frame sent encapsulator forced set aside current payload frame start working new one may e.g occur large fragments prepared transmission conditions fine suddenly conditions deteriorate small base band frames available fragment id field becomes important short-term identification payload frame whenever encapsulator needs move next payload frame without finished transmitting previous one uses next available fragment id way 256 payload frames kept open time decapsulator uses fragment id pick reassembly buffer store fragment label type lt bits determine gse packet address encoded according following table gse packet containing last fragment payload frame carries crc-32 checksum payload frame checksum used detect loss intermediate fragments checksum 32 bit value calculated according generator polynomial represented 0x104c11db7 formula_1 last fragment payload frame lost decapsulator directly detect fact never sees gse frame end flag set containing crc-32 situation decapsulator must choose suitable time-out based data-rate application since gse packets directly inserted base-band frames modulation scheme gse products come form gse routers gse modems outside act much like dsl router dsl modem used consumers generically devices also referred gse encapsulators products standard ip network interface often ethernet similar lan interface collect ip traffic forwarded uni-directional link end optimise packaging base-band frames devices typically generate complete base-band frames gse packets payload transferred dvb-s2 dvb-t2 dvb-c2 modulator second interface likely incomplete list gse en- decapsulators many ip-over-satellite service offerings including instance astra2connect ses tooway eutelsat little detail however known protocols used since receivers provided part service operators little technical detail disclosed | [
7148,
456,
6879,
2281,
6521,
6976,
3775,
3855,
2644,
7170,
6619,
6531,
1462,
2650,
7637,
2566,
2119,
6908,
5492,
7091,
3383,
2219,
494,
3640,
3797,
2043,
3312,
2057,
3819,
3820,
3821,
7214,
7217,
7765,
259,
5880,
5181
] | Test |
6,045 | 5 | Diameter_(protocol):diameter protocol diameter authentication authorization accounting protocol computer networks evolved earlier radius protocol belongs application layer protocols internet protocol suite diameter applications extend base protocol adding new commands and/or attributes use extensible authentication protocol eap name play words derived radius protocol predecessor diameter twice radius diameter directly backwards compatible provides upgrade path radius main features provided diameter lacking radius also like radius intended work local roaming aaa situations uses tcp sctp unlike radius uses udp unlike radius includes encryption protected transport level security ipsec tls base size av identifier 32 bit unlike radius uses 8 bit base av identifier size like radius supports stateless well stateful modes like radius supports application layer acknowledgment defines failover diameter used many different interfaces defined 3gpp standards interface typically defining new commands attributes diameter application software application protocol based diameter base protocol defined rfc 6733 rfc 7075 obsoletes rfc 3588 application defined application identifier add new command codes and/or new mandatory avps attribute-value pair adding new optional avp require new application examples diameter applications generic bootstrapping architecture bootstrapping server function diameter protocol initially developed pat r. calhoun glen zorn ping pan 1998 provide framework authentication authorization accounting aaa could overcome limitations radius radius issues reliability scalability security flexibility radius deal effectively remote access ip mobility policy control diameter protocol defines policy protocol used clients perform policy aaa resource control allows single server handle policies many services like radius diameter provides aaa functionality uses tcp sctp instead udp therefore delegating detection handling communication problems protocols diameter protocol enhanced development 3rd generation partnership project 3gpp ip multimedia subsystem ims cx dh dx rf ro sh zh interfaces supported diameter applications use extensions protocol designed extensible support proxies brokers strong security mobile ip network-access servers nasreq accounting resource management diameter base protocol defined rfc 6733 obsoletes rfc 3588 defines minimum requirements aaa protocol diameter applications extend base protocol adding new commands attributes diameter security provided ipsec tls iana assigned tcp sctp port number 3868 diameter packet consists diameter header variable number attribute-value pairs avps encapsulating information relevant diameter message field indicates version diameter base protocol 2014 value supported 1 message length field indicates length diameter message bytes including header fields padded avps r request bit – set message request cleared message answer p proxiable bit – set message may proxied relayed redirected cleared message must locally processed e error bit – set message contains protocol error message conform ccf described command messages e bit set commonly referred error messages bit must set request messages potentially re-transmitted message bit – flag set link failover procedure aid removal duplicate requests set resending requests yet acknowledged indication possible duplicate due link failure command request/answer pair assigned command code whether request answer identified via ’ r ’ bit command flags field header values 0-255 reserved radius backward compatibility values 256-16777213 permanent standard commands allocated iana values 16777214 16777215 hex 0xfffffe 0xffffff reserved experimental testing purposes command code used determine action taken particular message common diameter commands defined protocol base applications application-id used identify diameter application message applicable application authentication application accounting application vendor-specific application diameter agents conforming certain diameter extension publicize support including specific value auth-application-id attribute capabilities-exchange-request cer capabilities-exchange-answer cea command value application-id field header relevant application-id avps contained message instance value application-id auth-application-id attribute credit-control-request ccr credit-control-answer cca command diameter credit-control application 4 hop-by-hop identifier unsigned 32-bit integer field network byte order used match requests answers value request used response diameter protocol requires relaying proxying agents maintain transaction state used failover purposes transaction state implies upon forwarding request hop-by-hop identifier saved field replaced locally unique identifier restored original value corresponding answer received request ’ state released upon receipt answer received answers match known hop-by-hop identifier ignored diameter agent case redirecting agents hop-by-hop identifier maintained header diameter agent responds answer message end-to-end identifier unsigned 32-bit integer field network byte order used detect duplicate messages along combination origin-host avp creating request end-to-end identifier set locally unique value end-to-end identifier modified diameter agents kind value corresponding request used answer simplicity v bit means vendor specific bit means mandatory p bit means protected v bit known vendor-specific bit indicates whether optional vendor-id field present avp header set avp code belongs specific vendor code address space bit known mandatory bit indicates whether support avp required avp bit set received diameter client server proxy translation agent either avp value unrecognized message must rejected diameter relay redirect agents must reject messages unrecognized avps p bit indicates need encryption end-to-end security rfc 3588 defines core state machine maintaining connections peers processing messages part basic protocol functionality stacks support abstract connectivity related operations additionally application specific state machines introduced either later higher abstraction layer rfc 3588 defines authorization accounting state machine communication two diameter peers starts establishment transport connection tcp sctp initiator sends capabilities-exchange-request cer peer responds capabilities-exchange-answer cea rfc3588 compliant peers tls transport layer security may optionally negotiated rfc6733 compliant peers tls negotiation may optionally happen cer/cea connection ready exchanging application messages messages exchanged time either side may send device-watchdog-request dwr peer must respond device-watchdog-answer either side may terminate communication sending disconnect-peer-request dpr peer must respond disconnect-peer-answer transport connection disconnected diameter protocol currently defined following ietf rfcs obsolete rfcs indicated strikethrough text | [
7148,
3,
456,
6879,
2281,
2993,
6521,
6976,
991,
3775,
3855,
2644,
7170,
1460,
6531,
1462,
1464,
2650,
6717,
7637,
2119,
6908,
3293,
3794,
3637,
7091,
2219,
3383,
3640,
3797,
2043,
3312,
4261,
2057,
3819,
3820,
1593,
3821,
4817,
7214,
7... | Test |
6,046 | 2 | USENIX:usenix usenix association supports operating system research founded 1975 name unix users group focusing primarily study development unix similar systems june 1977 lawyer corporation informed group could use word unix trademark western electric manufacturing arm 1995 led change name usenix since grown respected organization among practitioners developers researchers computer operating systems generally since founding published technical journal entitled usenix started technical organization commercial interest grew number separate groups started parallel notably software tools users group stug technical adjunct unix-like tools interface non-unix operating systems /usr/group commercially oriented user group sponsors several conferences workshops year notably usenix symposium operating systems design implementation osdi usenix symposium networked systems design implementation nsdi usenix annual technical conference usenix security symposium usenix conference file storage technologies fast lisa formerly sage large installation system administration conference lisa usenix founding president lou katz usenix became first computing association provide open access conference workshop papers 2008. remains one done since 2011 included audio video recordings paper presentations open-access materials award also called flame award presented since 1993 | [
4569,
5275,
1528,
4030,
5278,
2823,
1168,
4764,
1822,
2379,
5993,
6411,
6797,
7802,
3856,
3624,
1366,
206,
5571,
486,
217,
4877,
4424,
6367,
6823,
6369,
6117,
1859,
2129,
5319,
1294,
1863,
2767,
3126,
414,
939,
594,
6470,
5865,
2512,
47... | Test |
6,047 | 1 | Foreign_Ship_Registry_Act:foreign ship registry act foreign ship registry act federal legislation provided admission foreign-built ships american registry provided admission foreign-built ships american registry foreign trade making easier legally hoist american flag bill provided survey measurement inspection ships though require american ownership majority stock corporations applying american registry clear violation international custom international law theoretically germany could get american registration hoist u.s. flag merchant vessels avoid british blockade possibility provoked much british protest however german owners vessels american harbors dared risk losing property take advantage act september 7 1917 president woodrow wilson issued executive order 2696 suspending united states statute period two years | [
2188
] | Train |
6,048 | 2 | Thomas_Bushnell:thomas bushnell thomas bushnell bsg formerly known michael bushnell born december 13 1967 software developer gregorian friar founder principal architect gnu official kernel project gnu hurd bushnell also hurd official maintainer instigation november 2003 posted gnu project discussion mailing list saying dismissed richard stallman criticizing gnu free documentation license stallman said dismissal bushnell inactive since 2001 n't responding mail bushnell currently maintains debian packages employed google llc member saint mark episcopal church glendale ca | [
1523,
8158,
3174,
1351,
2559,
7823,
3868,
6365,
7463,
7559,
3981,
4070,
2599,
1406,
6674,
5787,
966
] | Test |
6,049 | 4 | Public-key_cryptography:public-key cryptography public-key cryptography asymmetric cryptography cryptographic system uses pairs keys public keys may disseminated widely private keys known owner generation keys depends cryptographic algorithms based mathematical problems produce one-way functions effective security requires keeping private key private public key openly distributed without compromising security system person encrypt message using receiver public key encrypted message decrypted receiver private key robust authentication also possible sender combine message private key create short digital signature message anyone corresponding public key combine message putative digital signature known public key verify whether signature valid i.e made owner corresponding private key public key algorithms fundamental security ingredients modern cryptosystems applications protocols assuring confidentiality authenticity non-repudiability electronic communications data storage underpin various internet standards transport layer security tls s/mime pgp gpg public key algorithms provide key distribution secrecy e.g. diffie–hellman key exchange provide digital signatures e.g. digital signature algorithm provide e.g. rsa mid-1970s cipher systems using symmetric key algorithms cryptographic key used underlying algorithm sender recipient must keep secret necessity key every system exchanged communicating parties secure way prior use system – secure channel requirement never trivial rapidly becomes unmanageable number participants increases secure channels n't available key exchange sensible cryptographic practice keys frequently changed particular messages meant secure users separate key required possible pair users contrast public key system public keys disseminated widely openly private key needs kept secure owner two best-known uses public key cryptography one important issue confidence/proof particular public key authentic i.e correct belongs person entity claimed tampered replaced malicious third party several possible approaches including public key infrastructure pki one third parties – known certificate authorities – certify ownership key pairs tls relies upon web trust decentralizes authentication using individual endorsements link user public key pgp uses approach well lookup domain name system dns dkim system digitally signing emails also uses approach obvious application public key encryption system encrypting communication provide confidentiality – message sender encrypts using recipient public key decrypted recipient paired private key another application public key cryptography digital signature digital signature schemes used sender authentication non-repudiation system use digital signatures ensure one party successfully dispute authorship document communication applications built foundation include digital cash password-authenticated key agreement time-stamping services non-repudiation protocols etc asymmetric key algorithms nearly always much computationally intensive symmetric ones many cases common exchange key using key-exchange algorithm transmit data using key symmetric key algorithm pgp ssh ssl/tls family schemes use procedure thus called hybrid cryptosystems like security-related systems important identify potential weaknesses public key schemes theory susceptible brute-force key search attack attacks however impractical amount computation needed succeed – termed work factor claude shannon – reach potential attackers many cases work factor increased simply choosing longer key algorithms may much lower work factors making resistance brute-force attack irrelevant special specific algorithms developed aid attacking public key encryption algorithms – rsa elgamal encryption known attacks much faster brute-force approach major weaknesses found several formerly promising asymmetric key algorithms knapsack packing algorithm found insecure development new attack recently attacks based careful measurements exact amount time takes known hardware encrypt plain text used simplify search likely decryption keys side-channel attack great deal active research currently underway discover protect new attack algorithms another potential security vulnerability using asymmetric keys possibility man-in-the-middle attack communication public keys intercepted third party man middle modified provide different public keys instead encrypted messages responses must also intercepted decrypted re-encrypted attacker using correct public keys different communication segments instances avoid suspicion attack may seem difficult implement practice impossible using insecure media e.g. public networks internet wireless forms communications – example malicious staff member internet service provider isp might find quite easy carry one approach prevent attacks involves use public key infrastructure pki set roles policies procedures needed create manage distribute use store revoke digital certificates manage public-key encryption however turn potential weaknesses example certificate authority issuing certificate must trusted properly checked identity key-holder must ensure correctness public key issues certificate must secure computer piracy must made arrangements participants check certificates protected communications begin web browsers instance supplied long list self-signed identity certificates pki providers – used check bona fides certificate authority second step certificates potential communicators attacker could subvert single one certificate authorities issuing certificate bogus public key could mount man-in-the-middle attack easily certificate scheme used alternate scenario rarely discussed attacker penetrated authority servers obtained store certificates keys public private would able spoof masquerade decrypt forge transactions without limit despite theoretical potential problems approach widely used examples include tls predecessor ssl commonly used provide security web browser transactions example securely send credit card details online store aside resistance attack particular key pair security certification hierarchy must considered deploying public key systems certificate authority – usually purpose-built program running server computer – vouches identities assigned specific private keys producing digital certificate public key digital certificates typically valid several years time associated private keys must held securely time private key used certificate creation higher pki server hierarchy compromised accidentally disclosed man-in-the-middle attack possible making subordinate certificate wholly insecure examples well-regarded asymmetric key techniques varied purposes include examples asymmetric key algorithms widely adopted include examples notable – yet insecure – asymmetric key algorithms include examples protocols using asymmetric key algorithms include early history cryptography two parties would rely upon key would exchange means secure non-cryptographic method face-to-face meeting trusted courier key parties kept absolutely secret could used exchange encrypted messages number significant practical difficulties arise approach distributing keys 1874 book principles science william stanley jevons wrote reader say two numbers multiplied together produce number 8616460799 think unlikely anyone ever know described relationship one-way functions cryptography went discuss specifically factorization problem used create trapdoor function july 1996 mathematician solomon w. golomb said jevons anticipated key feature rsa algorithm public key cryptography although certainly invent concept public key cryptography 1970 james h. ellis british cryptographer uk government communications headquarters gchq conceived possibility non-secret encryption called public key cryptography could see way implement 1973 colleague clifford cocks implemented become known rsa encryption algorithm giving practical method non-secret encryption 1974 another gchq mathematician cryptographer malcolm j. williamson developed known diffie–hellman key exchange scheme also passed usa national security agency military focus low computing power power public key cryptography unrealised organisations judged important military use ... share key rapidly electronically major advantage opponent end evolution berners-lee designing open internet architecture cern adaptation adoption arpanet ... public key cryptography realise full potential —ralph benjamin discovery publicly acknowledged 27 years research declassified british government 1997 1976 asymmetric key cryptosystem published whitfield diffie martin hellman influenced ralph merkle work public key distribution disclosed method public key agreement method key exchange uses exponentiation finite field came known diffie–hellman key exchange first published practical method establishing shared secret-key authenticated confidential communications channel without using prior shared secret merkle public key-agreement technique became known merkle puzzles invented 1974 published 1978 1977 generalization cocks scheme independently invented ron rivest adi shamir leonard adleman mit latter authors published work 1978 algorithm came known rsa initials rsa uses exponentiation modulo product two large primes encrypt decrypt performing public key encryption public key digital signature security connected extreme difficulty factoring large integers problem known efficient general technique since 1970s large number variety encryption digital signature key agreement techniques developed field public key cryptography including rabin cryptosystem elgamal encryption dsa elliptic curve cryptography | [
363,
359,
1811,
6795,
1821,
716,
376,
2918,
6430,
1460,
3277,
2566,
1843,
7548,
5399,
1480,
744,
6458,
2587,
7200,
7567,
5765,
7925,
5773,
5776,
2962,
7214,
433,
1505,
1146,
6501,
1513,
2620,
4746,
7604,
4025,
794,
3350,
1168,
464,
807,... | Test |
6,050 | 2 | Stand-alone_shell:stand-alone shell stand-alone shell codice_1 unix shell designed use recovering certain types system failures built-in commands sash libraries linked statically unlike shells linux standard unix commands rely external libraries example copy command cp requires libc.so ld-linux.so built gnu core utilities linux libraries get corrupted coreutils cp command would work however sash built-in command cp would unaffected earlier times critical commands including shells /sbin even /bin statically linked purpose whereas /usr/sbin /usr/bin would find feature-rich versions dynamically linked common anymore statically linked shells built-in commands become important sash following built-in commands sash shell also ported work androidin terminal-interface sash-plus-patches collection patches sash key features codice_32 codice_33 codice_19 commands however functions available newer versions sash functions provide interfaces respective linux system calls especially useful sash used initial ramdisk initrd environment addition simple shell variable expansion support added e.g. variable var replaced content environment variable var linux distributions debian slackware via slackbuilds.org available | [
361,
362,
1524,
3507,
5803,
2817,
3685,
6789,
1537,
108,
7075,
5480,
304,
1842,
3106,
5571,
578,
923,
1284,
5138,
7096,
224,
7190,
667,
5946,
2589,
3219,
336,
1975,
6051,
3417,
1989,
6404,
4283,
4020
] | Train |
6,051 | 3 | Initial_ramdisk:initial ramdisk computing specifically regards linux computing codice_1 initial ramdisk scheme loading temporary root file system memory may used part linux startup process codice_1 codice_3 refer two different methods achieving commonly used make preparations real root file system mounted many linux distributions ship single generic linux kernel image one distribution developers create specifically boot wide variety hardware device drivers generic kernel image included loadable kernel modules statically compiling many drivers one kernel causes kernel image much larger perhaps large boot computers limited memory raises problem detecting loading modules necessary mount root file system boot time matter deducing root file system complicate matters root file system may software raid volume lvm nfs diskless workstations encrypted partition require special preparations mount another complication kernel support hibernation suspends computer disk dumping image entire contents memory swap partition regular file powering next boot image made accessible loaded back memory avoid hardcode handling many special cases kernel initial boot stage temporary root file-system — dubbed early user space — used root file-system contain user-space helpers hardware detection module loading device discovery necessary get real root file-system mounted image initial root file system along kernel image must stored somewhere accessible linux bootloader boot firmware computer root file system boot image optical disc small partition local disk boot partition usually using ext2 fat file systems tftp server systems boot ethernet bootloader load kernel initial root file system image memory start kernel passing memory address image end boot sequence kernel tries determine format image first blocks data lead either initrd initramfs scheme initrd scheme image may file system image optionally compressed made available special block device mounted initial root file system driver file system must compiled statically kernel many distributions originally used compressed ext2 file system images others including debian 3.1 used cramfs order boot memory-limited systems since cramfs image mounted in-place without requiring extra space decompression initial root file system kernel executes first process exits kernel assumes real root file system mounted executes begin normal user-space boot process initramfs scheme available since linux kernel 2.6.13 image may cpio archive optionally compressed archive unpacked kernel special instance tmpfs becomes initial root file system scheme advantage requiring intermediate file system block drivers compiled kernel systems use dracut package create initramfs image initramfs scheme kernel executes first process expected exit.. applications initramfs use casper utility create writable environment using unionfs overlay persistence layer read-only root filesystem image example overlay data stored usb flash drive compressed squashfs read-only image stored live cd acts root filesystem depending algorithms compiled statically kernel unpack initrd/initramfs images compressed gzip bzip2 lzma xz lzo lz4 linux distributions debian generate customized initrd image contains whatever necessary boot particular computer ata scsi filesystem kernel modules typically embed location type root file system linux distributions fedora ubuntu generate generic initrd image start device name root file system uuid must discover everything else boot time case software must perform complex cascade tasks get root file system mounted distributions use event-driven hotplug agent udev invokes helper programs hardware devices disk partitions storage volumes matching certain rules come online allows discovery run parallel progressively cascade arbitrary nestings lvm raid encryption get root file system root file system finally becomes visible maintenance tasks run mounted root file system done root file system mounted read-only processes must continue running splash screen helper command fifo hoisted newly mounted root file system final root file system simply mounted since would make scripts tools initial root file system inaccessible final cleanup tasks initial root file systems implement shell script thus include minimal shell usually /bin/ash along essential user-space utilities usually busybox toolkit save space shell utilities supporting libraries typically compiled space optimizations enabled gcc -os flag linked klibc minimal version c library written specifically purpose installers linux distributions typically run entirely initramfs must able host installer interface supporting tools persistent storage set tiny core linux puppy linux run entirely initrd since windows vista windows boot wim disk image file file format officially published rather similar zip format except supports hard links uses chunk-by-chunk compression support deduplicated chunks case whole wim initially loaded ram followed kernel initialisation next loaded wim available systemroot assigned drive letter windows installer uses boots boot.wim uses install.wim collection windows files installed also windows preinstallation environment windows pe uses base separate-boot versions antivirus backup/disaster recovery software also possible install windows always boot wim vhd file placed physical drive however rarely used since windows boot loader capable loading .sys files boot-time kernel modules task requires initrd linux | [
362,
3256,
2182,
3613,
7528,
7532,
2559,
2204,
5744,
6443,
2942,
7555,
6117,
4341,
5762,
412,
415,
3666,
2970,
6502,
788,
7956,
5453,
5803,
5460,
7242,
6885,
1535,
1924,
6892,
1176,
1933,
5829,
1208,
6211,
4435,
5865,
7669,
3404,
1227,
... | Validation |
6,052 | 4 | Asset_Disposal_and_Information_Security_Alliance:asset disposal information security alliance asset disposal information security alliance adisa organization recommends standards safely disposing information technology equipment minimizing risk exposure misuse sensitive data stored equipment adisa standards cover phases asset disposal including collection transportation storage erasure destruction components containing data recycling waste disposal certification includes periodic audits founded 2010 adisa publishes separate versions standard asia/pacific european union north america united kingdom adisa asset disposal security standard recognized industry standard merit uk defence infosec product co-operation group dipcog | [
1805,
8191,
4536
] | Test |
6,053 | 9 | Intrinsic_function:intrinsic function computer software compiler theory intrinsic function builtin function function subroutine available use given programming language whose implementation handled specially compiler typically may substitute sequence automatically generated instructions original function call similar inline function unlike inline function compiler intimate knowledge intrinsic function thus better integrate optimize given situation compilers implement intrinsic functions generally enable program requests optimization otherwise falling back default implementation provided language runtime system environment intrinsic functions often used explicitly implement vectorization parallelization languages address constructs application programming interfaces api example altivec openmp use intrinsic functions declare respectively vectorizable multiprocessing-aware operations compiling compiler parses intrinsic functions converts vector math multiprocessing object code appropriate target platform compilers c c++ microsoft intel gnu compiler collection gcc implement intrinsics map directly x86 single instruction multiple data simd instructions mmx streaming simd extensions sse sse2 sse3 ssse3 sse4 microsoft visual c++ compiler microsoft visual studio support inline assembly x86-64 compensate new intrinsics added map standard assembly instructions normally accessible c/c++ e.g. bit scan c c++ compilers provide non-portable platform-specific intrinsics intrinsics gnu built-ins slightly abstracted approximating abilities several contemporary platforms portable fall back implementations platforms appropriate instructions common c++ libraries glm sony vector maths libraries achieve portability via conditional compilation based platform specific compiler flags providing fully portable high-level primitives e.g. four-element floating-point vector type mapped onto appropriate low level programming language implementations still benefiting c++ type system inlining hence advantage linking hand-written assembly object files using c application binary interface abi hotspot java virtual machine jvm just-in-time compiler also intrinsics specific java apis hotspot intrinsics standard java apis may one optimized implementation platforms | [
2176,
1361,
6002,
1465,
831,
5665,
4962,
1854,
5669,
5670,
4077,
2420,
336,
951,
5606,
3747,
352,
6498,
6680,
2803,
3248,
357,
1435
] | Validation |
6,054 | 7 | Pando_Networks:pando networks founded 2004 new york city pando networks managed peer-to-peer p2p media distribution company backed intel capital brm capital wheatley partners company specialized cloud distribution games video software publishers media distributors also operated freemium consumer business sending large files pando network technology based bittorrent modifications hybrid p2p- server-based network included central control file distribution intelligent throttling peers servers reporting/analytics security spring 2006 company publicly launched pando small application let consumers bypass email attachment limits send large files 1gb regardless email service provider late may 2009 30 million people installed pando application late 2007 along verizon communications pando networks co-founded p4p “ proactive network provider participation p2p ” working group serve p2p companies internet service providers isps seeing much 70 percent bandwidth go p2p traffic p4p working group includes mix 50 p2p companies isps including telefónica comcast yale computer science research team developed p4p technical protocol believed could speed p2p content delivery lowering isp network utilization collaboration yale p4p working group pando networks adopted technology laird popkin coordinated test summer 2008 showing promising results company released first commercial service may 2008 media distributors could plug pando networks peer cloud existing content delivery networks cdns combination peer cloud plus cdn allows files high demand quickly cost effectively delivered peers long tail content reliably served cdn nbc universal incorporated pando networks ’ technology later year deliver high-definition tv episodes consumers ’ pcs game industry pando networks ’ largest customer segment installation files particularly massively multiplayer online games mmos reach well 1gb pando networks game customers included nexon turbine riot games gala-net levelup may 2010 pando networks surpassed 30 million game downloads pando networks acquired microsoft march 2013 | [
7232,
183,
3076,
8054,
4293,
4759,
7619,
2550,
7715,
2283,
8076,
5475,
5213,
644,
3958,
2739,
5563,
8085,
4500,
7734,
6110,
5141,
6025,
3028,
134,
2492,
6294,
4524,
7660,
3395,
6839,
7848,
8118,
3135,
2961,
522,
2066,
6580,
432,
6678,
5... | Test |
6,055 | 5 | X_Window_System_protocols_and_architecture:x window system protocols architecture computing x window system commonly x11 x network-transparent windowing system bitmap displays article details protocols technical structure x11 x uses client–server model x server program runs computer graphical display communicates various client programs x server acts go-between user client programs accepting requests tcp port 6000 graphical output windows client programs displaying user display receiving user input keyboard mouse transmitting client programs x server runs user computer clients may run remote machines terminology reverses common notion client–server systems client normally runs user local computer server runs remote computer x window terminology takes perspective x window program centre activity i.e x window program accepts responds requests applications user mouse keyboard input therefore applications remote computers viewed clients x window server program communication protocol server client runs network-transparently client server may run machine different ones possibly different architectures operating systems client server communicate securely internet tunneling connection encrypted connection bob scheifler jim gettys set early principles x follows listed scheifler/gettys 1996 first principle modified design x11 add new functionality unless know real application require x largely kept principles since x.org foundation develops reference implementation view extension improvement implementation whilst keeping almost entirely compatible original 1987 protocol communication server clients done exchanging packets network channel client establishes connection sending first packet server answers sending back packet stating acceptance refusal connection request authentication connection accepted acceptance packet contains data client use subsequent interaction server connection established client server exchange four different types packets channel x server provides set basic services client programs realize complex functionalities interacting server graphical user interfaces usually call window top-level window x window system term window also used windows lie within another window subwindows parent window graphical elements buttons menus icons etc realized using windows window created subwindow parent window causes windows arranged hierarchically tree x server automatically creates root tree called root window top-level windows exactly direct subwindows root window visibly root window large screen lies behind windows x server stores data windows fonts etc client knows identifiers objects – integers use names interacting server example client wishes window created requests server create one case success gets return identifier server associated newly created window identifier later used client request example string drawn window identifiers unique server client example two windows identifier even created two different clients client access object given identifier even another client created object every window predefined set attributes set properties stored x server accessible clients via appropriate requests attributes data window size position background color etc properties pieces data attached window unlike attributes properties meaning level x window core protocol client store arbitrary data property window property characterized name type value properties resemble variables imperative programming languages application create new property given name given type store value properties associated windows two properties name exist two different windows different types values properties mostly used inter-client communication example property named codice_1 stores name window window managers typically read property display name window top codice_2 program display properties window particular codice_3 shows properties root window include x resources parameters programs events packets sent server client communicate something happened may interest client client request server send event another client used communication clients example client requests text currently selected event sent client currently handling window holds selection content window may destroyed conditions example window covered whenever area destroyed content made visible server generates codice_4 event notify client part window drawn events serve notify clients keyboard mouse input creation new windows etc kinds events always sent client kinds event sent client previously stated interest clients may interested kind events example client may interested keyboard-related event mouse-related events way x window system handles colors sometimes confuse users historically several different modes supported modern applications use truecolor 24-bit color 8 bits red green blue old specialist applications may require different color mode many commercial specialist applications use pseudocolor x11 protocol actually uses single 32-bit unsigned integer called pixelvalue representing single color graphic operations transferring intensity primary colors 16 bit integer used colour component following representations colors exist may supported specific device client programs communicate server via xlib client library beside xlib xcb library operates closely x protocol particular clients use libraries xaw motif gtk+ qt turn use xlib interacting server qt switched xlib xcb 5.0 release client programs almost entirely unaffected change x window core protocol provides mechanisms communication clients window properties events particular client-to-client message events however specify protocol interactions instead separate set inter-client communication conventions governs protocols inter-client communication conventions manual specifies protocol exchange data via selections interaction applications window manager considered specification difficult confusing consistency application look feel communication typically addressed programming given desktop environment inter-client exchange protocol ice specifies framework building protocols interaction clients programmers build specific protocol top particular x session management protocol xsmp protocol based ice governs interaction applications session manager program takes care storing status desktop end interactive session recovering another session user started freedesktop specifications include newer conventions including drag-and-drop convention xdnd used transferring data selecting dragging another window embedded application convention xembed details application run subwindow another application mechanisms selections cut buffers drag-and-drop x window system allow user transfer data one window another selections cut buffer used typically user selects text data window pastes different window drag-and-drop used user selects something window clicks selection drags another window since two different applications may handle two windows data transfer requires different clients connected x server interact x window core protocol includes types requests events specific selection exchange transfer mainly done using general client-to-client event sending window properties specific selection transfer users transfer data different types clients usually text also pixmap number list objects etc selections drag-and-drop active mechanisms user selects data window client handling window must actively support protocol transferring data application requesting cut buffers contrast provide passive mechanism user selects text content transferred cut buffer remains even application handling window terminates window destroyed window manager program controls general appearance windows graphical elements graphical user interface differences look x window system different installations stem mainly use different window managers different configurations window manager window manager takes care deciding position windows placing decorative border around handling icons handling mouse clicks outside windows “ background ” handling certain keystrokes etc point view x server window manager operates client like client initial position decorative borders around windows handled window manager using following requests window manager uses first request intercept request mapping top-level windows children root window whenever another application requests mapping top-level window server sends event window manager instead window managers reparent window create larger top-level window called frame window reparent original window child graphically corresponds placing original window inside frame window space frame window taken original window used decorative frame around window “ border ” “ title bar ” window manager manages mouse clicks frame window allows example user move resize window clicking dragging border title bar window manager also handles icons related visual elements graphical user interface icons exist level x window core protocol implemented window manager example whenever window “ iconified ” fvwm window manager unmaps window creates window icon name possibly another window icon image meaning handling icons therefore completely decided window manager window managers wm2 implement icons roughly state session “ state desktop ” given time set windows current content precisely set applications managing windows information allow applications restore condition managed windows required program known x session manager saves restores state sessions recognizably using session manager permits user log interactive session find exactly windows state logging work session manager program stores names running applications logout starts login order state applications restored well needed restore content windows applications must able save state execution upon request session manager load back start x window system includes default session manager called codice_5 developers written session managers specific desktop systems example codice_6 default session manager kde program known x display manager shows graphical login prompt x window system generally display manager runs one x servers local computer accepts incoming connections x servers running remote computers local servers started display manager connects present user login screen remote servers started independently display manager connect situation display manager works like graphical telnet server x server connect display manager starts session applications utilize session run computer display manager input output computer x server runs may computer front user remote one x window system ships xdm basic supplied display manager display managers include gdm gnome kdm kde wdm using wings widget set used window maker entrance using architecture used enlightenment v.17 early widget toolkits x included xaw athena widget set 1983 olit open look intrinsics toolkit 1988 xview 1988 motif 1980s tk olit xview function base toolkits sun legacy openwindows desktop environment motif provides base toolkit common desktop environment cde desktop environment used commercial unix systems solaris aix hp-ux solaris 10 includes cde gnome latter preferred desktop environment toolkits developed recently include qt 1991- used kde gtk+ 1997- used gnome wxwidgets 1992- fltk 1998- fox 1997- fpgui 2005-current scheifler gettys designed x server simple extensible much functionality resides extensions protocol protocol level every extension assigned new request/event/error packet types extension features accessed client applications extension libraries adding extensions current x server implementations reportedly difficult due lack modularity server design long-term goal xcb project automate generating client server sides extensions xml protocol descriptions following table provides partial catalog extensions developed sorted roughly recency introduction | [
6414,
6879,
5103,
1920,
1822,
900,
305,
1554,
5571,
7010,
6922,
414,
8022,
7765,
4096,
1138,
1805
] | Test |
6,056 | 1 | MariaDB:mariadb mariadb community-developed commercially supported fork mysql relational database management system rdbms intended remain free open-source software gnu general public license development led original developers mysql forked due concerns acquisition oracle corporation mariadb intends maintain high compatibility mysql ensuring drop-in replacement capability library binary parity exact matching mysql apis commands includes new storage engine aria alternative myisam intends default transactional non-transactional engine initially used xtradb default storage engine switched back innodb since version 10.2 lead developer michael monty widenius one founders mysql ab founder monty program ab 16 january 2008 mysql ab announced agreed acquired sun microsystems approximately 1 billion acquisition completed 26 february 2008 mariadb named monty younger daughter maria similar mysql named daughter mariadb version numbers follow mysql numbering scheme version 5.5 thus mariadb 5.5 offers mysql 5.5 features exists gap mysql versions 5.1 5.5 mariadb issued 5.2 5.3 point releases since specific new features developed mariadb developers decided major version number change necessary mariadb supported amazon rds service since october 2015 mariadb supported database microsoft azure mariadb api protocol compatible used mysql plus features support native non-blocking operations progress reporting means connectors libraries applications work mysql also work mariadb—whether support native features basis fedora developers replaced mysql mariadb fedora 19 concerns oracle making mysql closed software project openbsd likewise april 2013 dropped mysql mariadb 5.5 december 2012 michael widenius david axmark allan larsson announced formation foundation would oversee development mariadb april 2013 foundation announced appointed simon phipps secretary interim chief executive officer rasmus johansson chairman board andrew katz jeremy zawodny michael widenius board members noting wished create governance model similar used eclipse foundation board appointed eclipse foundation executive director mike milinkovich advisor lead transition skysql corporation ab company formed ex-mysql executives investors oracle bought mysql announced april 2013 merging company monty program ab joining mariadb foundation mariadb foundation appointed widenius cto simon phipps quit 2014 sale mariadb trademark skysql later said quit soon obvious company going allow independent foundation 1 october 2014 skysql corporation ab changed name mariadb corporation ab reflect role main driving force behind development mariadb server biggest support-provider mariadb registered trademark mariadb corporation ab used license mariadb foundation january 2015 september 2018 otto kekäläinen ceo mariadb foundation stepped effectively 1 october year arjen lentz appointed ceo foundation october 2018 resigned december 2018 kaj arnö joined ceo 1 february 2019 eric herman current chairman board mariadb used servicenow dbs bank google mozilla since 2013 wikimedia foundation several linux bsd distributions include mariadb like ubuntu 14.04 lts default mariadb arch linux manjaro debian debian 9 fedora fedora 19 red hat enterprise linux rhel 7 june 2014 centos centos 7 mageia mageia 2 opensuse opensuse 12.3 dartmouth suse linux enterprise server sles 12 openbsd 5.7 freebsd 2013 google tasked one engineers work mariadb foundation group investment companies led intel invested 20 million skysql european investment bank funded mariadb €25 million 2017 | [
7957,
5717,
5983,
4028,
7248,
4306,
7067,
6426,
293,
1359,
5126,
5571,
6279,
578,
3873,
3975,
4708,
6462,
2674,
4167,
3652,
1768,
1491,
6755,
6386,
4363,
5340,
5780,
1695,
2255,
2259,
3244,
4104,
7598,
1435,
7787
] | Test |
6,057 | 3 | Goldmont_Plus:goldmont plus goldmont plus microarchitecture low-power atom celeron pentium silver branded processors used systems chip socs made intel gemini lake platform 14 nm goldmont plus core officially launched december 11 2017 goldmont plus enhanced 2nd generation out-of-order low-power atom microarchitecture designed entry level desktop notebook computers goldmont plus built 14 nm manufacturing process supports four cores consumer devices includes intel gen9 graphics architecture improvements introduced kaby lake microarchitecture goldmont plus microarchitecture builds success goldmont microarchitecture provides following enhancements list desktop processors follows list mobile processors follows | [
2448,
2449,
2814,
5802,
6332,
6698,
6793,
4847,
3942,
3849,
4765,
6170,
3443,
6344,
4108,
5737,
1465,
7449,
7453,
3020,
7364,
5842,
3717,
5669,
5670,
3803,
6647,
5947,
1867,
329,
3565,
4077,
6133,
4985,
766,
5339,
691,
5343,
6675,
4098,
... | Train |
6,058 | 5 | Galago_(software):galago software galago desktop presence information framework designed transmit presence information programs gives linux desktop ability combine numerous sources information people combine novel ways area rapid progress desktop computing simple example possibilities framework unified 'friends list could conceivably include twitter facebook nearby computers wired wireless network e-mail contacts voip contacts im contacts increasingly internet services sip voice ip allow optional publication presence means wide number channels communication person become possible galago allow choice available one place galago desktop-neutral contains set widgets gtk+ bindings several scripting languages test programs qt widgets planned | [
4685,
2091,
5103,
6011,
5571,
1989,
578,
2143,
7912,
7170
] | Test |
6,059 | 1 | Web_SQL_Database:web sql database web sql database web page api storing data databases queried using variant sql api supported google chrome opera safari android browser w3c web applications working group ceased working specification november 2010 citing lack independent implementations i.e use database system sqlite backend reason specification could move forward become w3c recommendation mozilla corporation one major voices behind break-up negotiations deprecation standard time main proponents behind 'alternative storage standard indexeddb | [
5984,
6986,
3863,
6991,
3290,
6541,
3383,
6029,
8006,
2054,
4082,
3900,
4445,
5432,
6858,
84,
87,
6787
] | Test |
6,060 | 2 | Progeny_Linux_Systems:progeny linux systems progeny linux systems company provided linux platform technology platform services technology supported debian rpm-based distributions linux platforms progeny linux systems based indianapolis ian murdock founder debian founder chairman board cto john h. hartman bruce byfield marketing communications director progeny created operating system called progeny componentized linux progeny eventually announced via post mailing lists 1 may 2007 ceasing operations progeny componentized linux usually called progeny debian defunct free operating system progeny announced post various mailing lists 1 may 2007 ceasing operations shut website progeny debian alternative debian 3.1 furthermore based upon linux standard base lsb 3.0 adopting technology anaconda installer ported red hat advanced packaging tool discover progeny debian aimed model developing component-based linux | [
2916,
1909,
578
] | Test |
6,061 | 8 | Tornado_(web_server):tornado web server tornado scalable non-blocking web server web application framework written python developed use friendfeed company acquired facebook 2009 tornado open-sourced soon tornado noted high performance tries solve c10k problem affecting servers | [
1445,
5369,
1819,
6428,
6095,
1834,
26,
7544,
4701,
1491,
417,
54,
2619,
7952,
103,
5820,
4045,
2646,
2291,
3368,
6536,
7988,
6191,
486,
5141,
840,
3408,
1602,
5206,
7347,
5214,
6270,
2740,
5569,
6628,
5571,
5575,
933,
3135,
5956,
4535,... | Test |
6,062 | 4 | Ping_(networking_utility):ping networking utility ping computer network administration software utility used test reachability host internet protocol ip network available virtually operating systems networking capability including embedded network administration software ping measures round-trip time messages sent originating host destination computer echoed back source name comes active sonar terminology sends pulse sound listens echo detect objects water ping operates sending internet control message protocol icmp echo request packets target host waiting icmp echo reply program reports errors packet loss statistical summary results typically including minimum maximum mean round-trip times standard deviation mean command-line options ping utility output vary numerous implementations options may include size payload count tests limits number network hops ttl probes traverse interval requests many systems provide companion utility ping6 testing internet protocol version 6 ipv6 networks implement icmpv6 ping utility written mike muuss december 1983 employment ballistic research laboratory us army research laboratory created tool troubleshoot problems ip network mike muuss inspired remark david mills using icmp echo packets ip network diagnosis measurements author named sound sonar makes since methodology analogous sonar echo location first released version public domain software subsequent versions licensed bsd license ping first included 4.3bsd freedos version developed erick engelke licensed gpl tim crawford developed reactos version licensed mit license rfc 1122 prescribes host must process icmp echo requests issue echo replies return following output running ping linux sending five probes target host www.example.com output lists probe message results obtained finally lists statistics entire test example shortest round trip time 9.674 ms average 10.968 ms maximum value 11.726 ms measurement standard deviation 0.748 ms cases response target host implementations display either nothing periodically print notifications timing possible ping results indicating problem include following case error target host intermediate router sends back icmp error message example host unreachable ttl exceeded transit addition messages include first eight bytes original message case header icmp echo request including quench value ping utility match responses originating queries generic composition icmp packet echo request ping icmp/icmp6 message identifier sequence number used client match reply request caused reply practice linux systems use unique identifier every ping process sequence number increasing number within process windows uses fixed identifier varies windows versions sequence number reset boot time echo reply icmp message generated response echo request mandatory hosts must include exact payload received request payload packet generally filled ascii characters output tcpdump utility shows last 32 bytes following example eight-byte icmp header starting payload may include timestamp indicating time transmission sequence number found example allows ping compute round trip time stateless manner without needing record time transmission packet payload may also include magic packet wake-on-lan protocol minimum payload case longer shown echo request typically receive reply host sleeping hibernation state host still wakes sleep state interface configured accept wakeup requests host already active configured allow replies incoming icmp echo request packets returned reply include payload may used detect remote host effectively woken repeating new request delay allow host resume network services host sleeping low power active state single request wakes host enough allow echo reply service reply instantly service enabled host need completely wake devices may return low power mode short delay configuration may used avoid host enter hibernation state much longer wake delay time passed low power active mode conduct denial-of-service attack attacker may send ping requests fast possible possibly overwhelming victim icmp echo requests technique called ping flood ping requests multiple addresses ping sweeps may used obtain list hosts network | [
361,
362,
709,
6789,
1812,
6088,
2589,
3312,
4716,
3323,
2244,
1140,
4020,
4387,
4759,
1537,
2999,
5119,
5480,
1183,
1942,
5138,
7272,
7282,
1213,
2330,
3417,
5181,
4464,
3073,
1631,
3775,
204,
207,
3106,
6997,
923,
3797,
5234,
6288,
59... | Test |
6,063 | 3 | Conway's_law:conway law conway law adage named computer programmer melvin conway introduced idea 1967 states law based reasoning order software module function multiple authors must communicate frequently therefore software interface structure system reflect social boundaries organization produced across communication difficult conway law intended valid sociological observation although sometimes used humorous context dubbed conway law participants 1968 national symposium modular programming eric s. raymond open-source advocate restated conway law new hacker dictionary reference work based jargon file organization software organization software team congruent said summarizing example conway paper raymond wrote four groups working compiler 'll get 4-pass compiler james o. coplien neil b. harrison stated one also see impact conway law design corporate websites nigel bevan usability expert stated 1998 organisations often produce web sites content structure mirrors internal concerns organisation rather needs users site similar effect may found websites undergo design committee evidence support conway law published team massachusetts institute technology mit harvard business school researchers using mirroring hypothesis equivalent term conway law found strong evidence support mirroring hypothesis significant differences product modularity consistent view distributed teams tend develop modular products additional likewise supportive case studies conway law conducted nagappan murphy basili university maryland collaboration microsoft syeed hammouda tampere university technology finland | [
6669
] | Validation |
6,064 | 9 | Philip_S._Abrams:philip s. abrams philip s. abrams computer science researcher co-authored first implementation programming language apl 1962 kenneth e. iverson published book programming language describing mathematical notation describing array operations mathematics 1965 abrams lawrence m. breed produced compiler translated expressions iverson apl notation ibm 7090 machine code 1970s vice president development scientific time sharing corporation stsc inc | [
6263,
6285,
1308,
6846,
7758,
8137,
752,
3060,
1892,
5322,
1774,
3464,
356,
811,
470
] | Train |
6,065 | 4 | Procera_Networks:procera networks procera networks networking equipment company based fremont california united states designs sells network intelligence solutions based deep packet inspection dpi technology procera sells solutions telecom operators governments enterprises network equipment vendors areas analytics traffic management policy charging control service provider compliance procera incorporated 2002 california company initially created deliver intelligent ethernet network switches company changed product line merged netintact company based varberg sweden offered bandwidth management products scandinavian network operators packetlogic brand merger announced may closed june 2006 procera shifted company product strategy netintact product lines 2006 2008 procera sold inexpensive less 2 gbit/s traffic management products small operators enterprises operators like com hem sweden september 2007 procera networks became listed american stock exchange stock symbol pkt beginning 2008 procera began focusing larger carriers mobile operators several customers reported use procera technology yoigo genband resells procera products p-series products procera named one fastest growing network companies deloitte 2010 2011 part deloitte fast 500 study june 24 2011 procera networks joined russell 3000 index december 2011 procera moved nasdaq stock exchange using symbol pkt 2013 procera bought vineyard networks canadian dpi company c 28 million vineyard product sold market network application visibility library navl network equipment vendors 2015 procera acquired francisco partners private equity firm based san francisco procera operates private company longer listed nasdaq 2017 francisco partners acquired sandvine merged procera procera offers network intelligence solutions based version deep packet inspection dpi called datastream recognition definition language drdl drdl uses properties applications identification purposes allows operators manage subscriber traffic based application similar many dpi products procera offers 100 use cases analytics traffic management policy enforcement service provider compliance october 2016 alleged procera sold dpi software government turkey via telecoms company turk telecom order reveal usernames passwords people visiting unencrypted websites according forbes significant internal opposition technologists working procera sale current former employees said told forbes 'turk telekom requested feed subscribers ’ usernames passwords unencrypted websites also ip addresses sites ’ visited | [] | Validation |
6,066 | 2 | Honor_8x:honor 8x honor 8x smartphone made huawei honor sub-brand successor huawei honor 8x within huawei honor series honor 8x 6.5-inch fhd+ display screen resolution 1,080 x 2,340 pixels 396 ppi pixel density 19.5:9 aspect ratio together deliver satisfying visual experience phone 20mp 2mp dual primary cameras pdaf dual flash click sharp life-like pictures pleasant colour reproductions front camera 16mp takes detailed selfies honor 8x carries rather average 64gb internal storage expanded 400gb device powered huawei hisilicon kirin 710 chipset two quad-core cortex a53 processors achieve 2.2ghz clock speed mali-t830 mp2 gpu 4gb ram phone delivers fluid performance apps games also rear-mounted fingerprint scanner improved security honor 8x uses a3,750mah li-polymer cell powers phone throughout day ease 4g volte compatible smartphone dual nano-sim slots second slot hybrid networks work without issue additional networking features include wifi bluetooth location support a-gps glonass assisted standard micro usb charging port 3.5 mm audio jack wired headphones.the phone comes 64 128 gigabytes storage 4 6 gb ram depending region display pixel resolution 1920x1080 pixel density 397 ppi honor 8x 16 mp front-facing camera dual rear camera setup consists 12 mp rgb lens 20-megapixel monochrome lens record video 1080p electronic image stabilization 1080p video honor 8x launched android oreo version 8.1 huawei emui 8.0. upgradable android 9.0 pie emui 9.0 | [
7442,
3583,
6427,
1670,
1237,
1582,
740,
7189
] | Test |
6,067 | 2 | Menlo_(typeface):menlo typeface menlo monospaced sans-serif typeface designed jim lyles face first shipped mac os x snow leopard menlo based upon open source font bitstream vera public domain font deja vu menlo replaced system monospaced font mac os 10.11 new apple-made monospaced font called sf mono monospaced variant san francisco family fonts apple created part corporate identity installed user-accessible typeface default although included used xcode even installed user sf mono license agreement extraordinarily restrictive limits use font solely conjunction apple-branded applications allowed embedded anywhere use typeface requires written consent apple mac os 10.12.4 user still install use sf mono unless copied resources folder apple however begun use apple developer website version used slightly newer one ships mac os | [
7274,
2107,
5011,
117,
822,
2927,
7308,
6909,
993
] | Test |
6,068 | 7 | DRMAA:drmaa drmaa distributed resource management application api high-level open grid forum api specification submission control jobs distributed resource management drm system cluster grid computing infrastructure scope api covers high level functionality required applications submit control monitor jobs execution resources drm system 2007 drmaa one first two one gridrpc specifications reached full recommendation status open grid forum 2012 second version drmaa standard drmaa2 published abstract interface definition language idl defining semantic functions gfd 194 drmaa2 specifies twice many calls drmaa covers cluster monitoring notion queues machines introduces multi job-session concept single applications better job workflow management later 2012 c api specified first language binding gf 198 development api done global grid forum model ietf standard development originally co-authored specification first proposed global grid forum 3 ggf3 frascati italy gained momentum global grid forum 4 toronto ontario development specification first proposed objective facilitate direct interfacing applications existing drm systems application builders portal builders independent software vendors isvs api co-authored participants wide-selection companies included participants industries education development resulted open standard received relatively good reception wide audience quickly without drmaa standard model existed submit jobs component regions grid assuming region running local drmss first version drmaa api implemented sun grid engine also university wisconsin–madison program condor furthermore c java idl binding documents made available language bindings generated easily swig first used perl binding number software solutions use drmaa interface different resource management systems | [
6690,
2451,
5983,
1923,
5109,
993,
3783,
486,
4159,
6473,
7930,
1878,
5604,
5965,
1435,
5539
] | Test |
6,069 | 5 | MimbleWimble:mimblewimble mimblewimble blockchain protocol created improve privacy fungibility scalability blockchains published july 19 2016 pseudonym tom elvis jedusor french name voldemort harry potter mimblewimble protocol cleverly uses blinding factors balancing inputs outputs commitment scheme private keys sender receiver must interact construct joint signature authorize transfer funds blocks mimblewimble constituent transactions aggregated one giant transaction erasing original transaction boundaries initial block download benefits cut-through spent outputs cancel corresponding inputs erasing blockchain history provable security analysis mimblewimble provided georg fuchsbauer et al protocol powers several decentralized privacy-oriented cryptocurrencies | [
6430,
1329,
6216,
5447,
3401,
8124,
744
] | Validation |
6,070 | 3 | Hardcard:hardcard hardcard genericized trademark hard disk drive disk controller host adapter expansion card personal computer typically hard disk drive hdd installs drive bay cables connect drive host adapter power source personal computer lacks available bus compatible host adapter one may install adapter expansion slot hardcard supplies host adapter n't require empty drive bay plus development subsidiary quantum corporation developed first isa hardcard released october 1985 june 1986 28 plus development competitors producing similar products term used generically refer hard disk card quantum corporation formed plus development subsidiary 1983 plus development invested efforts developing hard disk drive average computer owner could install easily without much technical knowledge 1985 plus development engineered first hardcard 10 megabyte mb capacity suggested retail price 1,095 mid-1980s hard drives small 1.6 inches tall order fit single isa pc card expansion slot custom one-inch thick hard drive designed spent 15 million project plus development started shipping hardcard october 1985 trademarked hardcard brand 1988 hardcard provided computer industry first one-inch-thick hdd interface form factor compatible full length card slot isa bus first introduced ibm pc thicker head disk assembly subsequently introduced 1-inch high standard form factor 3½-inch hdds sources inside company launch hardcard claim first hdd controller integrated drive printed circuit board xebec hdd controller manufacturer early 1980s already done owl product around august 1984 complete 5.25 inch half-height hdd integrated controller drive electronics printed circuit board sasi interface introduction hardcard plus development continued working higher capacity hard drives form factor first hardcard brand name became widely known name continued follow products hardcard ii hardcard ii xl advertised effective access times result disk cache hardcard ii listed times hardcard ii xl listed effective access time hardcard ez line returned listing access times without benefit cache hardcard products including hardcard ii xl produced plus development name hardcard ez released quantum name quantum absorbed wholly owned subsidiary plus development within one year plus development introduction hardcard 28 companies released similar products time products using standard hard drive 1.6-inch height forcing card hang adjacent pc slot hard drive located opposite side away connector sometimes enabling short half-length expansion card installed adjacent slot hard drive cards usually described occupying 1.5 expansion slots companies product names similar product plus hardcard 1985 tandy introduced tandy 1000 tandy offered proprietary 20 megabyte hard card 799 8-bit isa slot required accommodate hard card preserving drive bays disk drives cd-roms 8-bit slots electronically compatible computer could hold card 10 1/2 inches long result many hard cards offered plus development 13 inches long hence compatible hard cards certified tandy compatible meaning fit tandy 1000 model sx tx sl tl series possible use plus development hard card tandy 1000 completely removing plastic case cutting metal frame allow fit hard card must 10 inches long use 8-bit isa interface work tandy 1000 computer usually card must installed slot 1 due overhang tandy 1000 60 watt power supply n't sufficient run hard cards power-efficient card preferable | [
3755,
1508
] | Test |
6,071 | 5 | Point_coordination_function:point coordination function point coordination function pcf media access control mac technique used ieee 802.11 based wlans including wi-fi resides point coordinator also known access point ap coordinate communication within network ap waits pifs duration rather difs duration grasp channel pifs less difs duration hence point coordinator always priority access channel pcf located directly distributed coordination function dcf ieee 802.11 mac architecture channel access pcf mode centralized hence point coordinator sends cf-poll frame pcf capable station permit transmit frame case polled station frames send must transmit null frame due priority pcf dcf stations use dcf might gain access medium prevent repetition interval designed cover contention free pcf contention based dcf traffic repetition interval repeated continuously starts special control frame called beacon frame stations hear beacon frame start network allocation vector duration contention free period repetition period since aps logical bus topologies shared circuits one message processed one time contention based system thus media access control technique required wireless networks may suffer hidden node problem regular nodes communicate ap see nodes extreme edge geographical radius network wireless signal attenuates reach far thus ap middle allows distance halved allowing nodes see ap consequentially halving maximum distance two nodes extreme edges circle-star topology pcf seems implemented hardware devices part wi-fi alliance interoperability standard pcf interframe space pifs one interframe space used ieee 802.11 based wireless lans pcf enabled access point wait pifs duration rather difs occupy wireless medium pifs duration less difs greater sifs difs pifs sifs hence ap always priority access medium pifs duration calculated follows pifs sifs slot time | [
7052,
1618,
4926,
461,
823,
4321,
3105,
5387,
7824,
309,
2659,
3799,
2672,
3724,
2061,
1974,
3230,
4093,
1988,
3067,
7777,
4836
] | Validation |
6,072 | 3 | The_Legend_of_Kage:legend kage player armed kodachi shortsword unlimited number shuriken main gameplay revolves around killing enemy ninja blue red enemy fire-breathing monks five stages home versions grabbing crystal ball causes player clothes change next level color thereby attain certain powers bigger shuriken faster speed kage hit home version green orange clothes die reverts normal red clothes player takes role young iga ninja named kage shadow mission rescue princess kiri hime shogun daughter villainous warlord yoshi ro kuyigusa fellow evil samurai yuki nosuke riko kage must fight way forest along secret passageway fortress wall castle ... rescuing twice three times fc/nes version order win game time princess rescued seasons change summer fall winter back summer famicom/nes version re-released wii virtual console japan december 19 2006 united states february 19 2007 also released 3ds virtual console wii u virtual console japan arcade version also appears compilation title taito legends 2 revised legend kage included taito nostalgia 1 release along original game features two new playable characters ayame ganin ayame ninja throw bombs similar red ninja game unlimited supply throwing knives ganin dog breathe fire similar monks game perform spin attack much range leaves invulnerable instant kills enemy touches also new final boss characters face giant green cobra slithers ground back forth screen end second run levels enemy jump air 3d graphics remake arcade game along original arcade version included 2006 compilation taito legends power playstation portable game still side-scrolling follow-up game developed lancarse nintendo ds published taito 2008 taito parent company square enix published north american localization game later year | [
5924,
3313
] | Train |
6,073 | 6 | SyMon_Bootmanager:symon bootmanager symon bootmanager light-weighted partitions bootmanager developed wholly assembler code thus needs little space installation software makes possible create 36 partitions one single hard drive 20 operating systems organized partitions despite small size bootmanager pseudo graphical interface equipped many powerful features features make unique among bootmanagers utility developed vladimir dashevsky free current version r3.23.02 | [
3042,
1992,
336,
5571
] | Test |
6,074 | 3 | R4600:r4600 r4600 code-named orion microprocessor developed quantum effect design qed implemented mips iii instruction set architecture isa qed design firm fabricate sell designs r4600 first licensed integrated device technology idt later toshiba nkk companies fabricated microprocessor marketed r4600 designed low-end workstation high-end embedded microprocessor users included silicon graphics inc. sgi indy workstation deskstation technology windows nt workstations r4600 instrumental making indy successful providing good integer performance competitive price embedded systems prominent users included cisco systems network routers canon printers idt first company fabricate ship r4600 idt produced first silicon august 1993 first part 100 mhz part announced october 1993 march 1994 cebit idt announced 133 mhz part fabricated 0.65 μm cmos process required 5 v power supply nkk announced version r4600 nr4600 middle 1994 first nr4600 100 mhz part fabricated 0.5 μm process used 3.3 v power supply r4600 simple design scalar processor issuing one instruction per cycle integer pipeline floating-point unit fpu integer instructions single cycle latency throughput except multiplies divides multiplies 32-bit 64-bit eight-cycle latency six-cycle throughput divides 32-cycle latency throughput 32-bit integers 61-cycle latency throughput 64-bit integers fpu pipelined save die area thus cost characteristic severely restricted r4600 floating-point performance impede success low-end computers embedded applications integer performance important single double precision adds four-cycle latency throughput single double precision multiplies partially pipelined eight-cycle latency six-cycle throughput single precision divides 32-cycle latency throughput whereas double precision division 61-cycle latency throughput square roots latency throughput one cycle less comparative divide instructions r4600 uses floating-point unit perform floating-point multiply divide also integer multiply divide r4600 16 kb two-way set-associative caches instructions data supported l2 cache on-die hardware control requiring external logic whether custom application specific integrated circuit asic chipset cache cache resided sysad bus shared external interface sysad bus 64 bits wide operate clock rates 50 mhz peak bandwidth 400 mb/s r4600 external interface support multiprocessing r4600 needs supplied three clock signals generate various clocks r4650 derivative r4600 announced 19 october 1994 custom instructions improving performance fixed-point digital signal processing dsp applications lower cost version r4650 r4640 announced 27 november 1995 32-bit instead 64-bit external interface 16 september 1997 150 180 mhz versions microprocessors introduced quantities 10,000 150 180 mhz r4640s priced 30 39 respectively 150 180 mhz r4650s priced 60 74 respectively r4650 also available 133 167 mhz speeds used arcade games produced namco example time crisis 2 running namco system 23 hardware r4640 used webtv networks webtv plus thin client r4700 also code-named orion derivative r4600 ported 0.5 µm cmos process r4700 available 100 133 150 175 200 mhz versions | [
2903,
5804,
6074,
551,
6256,
5208,
1452,
6865,
5917,
4234,
650,
5740,
4783,
5055,
7010,
1023,
4365,
5521,
7403,
4368,
4370,
3747,
7499,
4372,
3674,
536,
2443,
7697
] | Test |
6,075 | 9 | Binary_recompiler:binary recompiler binary recompiler compiler takes executable binary files input analyzes structure applies transformations optimizations outputs new optimized executable binaries binary recompilation introduced gary kildall 1980s | [
1361,
3210
] | Test |
6,076 | 2 | PTS-DOS:pts-dos pts-dos aka pts/dos disk operating system dos clone developed russia phystechsoft paragon technology systems phystechsoft formed 1991 moscow russia graduates members mipt informally known phystech end 1993 phystechsoft released first commercially available pts-dos pts-dos v6.4 version numbering followed ms-dos version numbers microsoft released ms-dos 6.2 november 1993 1995 programmers left phystechsoft founded paragon technology systems took source code released version named pts/dos 6.51cd well s/dos 1.0 source dos stripped open-source version according official phystechsoft announcements programmers violated copyright laws russian military laws pts-dos developed close relationship russia military thus may subject military secrets law phystechsoft continued development released pts-dos v6.6 somewhere presented pts-dos v6.65 cebit exhibition 1997 next version phystechsoft formally pts/dos extended version 6.70 labeled pts-dos 2000 still distributed last 16-bit pts-dos system paragon continued pts-dos line released paragon dos pro 2000 also known labeled places pts/dos pro 2000 according paragon last version development since ceased moreover release contained bundled source code older pts-dos v6.51 later phystechsoft continued developing pts-dos finally released pts-dos 32 formally known pts-dos v7.0 added support fat32 file system pts-dos certified russian ministry defense following list commands supported pts-dos 2000 pro | [
1522,
7794,
5462,
3690,
6088,
7079,
5571,
5048,
5232,
5138,
1288,
5942,
2864,
6380,
2887,
5784,
3748,
1793,
3751,
2076
] | Validation |
6,077 | 3 | Continua_Health_Alliance:continua health alliance continua health alliance international non-profit open industry group nearly 240 healthcare providers communications medical fitness device companies continua health alliance members aim develop system deliver personal individual healthcare continua founding member personal connected health alliance launched february 2014 founding members mhealth summit himss continua health alliance international not-for-profit industry organization enabling end-to-end plug-and-play connectivity devices services personal health management healthcare delivery mission empower information-driven health management facilitate incorporation health wellness day-to-day lives consumers continua pioneer establishing industry standards security connected health technologies smart phones gateways remote monitoring devices activities include certification brand support program events collaborations support technology clinical innovation well outreach employers payers governments care providers nearly 220 member companies reaching across globe continua comprises technology medical device healthcare industry leaders service providers dedicated making personal connected health reality continua health alliance working toward establishing systems interoperable telehealth devices services three major categories chronic disease management aging independently health physical fitness continua health alliance version 1 design guidelines based proven connectivity technical standards include bluetooth wireless usb wired device connection group released guidelines public june 2009 group establishing product certification program using recognizable logo continua certified logo program signifying product interoperable continua-certified products products made continua health alliance guidelines provide consumers increased assurance interoperability devices enabling easily share information caregivers service providers collaborations government agencies regulatory bodies continua works provide guidelines effective management diverse products services global network vendors continua health alliance products make use iso/ieee 11073 personal health data phd standards continua design guidelines available public without signing non-disclosure agreement continua guidelines help technology developers build end-to-end plug-and-play systems efficiently cost effectively continua health alliance founded june 6 2006 continua health alliance performed first public demonstration interoperability october 27 2008 partners center connected health 5th annual connected health symposium boston continua health alliance certified first product nonin 2500 palmsat handheld pulse oximeter usb january 26 2009 end december 2014 100 certified products continua selected bluetooth low energy zigbee wireless protocols wireless standards version 2 design guidelines released bluetooth low energy used low-power mobile devices zigbee used networked low-power sensors enabling independent living beginning 2012 continua invites non-members request copy design guidelines signing non-disclosure agreement continua working groups operations u.s. eu japan india china continua health alliance currently nearly 220 member companies continua board directors currently composed following companies organisation primarily staffed volunteers member organisations organised working groups address goals alliance board directors sit following main working groups continua alliance website contains full listing member organisations directory qualified products clear statement mission | [
7876,
6874
] | Test |
6,078 | 3 | Illegal_opcode:illegal opcode illegal opcode also called undocumented instruction instruction cpu mentioned official documentation released cpu designer manufacturer nevertheless effect illegal opcodes common older cpus designed 1970s mos technology 6502 intel 8086 zilog z80 older processors many exist side effect wiring transistors cpu usually combine functions cpu intended combined old modern processors also instructions intentionally included processor manufacturer documented official specification accidental illegal instructions useless even highly undesirable effects crashing computer might accident something useful certain situations instructions sometimes exploited computer games 1970s 1980s speed certain time-critical sections another common use ongoing battle copy protection implementations cracking form security obscurity secrecy usually last long danger associated use illegal instructions given fact manufacturer guarantee existence function might disappear behave differently change cpu internals new revision cpu rendering programs use incompatible newer revisions example number older apple ii games work correctly newer apple iic latter uses newer cpu revision 65c02 away illegal opcodes recent cpus 80186 80286 68000 descendants powerpc processor illegal opcodes widely known/used manufacturers guarantee cpu behave well-defined way finds unknown opcode instruction stream usually means triggering certain exception fault condition operating system exception fault handler usually terminate application caused fault another less common way handling illegal instructions defining nothing except taking time space equivalent cpu official nop instruction method used tms9900 65c02 processor among others spite manufacturer guarantee instructions research uncovered vast number undocumented instructions modern x86 processors instructions shared across processor manufacturers indicating intel amd aware instruction purpose despite appearing official specification instructions specific manufacturers specific product lines purpose majority x86 undocumented instructions unknown today details instructions mainly interest exact emulation older systems | [
4843,
6079,
7533,
7541,
5571,
6634,
7282,
5680,
514,
5079,
74,
3747,
4009,
263,
5087,
1335,
5190
] | Validation |
6,079 | 3 | Indirect_branch:indirect branch indirect branch also known computed jump indirect jump register-indirect jump type program control instruction present machine language instruction sets rather specifying address next instruction execute direct branch argument specifies address located example 'jump indirect r1 register means next instruction executed address register r1 address jumped known instruction executed indirect branches also depend value memory location indirect branch useful make conditional branch especially multiway branch instance based program input value could looked jump table pointers code handling various cases implied data value data value could added address table result stored register indirect jump could made based value register efficiently dispatching program control code appropriate input similar manner subroutine call instructions indirect address subroutine called specified memory function pointers typically implemented indirect subroutine calls gcc-8.1 appear following new options codice_1 | [
6078,
4845,
3849,
7533,
5737,
7541,
5055,
5680,
4719,
514,
3747,
352,
263,
971,
5190
] | Test |
6,080 | 3 | Semantic_interoperability:semantic interoperability semantic interoperability ability computer systems exchange data unambiguous shared meaning semantic interoperability requirement enable machine computable logic inferencing knowledge discovery data federation information systems semantic interoperability therefore concerned packaging data syntax simultaneous transmission meaning data semantics accomplished adding data data metadata linking data element controlled shared vocabulary meaning data transmitted data one self-describing information package independent information system shared vocabulary associated links ontology provides foundation capability machine interpretation inference logic syntactic interoperability prerequisite semantic interoperability syntactic interoperability refers packaging transmission mechanisms data healthcare hl7 use thirty years predates internet web technology uses pipe character data delimiter current internet standard document markup xml uses data delimiter data delimiters convey meaning data structure data without data dictionary translate contents delimiters data remains meaningless many attempts creating data dictionaries information models associate data packaging mechanisms none practical implement perpetuated ongoing babelization data inability exchange data meaning since introduction semantic web concept tim berners-lee 1999 growing interest application w3c world wide web consortium w3c standards provide web-scale semantic data exchange federation inferencing capabilities syntactic interoperability provided instance xml sql standards pre-requisite semantic involves common data format common protocol structure data manner processing information interpretable structure also allows detection syntactic errors thus allowing receiving systems request resending message appears garbled incomplete semantic communication possible syntax garbled unable represent data however information represented one syntax may cases accurately translated different syntax accurate translation syntaxes possible systems using different syntaxes may also interoperate accurately cases ability accurately translate information among systems using different syntaxes may limited one direction formalisms used different levels expressivity ability express information single ontology containing representations every term used every application generally considered impossible rapid creation new terms assignments new meanings old terms however though impossible anticipate every concept user may wish represent computer possibility finding finite set primitive concept representations combined create specific concepts users may need given set applications ontologies foundation ontology also called upper ontology contains primitive elements would provide sound basis general semantic interoperability allow users define new terms need using basic inventory ontology elements still newly defined terms properly interpreted computer system interpret basic foundation ontology whether number primitive concept representations fact finite expand indefinitely question active investigation finite stable foundation ontology suitable support accurate general semantic interoperability evolve initial foundation ontology tested used wide variety users present time foundation ontology adopted wide community stable foundation ontology still future one persistent misunderstanding recurs discussion semantics confusion words meanings meanings words change sometimes rapidly formal language used ontology encode meanings semantics concepts form change order determine meaning particular word term database example necessary label fixed concept representation ontology word term may refer concept multiple words refer fixed concept language called synonymy one word used refer one concept called ambiguity ambiguity synonymy among factors make computer understanding language difficult use words refer concepts meanings words used sensitive context purpose use many human-readable terms use ontologies supporting semantic interoperability provide fixed set concepts whose meanings relations stable agreed users task determining terms contexts database different context separated task creating ontology must taken designer database designer form data entry developer program language understanding word used interoperability context changes meaning preserve interoperability necessary change pointer ontology element specifies meaning word knowledge representation language may sufficiently expressive describe nuances meaning well understood fields least five levels complexity general semi-structured data one may use general purpose language xml languages full power first-order predicate logic may required many tasks human languages highly expressive considered ambiguous allow accurate interpretation desired given current level human language technology semantic interoperability may distinguished forms interoperability considering whether information transferred communicated form meaning required receiving system interpret correctly even algorithms used receiving system unknown sending system consider sending one number number intended sum money owed one company another implies action lack action part send receive may correctly interpreted sent response specific request received time form expected correct interpretation depend number could represent almost millions types quantitative measurement rather depends strictly circumstances transmission interpretation depends systems expecting algorithms system use number exactly sense depends entire envelope transmissions preceded actual transmission bare number contrast transmitting system know information used systems necessary shared agreement information specific meaning many possible meanings appear communication particular task one solution standardize form request payment request would encode standardized fashion information needed evaluate agent owing money agent owed money nature action giving rise debt agents goods services participants action time action amount owed currency debt reckoned time allowed payment form payment demanded information two systems agreed interpret information request achieve semantic interoperability specific type transaction semantic interoperability generally necessary provide standardized ways describe meanings many things commercial transactions number concepts whose representation needs agreed upon minimum several thousand achieve semantic interoperability restricted scenarios currently matter research discussion problem general semantic interoperability form foundation ontology 'upper ontology required sufficiently comprehensive provide defining concepts specialized ontologies multiple domains past decade ten foundation ontologies developed none yet adopted wide user base need single comprehensive all-inclusive ontology support semantic interoperability avoided designing common foundation ontology set basic primitive concepts combined create logical descriptions meanings terms used local domain ontologies local databases tactic based principle therefore tactic limits need prior agreement meanings ontology elements common foundation ontology fo based several considerations likely fewer 10,000 elements types relations practice together fo focused representations primitive concepts set domain extension ontologies fo elements specified using fo elements likely also used pre-existing extensions ease cost creating domain ontologies providing existing elements intended meaning reduce chance error using elements already tested domain extension ontologies may logically inconsistent needs determined different domain extensions used communication whether use single foundation ontology avoided sophisticated mapping techniques among independently developed ontologies also investigation practical significance semantic interoperability measured several studies estimate cost lost efficiency due lack semantic interoperability one study focusing lost efficiency communication healthcare information estimated us 77.8 billion per year could saved implementing effective interoperability standard area studies construction industry automobile manufacturing supply chain estimate costs us 10 billion per year due lack semantic interoperability industries total numbers extrapolated indicate well us 100 billion per year lost lack widely used semantic interoperability standard us alone yet study policy field might offer big cost savings applying semantic interoperability standards see policy fields capable profiting semantic interoperability see 'interoperability general policy fields egovernment health security many eu also set semantic interoperability centre europe june 2007 | [
7299,
2087,
1665,
7290,
2054
] | Test |
6,081 | 8 | Frontera_(web_crawling):frontera web crawling frontera open-source web crawling framework implementing crawl frontier component providing scalability primitives web crawler applications content structure world wide web changes rapidly frontera designed able adapt quickly changes large scale web crawlers operate batch mode sequential phases injection fetching parsing deduplication scheduling leads delay updating crawl web changes design mostly motivated relatively low random access performance hard disks compared sequential access frontera instead relies modern key value storage systems using efficient data structures powerful hardware crawling parsing schedule indexing new links concurrently open-source project designed fit various use cases high flexibility configurability large-scale web crawls frontera purpose flexibility allows crawls moderate size single machine cores leveraging single process distributed spiders run modes frontera written mainly python data transport formats well abstracted out-of-box implementations include support messagepack json kafka zeromq although frontera n't web crawler requires streaming crawling architecture rather batch crawling approach stormcrawler another stream-oriented crawler built top apache storm whilst using components apache nutch ecosystem scrapy cluster designed istresearch precise monitoring management queue mind systems provide fetching and/or queueing mechanisms link database content processing scrapinghub ltd. crawler processing 1600 requests per second peak built using primarily frontera using kafka message bus hbase storage link states link database crawler operates cycles cycle takes 1.5 months results 1.7b downloaded pages crawl spanish internet resulted 46.5m pages 1.5 months aws cluster 2 spider machines first version frontera operated single process part custom scheduler scrapy using on-disk sqlite database store link states queue able crawl days getting noticeable volume links started spend time select queries making crawl inefficient time frontera developed darpa memex program included catalog open source projects 2015 subsequent versions frontera used hbase storing link database queue application distributed two parts backend fetcher backend responsible communicating hbase means kafka fetcher reading kafka topic urls crawl producing crawl results another topic consumed backend thus creating closed cycle first priority queue prototype suitable web scale crawling implemented time queue producing batches limits number hosts requests per host next significant milestone frontera development introduction crawling strategy strategy worker along abstraction message bus became possible code custom crawling strategy without dealing low-level backend code operating queue easy way say links scheduled priority made frontera truly crawl frontier framework kafka quite heavy requirement small crawlers message bus abstraction allowed integrate almost messaging system frontera | [
6489,
3863,
5965,
7156,
4691,
5571,
80,
84,
578,
2856
] | Test |
6,082 | 3 | List_of_ARM_Cortex-M_development_tools:list arm cortex-m development tools list development tools 32-bit arm cortex-m-based microcontrollers consists cortex-m0 cortex-m0+ cortex-m1 cortex-m3 cortex-m4 cortex-m7 cortex-m23 cortex-m33 cores ide compiler linker debugger flashing alphabetical order notes jtag and/or swd debug interface host adapters alphabetical order debugging tools and/or debugging plug-ins alphabetical order commonly referred rtos following free c/c++ libraries | [
2451,
804,
463,
5639,
469,
4041,
3182,
3365,
6720,
3368,
2926,
2024,
6910,
5752,
4336,
5845,
7654,
6371,
6919,
1959,
1864,
4166,
5948,
6378,
5323,
3397,
6753,
7848,
1779,
4537,
950,
1977,
5965,
4197,
1995
] | Validation |
6,083 | 2 | FSEvents:fsevents fsevents api macos allows applications register notifications changes given directory tree whenever filesystem changed kernel passes notifications via special device file codice_1 userspace process called codice_2 process combines multiple changes single directory tree occur within short period time notifies applications registered changes affected directory mac os x 10.7 fsevents watch filesystem linux inotify api provided notifications changes individual files application able register receive changes given directory determine file files changed mac os x 10.7 lion added ability register file modification notifications | [
6984,
5571,
578
] | Test |
6,084 | 4 | Webroot_Internet_Security_Essentials:webroot internet security essentials webroot internet security essentials antivirus antispyware personal firewall security software back-up utility program additional personal pc security features originally launched october 21 2008 webroot internet security essentials first consumer security suite webroot webroot internet security essentials discontinued october 4 2011 webroot announced release secureanywhere™ line products time existing essentials licenses transitioned webroot secureanywhere essentials october 15 2012 product updated webroot secureanywhere® internet security plus latest version webroot secureanywhere internet security plus includes antivirus antispyware anti-phishing personal firewall password identity protection microsoft windows macos computers well protection android ios mobile devices reviews commented lack parental controls included security suite well difficulty configuring firewall | [
4759,
5571,
6107,
6777
] | Test |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.