node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4
values |
|---|---|---|---|---|
5,386 | 3 | Intel_GMA:intel gma intel graphics media accelerator gma series integrated graphics processors introduced 2004 intel replacing earlier intel extreme graphics series succeeded intel hd iris graphics series series targets market low-cost graphics solutions products series integrated onto motherboard limited graphics processing power use computer main memory storage instead dedicated video memory commonly found netbooks low-priced laptops desktop computers well business computers need high levels graphics capability early 2007 90 pc motherboards sold integrated gpu gma line gpus replaces earlier intel extreme graphics intel740 line latter discrete unit form agp pci cards technology evolved companies real3d lockheed martin later intel integrated i740 core intel 810 chipset original architecture gma systems supported functions hardware relied host cpu handle least graphics pipeline decreasing performance however introduction intel 4th generation gma architecture gma x3000 2006 many functions built hardware providing increase performance 4th generation gma combines fixed function capabilities threaded array programmable executions units providing advantages graphics video performance many advantages new gma architecture come ability flexibly switch needed executing graphics-related tasks video-related tasks gma performance widely criticized past slow computer games sometimes nicknamed intel gmd graphics media decelerator essentially referred world first graphics decelerator since s3 virge latest gma generation ease many concerns casual gamer despite similarities intel main series gma integrated graphics processors igps based powervr technology intel licensed imagination technologies intel used low-power powervr mbx designs chipsets supporting xscale platform since sale xscale 2006 licensed powervr sgx used gma 500 igp use atom platform introduction platform controller hub graphics media accelerator series ceased cpu-based intel hd iris graphics series created gma 900 first graphics core produced intel graphics media accelerator product name incorporated intel 910g 915g 915gx chipsets 3d architecture gma 900 significant upgrade previous extreme 3d graphics processors 4 pixel per clock cycle design supporting directx 9 pixel shader model 2.0 operates clock rate ranging 160 333 mhz depending particular chipset 333 mhz peak pixel fill-rate 1332 megapixels per second however architecture still lacks support hardware transform lighting similar vertex shader technologies like previous intel integrated graphics parts gma 900 hardware support mpeg-2 motion compensation color-space conversion directdraw overlay processor uses different separate clock generators display render cores display unit includes 400 mhz ramdac two 25–200 mpixel/s serial dvo ports two display controllers mobile chipsets two 18-bit 25–112 mhz lvds transmitters included gma 950 second graphics core produced intel graphics media accelerator product name incorporated intel 945g chipsets processor includes 400 mhz 256-bit core supporting 10.6 gb/s memory bandwidth ddr2-667 system ram 224 mb max video memory dvmt scheme 1.6 gpixels/s 1.6 gtexels/s fill rate max resolution 2048x1536 analog digital displays 2 sdvo ports flat-panels and/or tv-out via add2 cards media expansion cards 3d-wise gma 950 supports four pixels per clock rendering microsoft directx 9.0 hardware acceleration vertex shader 3.0 opengl 1.4 arb extensions windows integrated graphics found q33 q35 g31 g33 chipsets supports pixel shader 2.0 opengl 1.4 hardware vertex shader n't supported found intel atom d4xx d5xx n4xx n5xx codenamed pineview processors like gma 3100 gma 3000 close relative gma900/950 completely different gma x3000 series supports 384 mb video memory windows xp driver directx 9.0c shader model 2.0 opengl 1.4 microsoft windows opengl 2.1 linux 946gz q963 q965 chipsets use gma 3000 graphics core gma 3000 3d core different x3000 despite similar names based directly previous generation gma 900 gma 950 graphics belonging i915 family pixel vertex shaders support shader model 2.0b features vertex shaders still software-emulated addition hardware video acceleration hardware-based idct computation procamp video stream independent color correction vc-1 decoding implemented hardware gma 3000-equipped chipsets q965 retains dual independent display support core speed rated 400 mhz 1.6 gpixel/s fill rate datasheets listed 667 mhz core white paper memory controller address maximum 256 mb system memory integrated serial dvo ports increased top speed 270 mpixel/s gma x3000 desktop substantially redesigned compared previous gma iterations used intel g965 north bridge controller gma x3000 launched july 2006 gma x3000 underlying 3d rendering hardware organized unified shader processor consisting 8 scalar execution units pipeline process video vertex texture operations central scheduler dynamically dispatches threads pipeline resources maximize rendering throughput decrease impact individual pipeline stalls however due scalar nature execution units process data single pixel component time gma x3000 supports directx 9.0 vertex pixel shader model 3.0 features processor consists different clock domains meaning entire chip operate clock speed causes difficulty measuring peak throughput various functions adding confusion listed 667 mhz intel g965 white paper listed 400 mhz intel g965 datasheet various rules define igp processing capabilities memory controller address maximum 384 mb memory according white paper 256 mb datasheet gma x3500 upgrade gma x3000 used desktop g35 shaders support shader model 4.0 features architecturally gma x3500 similar gma x3000 graphics cores running 667 mhz major difference gma x3500 supports shader model 4.0 directx 10 whereas earlier x3000 supports shader model 3.0 directx 9 x3500 also adds hardware-assistance playback vc-1 video gma x3100 mobile version gma x3500 used intel gl960/gm965 chipsets also gs965 chipset x3100 supports hardware transform lighting eight programmable shader units 384 mb video memory display cores run 333 mhz gm965 320 mhz gl960 render cores run 500 mhz gm965 400 mhz gl960 x3100 display unit includes 300 mhz ramdac two 25–112 mhz lvds transmitters 2 dvo encoders tv encoder windows driver supports directx 10.0 shader model 4.0 opengl 1.5 linux opengl 2.1 supported integrated graphics found b43 q43 q45 chipsets gma x4500 gma x4500hd desktop platforms launched june 2008 gma x4500 used g43 chipset gma x4500hd used g45 chipset gma x4500 also used g41 chipset released september 2008 difference gma x4500 gma x4500hd gma x4500hd capable full 1080p high-definition video playback including blu-ray disc movies like x3500 x4500 supports directx 10 shader model 4.0 features intel designed gma x4500 200 faster gma 3100 g33 chipset 3dmark06 performance 70 faster gma x3500 g35 chipset gma 4500mhd laptops launched july 16 2008 featurewise 4500mhd identical desktop cousin x4500hd gma 4500mhd used gl40 gs40 gm45 gs45 chipsets gma x4700mhd laptops launched october 2008 last product intel gma way belongs 4500mhd series used gm47 chipsets montevina features 80 shading units 10 texture mapping units 1 rops compared 4500mhd frequency increased 640 mhz intel developed new set low power graphics architecture based powervr available linux drivers support much intel sch system controller hub codenamed poulsbo atom processor z5xx series features gma 500 graphic system rather developed in-house core powervr sgx 535 core licensed imagination technologies intel describes flexible programmable architecture supports shader-based technology 2d 3d advanced 3d graphics high-definition video decode image processing features include screen tiling internal true color processing zero overhead anti-aliasing programmable shader 3d accelerator 32-bit floating-point operations revised version previous intel sch system controller hub atom z6xx series cpu codenamed lincroft essentially graphic system gma 500 clocked double speed 200 mhz 400 mhz integrated graphics system released intel atom cedar trail 32 nm based powervr sgx545 unlike original powervr solution model clocked 400 mhz instead 200 mhz specifically found intel atom n2600 processor atom d2500 models supports directx version 9.0c similar gma 3600 version clocked 640 mhz found atom n2800 atom d2550 atom d2500 atom d2600 atom d2700 models supports directx version 9.0c protected audio video path pavp restricts data path within computer video playback e.g. blu-ray discs supported newer chipsets e.g intel g45 operating systems since windows vista pavp configured bios different modes supported default setting bios pavp lite within intel hd graphics successor intel gma similar technology called intel insider exists mac os x 10.4 supports gma 950 since used previous revisions macbook macmini 17-inch imacs used intel-based mac minis mac mini released march 3 2009 mac os x 10.5 leopard contains drivers gma x3100 used recent revision macbook range late-release versions mac os x 10.4 also support gma 900 due use apple developer transition kit used powerpc-to-intel transition however special modifications kext file must made enable core image quartz extreme although new macbook line longer uses x3100 mac os x 10.5 leopard ships drivers supporting require modifications kext file mac os x 10.6 snow leopard includes new 64-bit kernel addition 32-bit one include 64-bit x3100 drivers means although macbooks x3100 64-bit capable processors efi mac os x must load 32-bit kernel support 32-bit x3100 drivers november 9 10.6.2 update ships 64-bit x3100 drivers apple removed 64-bit gma x3100 drivers later thus affected macs forced back 32-bit kernel despite 64-bit clean terms hardware firmware 64-bit drivers offered os x lion subsequently os x mountain lion dropped 32-bit kernel booting combination two changes graphics driver code resulted many mac revisions unable upgrade mountain lion gpus replaced macbook macbook pro notebooks instead shipped far powerful nvidia geforce 9400m 15 17 macbook pro notebooks shipped additional geforce 9600gt supporting hybrid power switch gpus nvidia geforce 9400m chipset implemented apple macbooks support composite s-video output freebsd 8.0 supports following intel graphic chipsets i810 i810-dc100 i810e i815 i830m 845g 852gm 855gm 865g 915g 915gm 945g 945gm 965g 965q 946gz 965gm,945gme g33 q33 q35 g35 gm45 g45 q45 g43 g41 chipsets practice chipsets 4500mhd supported drm 3d using freebsd 9 work integrate gem kms currently adding support i-series integrated graphics improving support earlier chipsets august 2006 intel added support open-source x.org/xfree86 drivers latest 965 series include gma x 3000 core drivers developed intel tungsten graphics may 2007 version 2.0 driver xorg-video-intel released added support 965gm chipset addition 2.0 driver added native video mode programming support chipsets i830 forward version added support automatic video mode detection selection monitor hot plug dynamic extended merged desktops per-monitor screen rotation features built x.org 7.3 x server release eventually supported across open source x.org video drivers version 2.1 released july 2007 added support g33 q33 q35 chipsets g35 also supported linux driver common x.org drivers linux license combination gpl linux kernel parts mit parts drivers mainly developed intel tungsten graphics contract since chipsets documentation publicly available long time january 2008 intel released complete developer documentation time latest chipsets 965 g35 chipset allowing external developers involvement april 2009 intel released documentation newer g45 graphics including x4500 chipsets may 2009 intel employee eric anholt stated intel still working getting docs 8xx chipsets linux support hardware accelerated h.264 playback available working x4500hd x4500mhd using vaapi g45-h264 branch gma 500 gma 600 gma 3600 gma 3650 powervr based chips incompatible intel genx gpu architecture family intel supported foss drivers current available foss drivers included linux 3.3 onwards support 2d acceleration 3d acceleration ubuntu supports gma500 poulsbo ubuntu-mobile gma500 repositories launchpad support present experimental way 11.10 12.04 installation procedure simple drivers lead many bugs ubuntu 12.10 2d support included joli os linux-based os optimized netbooks driver gma500 built pixielive gnu/linux live distribution optimized gma500 netbooks boot usb pendrive sd card harddisk intel releases official linux drivers iegd intel embedded graphic driver supporting linux distributions dedicated embedded market november 2009 linux foundation released details new rewritten linux driver would support chipset intel upcoming chipsets direct rendering manager x.org parts would free software 3d component using gallium3d still proprietary oracle solaris 11 provides 64-bit video driver support following intel graphic chipsets i810 i810-dc100 i810e i815 i830m 845g 852gm/855gm 865g 915g e7221 i915 915gm 945g 945gm 945gme pineview gm pineview g 965g g35 965q 946gz 965gm 965gme/gle g33 q35 q33 gm45 4 series g45/g43 q45/q43 g41 b43 clarkdale arrandale sandybridge desktop gt1 sandybridge desktop gt2 sandybridge desktop gt2+ sandybridge mobile gt1 sandybridge mobile gt2 sandybridge mobile gt2+ ivybridge mobile gt1 ivybridge mobile gt2 ivybridge desktop gt1 ivybridge desktop gt2 ivybridge server gt1 ivybridge server gt2 solaris open-source community developers provide additional driver support intel hd graphics 4000/2500 graphic-based chipsets aka ivy bridge opengl 3.0/glsl 1.30 new libva/va-api library enabling hardware accelerated video decode prevailing coding standards today mpeg-2 mpeg-4 asp/h.263 mpeg-4 avc/h.264 vc-1/wmv3 gma 900 theoretically capable running windows vista aero interface certified directx 9 compliant however whql certified wddm driver made available presumably due lack hardware scheduler gpu intel gma 900 also first intel integrated gpu support drivers windows 9x operating systems including 98 many owners gma900 hardware believed would able run aero systems early release candidates vista permitted xddm drivers run aero intel however contends microsoft final specs aero/wddm certification permit releasing wddm driver gma900 due issues hardware scheduler mentioned final version vista released wddm driver released last minute pulling opengl capabilities gma drivers windows vista left large number gma based workstations unable perform basic 3d hardware acceleration opengl unable run many vista premium applications windows dvd maker windows 7 aero effects enabled vga compatibility driver via software rendering native gma900 drivers available windows 8 since xddm support removed operating system gma900 based laptops windows 7 users may experience serious bug related chipset native backlight control method failing change brightness resulting brightness becoming stuck particular value driver installation bug occur windows 7 initially released public commonly observed running windows update bug also occurs gma3150 based laptops igp capable displaying aero interface windows vista drivers shipped windows vista since beta versions became available mid-2006 also run windows 7 aero interface since intel released drivers windows 7 mid-june 2009 gma 950 integrated many netbooks built intel 945gse express chipset able display resolution 2048×1536 75 hz utilizing 224 mb shared memory reviews igp negative since many games need pixel shader 2.0 higher supported hardware vertex shader 2.0 software-emulated games crysis start frame rates acceptable l vertex shaders 3.0 supported intel newest 15.6 drivers windows vista september 2 2007 xp support vs3 l introduced august 10 2007 intel announced march 2007 beta drivers would available june 2007 june 1 2007 pre-beta early beta drivers released windows xp vista beta drivers vista xp released june 19 since hardware l vertex shading enabled drivers individual applications forced fall back software rendering raises performance compatibility certain cases selection based testing intel preselected driver .inf file intel released production version drivers 32-bit 64-bit windows vista enable aero graphics intel introduced directx 10 x3100 x3500 gpus vista 15.9 drivers 2008 though release dx10 drivers x3000 uncertain wddm 1.1 supported x3100 dxva-hd opengl 2.0 support available since vista 15.11 drivers xp 14.36 drivers windows 8 ships driver x3100 september 2010 latest available driver revisions intel website windows xp vista 7 performance functionality gma processors limited attaining performance low-cost discrete gpus best old directx 6 gpus riva tnt2 worst thus 're sometimes even dubbed graphics media decelerators though actual performance depended cpu well ram amount speed example atom n450 cpu gma 3150 perform comparably riva tnt2 pc tualatin pentium 3 even worse gpu sometimes even underclocked hindering already poor performance even features games 3d applications may unsupported gmas particularly older ones gma x3x00 unified shader design allows complete hardware functionality line still issues games significantly limited performance intel put page 'known issues solutions version intel graphics media accelerator software development concerns integrated graphics software development forum review conducted april 2007 tech report determined gma x3000 performance comparable nvidia geforce 6150 review gma x3000 unable run pc games battlefield 2 however extremetech review found games n't graphically demanding sims 2 civilization iv look good gma x3000 used run reviews performed tech report extremetech anandtech concluded amd radeon x1250 integrated graphics solutions based amd 690g chipset better choice gma x3000 based g965 chipset especially considering 3d gaming performance price review performed register hardware december 2007 author leo waldock argued gma x3500 capable running pc game requires directx 10 addition directx 10 support gma x3500 irrelevant review gma x3500 used run crysis f.e.a.r extraction point able render 4 14 frames per second respectively game end review concluded overall x3500 made minimal advances gma x3000 review published may 2008 gma x4500 showed superior game performance lowest-end 1-year-older geforce 8400m graphics card cpu-bound tests losing still low-end geforce 8400m gs slower cpu | [
3459,
5380,
3973,
8325,
9095,
9611,
4108,
7309,
9612,
9741,
5649,
5523,
6804,
8851,
4886,
9111,
3352,
10646,
799,
10658,
5503,
4011,
10669,
9391,
5681,
8625,
4276,
1461,
6069,
10548,
6972,
2237,
5309,
6339,
5444,
1998,
2638,
5073,
4178,
6... | None |
5,387 | 5 | MAC_filtering:mac filtering computer networking mac filtering refers security access control method whereby mac address assigned network card used determine access network mac addresses uniquely assigned card using mac filtering network permits denies network access specific devices use blacklists whitelists restriction network access use lists straightforward individual person identified mac address rather device authorized person need whitelist entry device would use access network giving network additional protection mac filtering circumvented using packet analyzer find valid mac using mac spoofing access network using address mac address filtering considered security obscurity effectiveness based secrecy implementation components many devices support mac filtering device basis whitelisted mac addresses allowed port device blacklisted mac addresses blocked ports devices cisco catalyst switches support mac filtering port-by-port basis referred port security port security may configured statically list dynamically based first given number addresses detected combination two methods port security configured default settings allow one mac address per port shut port allowed number addresses exceeded mac filtering also used enterprise wireless networks multiple access points prevent clients communicating access point configured allows clients talk default gateway wireless clients | [
9440,
8386,
2884,
9640,
10442,
2737,
7411,
1814,
7865,
2430,
5407
] | Test |
5,388 | 2 | The_Sims_FreePlay:sims freeplay sims freeplay strategic life simulation game developed ea mobile later firemonkeys studios free version sims mobile devices released ios december 15 2011 released android february 15 2012 released blackberry 10 july 31 2013 released windows phone 8 september 12 2013 game released fire os october 2012 sims freeplay players build design houses customize create maximum 100 virtual people called sims players control sims satisfy wishes let complete different kinds actions gain simoleons lifestyle points social points three currencies game game runs real-time takes real time complete actions actions must instructed players unlike windows version sims degree autonomy players progress 55 levels unlock content furniture sims ’ houses purchased virtual currencies previously mentioned families sims children provided one one adult limit amount allowable couples due limit people player town however player buys items online store become vip allow increase number sims town game quests players required complete well optional quests discovery quests may choose pursue sims must bake cake age completion certain quota discovery quests make cake takes 24 hours costs 5 lifestyle points three styles currency simoleons gained completing actions baking/cooking gardening sending sims work lifestyle ponts gained completing hobby collections tasks social points gained completing social tasks rewarded 1-2 social points game detail sims 4 sims mobile choices sim customization limited unless bought real currency time complete actions takes realistic times complete actions take 3 days game regularly updated new content many events competitions announced freeplay official facebook page updates commonly include elements various expansion packs stuff packs main series april 2017 windows phones longer receive updates game june 2018 pregnancy baby showers added game said fans requested feature added game ever since freeplay launched update sims marry option given add baby family october 15 2018 augmented reality multiplayer added july 2019 autosave function available | [
1571,
1599
] | None |
5,389 | 4 | Hardware_security:hardware security hardware security discipline originated cryptographic engineering involves hardware design access control secure multi-party computation secure key storage ensuring code authenticity measures ensure supply chain built product secure among things hardware security module hsm physical computing device safeguards manages digital keys strong authentication provides cryptoprocessing modules traditionally come form plug-in card external device attaches directly computer network server hardware backdoors backdoors hardware conceptionally related hardware trojan ht malicious modification electronic system particularly context integrated circuit physical unclonable function puf physical entity embodied physical structure easy evaluate hard predict individual puf device must easy make practically impossible duplicate even given exact manufacturing process produced respect hardware analog one-way function name physical unclonable function might little misleading pufs clonable pufs noisy therefore achieve requirements function today pufs usually implemented integrated circuits typically used applications high security requirements many attacks sensitive data resources reported organizations occur within organization | [
10851,
6020,
4965,
3178,
107,
1709,
3886,
7024,
2737,
2932,
8343,
7354,
91,
3262,
2558
] | Test |
5,390 | 3 | SLOB:slob slob simple list blocks allocator one three available memory allocators linux kernel two slab slub slob allocator designed require little memory implementation housekeeping use small systems embedded systems unfortunately major limitation slob allocator suffers greatly internal fragmentation slob currently uses first-fit algorithm uses first available space memory 2008 reply linus torvalds linux mailing list made suggested use best-fit algorithm tries find memory block suits needs best best fit finds smallest space fits required amount available avoiding loss performance fragmentation consolidation memory default linux kernel used slab allocation system version 2.6.23 slub allocation became default config_slab flag disabled kernel falls back using slob allocator slob allocator used dslinux nintendo ds handheld console | [
2278,
4871,
6352,
823,
3512
] | Test |
5,391 | 6 | BestCrypt:bestcrypt bestcrypt commercial disk encryption app windows linux os x developed jetico inc oy bestcrypt comes two editions volume encryption edition encrypts entire disk volumes container encryption edition encrypts virtual disks stored computer files also provides complimentary data erasure utility bcwipe bestcrypt supports wide variety block cipher algorithms including aes serpent blowfish twofish des triple des gost 28147-89 ciphers support cbc lrw modes operation aes twofish serpent also support xts mode | [
2050,
10631,
4746,
8331,
2193,
7983,
8115,
3382,
823,
7229,
8640,
9281,
7244,
8283,
8674,
7139,
11368,
3572,
5749
] | Test |
5,392 | 4 | Sean_Hastings:sean hastings sean hastings born 1969 entrepreneur cypherpunk author security expert best known founding ceo havenco world first formal data 1997 hastings worked cryptographic protocols tools free u.s. cryptographic export restrictions vincent cate started international conference financial cryptography anguilla year hastings founded havenco 2000 originally incorporating country residence anguilla second incorporation channel islands hastings ceo co-founders included ryan lackey sameer parekh immediately following public launch havenco subject great deal press coverage including hastings appearance along several cofounders royal family sealand cover wired july 2000 issue company entirely nationalised government sealand 2002 commercial failure mounting tensions 2002 hastings began work seasteading patri friedman project aimed building floating communities free restrictions current governments collaboration continued 2009 including talk hastings seasteading institute annual conference hastings cofounder eric s. raymond green-span open source infrastructure trust reputation management begun march 2009 hastings also author paul rosenberg book god wants dead vera verba 2007 takes look lighter side atheism anarchy | [
9404
] | Validation |
5,393 | 3 | Live_Partition_Mobility:live partition mobility live partition mobility chargeable live migration feature ibm power6 power7 power8 power9 servers available since 2007 allows running lpar relocated one system another concept similar vmware vmotion live partition mobility component powervm enterprise edition hardware feature provides ability move aix ibm linux logical partitions one system another mobility process transfers system environment includes processor state memory attached virtual devices connected users source target systems must access network sans need type requirement use power6 power7 power8 processors partitions relocated must fully virtualized i.e dedicated i/o adapters although possible use multi-pathing software fail virtual adapters duration move sized partition moved essentially memory copied asynchronously one system another create clone running partition dirty pages re-copied necessary threshold reached i.e high percentage pages successfully copied across partition transitioned target machine remaining pages copied across synchronously agents carry memory copying nominated virtual i/o servers machine standard ethernet network used data transmission live partition mobility used avoid outages planned server maintenance load balancing across multiple servers energy conservation | [
6153,
10543,
4017,
1309,
11613
] | None |
5,394 | 7 | Polestar_Xeus:polestar xeus polestar xeus cloud computing software manufactured nkia corporation south korea used manage iaas solutions provides various functions required management cloud systems reporting sla usage amount particular users times management construction performance events statistics virtual machines storage networks resource use policy management features gui-based drag-and-drop workflow api connection cloud systems polestar xeus compatible iaas solutions including vmware vsphere microsoft hyper-v citrix xen red hat enterprise virtualization nkia provides polestar xeus south korea | [
9655,
4194,
5371,
9455
] | Test |
5,395 | 9 | Interpreted_language:interpreted language interpreted language type programming language implementations execute instructions directly freely without previously compiling program machine-language instructions interpreter executes program directly translating statement sequence one subroutines another language often machine code terms interpreted language compiled language well defined theory programming language either interpreted compiled modern programming language implementation increasingly popular platform provide options interpreted languages also contrasted machine languages functionally execution interpretation mean thing — fetching next instruction/statement program executing although interpreted byte code additionally identical machine code form assembler representation term interpreted sometimes reserved software processed languages virtual machine emulator top native i.e hardware processor principle programs many languages may compiled interpreted emulated executed natively designation applied solely based common implementation practice rather representing essential property language many languages implemented using compilers interpreters including basic c lisp pascal java c compiled bytecode virtual-machine-friendly interpreted language lisp implementations freely mix interpreted compiled code distinction compiler interpreter always well defined many language processors combination early days computing language design heavily influenced decision use compiling interpreting mode execution example smalltalk 1980 designed interpreted run-time allows generic objects dynamically interact initially interpreted languages compiled line-by-line line compiled executed loop subroutine caused certain lines executed multiple times would recompiled every time become much less common so-called interpreted languages use intermediate representation combines compiling interpreting examples include intermediate representation compiled java time execution ruby time change source detected execution python interpreting language gives implementations additional flexibility compiled implementations features often easier implement interpreters compilers include furthermore source code read copied giving users freedom disadvantages interpreted languages several criteria used determine whether particular language likely called compiled interpreted users definitive compiled languages interpreter-like properties vice versa many languages first compiled bytecode ѕometimes bytecode also compiled native binary using aot compiler executed natively hardware processor | [
9224,
2062,
4627,
5651,
3613,
9245,
5677,
5680,
7219,
9780,
1591,
65,
4674,
10819,
8262,
5703,
6753,
2670,
623,
9330,
9331,
3705,
9345,
2691,
3221,
5783,
7326,
4770,
4777,
11442,
692,
191,
9926,
5833,
1234,
11488,
7395,
9454,
10991,
5361,... | Validation |
5,396 | 8 | MulticoreWare:multicoreware multicoreware inc software development company offering products services related hevc video compression ii machine learning specifically convolutional neural networks iii compilers heterogeneous computing iv software performance optimization multicoreware customers include amazon amd arm microsoft google telestream bbright technologies multicoreware founded 2009 today offices 3 countries – usa china india multicoreware placed 110 inc. 5000 list fastest growing private companies america year 2014 st. louis missouri based technology start-up accelerator iten listed company list top ten tech startups st. louis area three consecutive years 2012–2014 multicoreware ranked 22nd fastest growing private company silicon valley silicon valley business journal october 2014 july 2014 multicoreware named ee times silicon 60 list hot startups watch multicoreware inc. tie50 awards finalist tiecon2014 multicoreware leads development x265 hevc encoder x265 based x264 h.264/mpeg-4 avc encoder similar command-line syntax feature set x265 offered either gnu general public license gpl 2 license commercial license february 2014 telestream vantage transcode multiscreen became first commercial product introduce x265 encoding technology october 2015 video group moscow state university identified x265 highest overall efficiency i.e lowest bit rate target quality level first comparison hevc encoders lipsync tool automatically detects audio-video synchronization errors video using machine learning deep learning technologies errors detected without digital fingerprinting watermarking multicoreware offers uhdcode hevc video decoder api available x86 arm xbox 360 ps3 opencl accelerated supports hevc main/ main10 profiles march 2015 multicoreware launched x265 hevc upgrade includes x265 encoder application uhdcode directshow filter allowing hevc video playback 64-bit windows media player multicore cross platform architecture mxpa heterogeneous computing stack based llvm framework capable supporting opencl renderscript cuda c++ amp hcc open source parallel c++ compiler hsa opencl 1.2 hcc provides compiler frontends c++amp c++ source parallel stl openmp multicoreware one world ’ largest heterogeneous computing teams across globe offers accelerated software development services multicoreware contributor member khronos group active several standards full range services include | [
1952,
4321,
1578,
499,
8921,
6268
] | Validation |
5,397 | 2 | Unix-like:unix-like unix-like sometimes referred un*x *nix operating system one behaves manner similar unix system necessarily conforming certified version single unix specification unix-like application one behaves like corresponding unix command shell standard defining term difference opinion possible degree given operating system application unix-like term include free open-source operating systems inspired bell labs unix designed emulate features commercial proprietary work-alikes even versions based licensed unix source code may sufficiently unix-like pass certification bear unix trademark open group owns unix trademark administers single unix specification unix name used certification mark approve construction unix-like consider misuse trademark guidelines require unix presented uppercase otherwise distinguished surrounding text strongly encourage using branding adjective generic word system discourage use hyphenated phrases parties frequently treat unix genericized trademark add wildcard character name make abbreviation like un*x *nix since unix-like systems often unix-like names aix a/ux hp-ux irix linux minix ultrix xenix xinu xnu patterns literally match many system names still generally recognized refer unix descendant work-alike system even completely dissimilar names darwin/macos illumos/solaris freebsd 2007 wayne r. gray sued dispute status unix trademark lost case lost appeal court upholding trademark ownership unix-like systems started appear late 1970s early 1980s many proprietary versions idris 1978 unos 1982 coherent 1983 uniflex 1985 aimed provide businesses functionality available academic users unix allowed relatively inexpensive commercial binary sub-licensing unix 1979 variety proprietary systems developed based including aix hp-ux irix sunos tru64 ultrix xenix largely displaced proprietary clones growing incompatibility among systems led creation interoperability standards including posix single unix specification various free low-cost unrestricted substitutes unix emerged 1980s 1990s including 4.4bsd linux minix turn basis commercial unix-like systems bsd/os macos several versions mac os x/macos running intel-based mac computers certified single unix specification bsd variants descendants unix developed university california berkeley unix source code bell labs however bsd code base evolved since replacing code since bsd variants certified compliant single unix specification referred unix-like rather unix dennis ritchie one original creators unix expressed opinion unix-like systems linux de facto unix systems eric s. raymond rob landley suggested three kinds unix-like systems systems historical connection codebase commercial unix systems fall category bsd systems descendants work done university california berkeley late 1970s early 1980s systems original code still trace ancestry designs systemslargely commercial naturehave determined open group meet single unix specification allowed carry unix name systems commercial derivatives system v code base one form another although apple macos 10.5 later bsd variant certified systems ibm z/os earned trademark posix compatibility layer otherwise inherently unix systems many ancient unix systems longer meet definition broadly unix-like system behaves manner roughly consistent unix specification including program manages login command line sessions specifically refer systems linux minix behave similarly unix system genetic trademark connection code base free/open-source implementations unix design whether genetic unix fall restricted definition third category due expense obtaining open group certification costs thousands dollars commercial closed source systems around 2001 linux given opportunity get certification including free help posix chair andrew josey symbolic price one dollar activities make linux posix-compliant josey prepared list differences posix standard linux standard base specification august 2005 project shut missing interest lsb work group non-unix-like operating systems provide unix-like compatibility layer variable degrees unix-like functionality means windows-unix interoperability include | [
8204,
6158,
4113,
8209,
8213,
25,
2081,
6180,
2085,
8236,
6189,
6198,
8248,
2105,
4153,
59,
2109,
6207,
10304,
8260,
69,
2120,
6218,
2125,
2132,
4182,
93,
6238,
10333,
4192,
97,
6243,
100,
2149,
10341,
8295,
4200,
6248,
8298,
8301,
8304... | None |
5,398 | 7 | Salesforce_Tower:salesforce tower salesforce tower formerly known transbay tower office skyscraper south market district downtown san francisco located 415 mission street first fremont streets next transbay transit center site salesforce tower centerpiece san francisco transbay redevelopment plan plan contains mix office transportation retail residential uses upon completion 2018 became tallest skyscraper san francisco skyline top roof height overall height surpassing transamerica pyramid also second-tallest building west mississippi river wilshire grand center los angeles though salesforce tower taller wilshire grand center decorative spire excluded shorter roofline los angeles u.s. bank tower developer hines interests limited partnership proposal architect césar pelli pelli clarke pelli architects selected winner global competition 2007 entitle purchase site seven-member jury development experts assembled transbay joint powers authority tjpa selected hines proposals forest city enterprises architect richard rogers rockefeller development group corp. skidmore owings merrill 2012 boston properties acquired 50 stake project 2013 acquired hines remaining interest become 95 owners project site tower dilapidated area formerly used ground-level entrance san francisco transbay terminal demolished 2011 tjpa sold parcel boston properties hines us 192 million ceremonial groundbreaking new tower occurred march 27 2013 below-grade construction work starting late 2013 project joint venture general contractors clark construction hathaway dinwiddie construction footprint salesforce tower rests land fill near san francisco original waterfront area prone soil liquefaction earthquakes account seismic risk tower uses design modeled withstand strongest earthquakes expected region foundation includes 42 piles driven nearly bedrock thick foundation mat development originally contracted spec hines major tenant lease secured beforehand april 11 2014 salesforce.com announced signed lease become building anchor tenant previously known transbay tower building renamed salesforce tower lease valued us 560 million 15 half years starting 2017 tower opened 2018 61 floors decorative crown reaching original proposal called tower height later reduced building first tenants began moving january 8 2018 upon opening building 97 leased tenants including salesforce covington burling wework bain company accenture mcdermott emery hellman friedman 61st floor known ohana floor serves observation deck lounge salesforce employees guests made available use nonprofits evenings weekends transbay transit center located foot building february 5 2019 company announced opened advanced registration public tours ohana floor every month starting february 23 10 april 2019 council tall buildings urban habitat ctbuh named salesforce tower “ best tall building worldwide 2019 17th annual ctbuh international best tall building awards symposium ceremony dinner celebrated grand hyatt shenzhen shenzhen china | [
8555,
10090,
1739
] | None |
5,399 | 9 | Parsing:parsing parsing syntax analysis syntactic analysis process analysing string symbols either natural language computer languages data structures conforming rules formal grammar term parsing comes latin pars orationis meaning part speech term slightly different meanings different branches linguistics computer science traditional sentence parsing often performed method understanding exact meaning sentence word sometimes aid devices sentence diagrams usually emphasizes importance grammatical divisions subject predicate within computational linguistics term used refer formal analysis computer sentence string words constituents resulting parse tree showing syntactic relation may also contain semantic information term also used psycholinguistics describing language comprehension context parsing refers way human beings analyze sentence phrase spoken language text terms grammatical constituents identifying parts speech syntactic relations etc term especially common discussing linguistic cues help speakers interpret garden-path sentences within computer science term used analysis computer languages referring syntactic analysis input code component parts order facilitate writing compilers interpreters term may also used describe split separation traditional grammatical exercise parsing sometimes known clause analysis involves breaking text component parts speech explanation form function syntactic relationship part determined large part study language conjugations declensions quite intricate heavily inflected languages parse phrase 'man bites dog involves noting singular noun 'man subject sentence verb 'bites third person singular present tense verb 'to bite singular noun 'dog object sentence techniques sentence diagrams sometimes used indicate relation elements sentence parsing formerly central teaching grammar throughout english-speaking world widely regarded basic use understanding written language however general teaching techniques longer current machine translation natural language processing systems written texts human languages parsed computer programs human sentences easily parsed programs substantial ambiguity structure human language whose usage convey meaning semantics amongst potentially unlimited range possibilities germane particular case utterance man bites dog versus dog bites man definite one detail another language might appear man dog bites reliance larger context distinguish two possibilities indeed difference concern difficult prepare formal rules describe informal behaviour even though clear rules followed order parse natural language data researchers must first agree grammar used choice syntax affected linguistic computational concerns instance parsing systems use lexical functional grammar general parsing grammars type known np-complete head-driven phrase structure grammar another linguistic formalism popular parsing community research efforts focused less complex formalisms one used penn treebank shallow parsing aims find boundaries major constituents noun phrases another popular strategy avoiding linguistic controversy dependency grammar parsing modern parsers least partly statistical rely corpus training data already annotated parsed hand approach allows system gather information frequency various constructions occur specific contexts see machine learning approaches used include straightforward pcfgs probabilistic context-free grammars maximum entropy neural nets successful systems use lexical statistics consider identities words involved well part speech however systems vulnerable overfitting require kind smoothing effective parsing algorithms natural language rely grammar 'nice properties manually designed grammars programming languages mentioned earlier grammar formalisms difficult parse computationally general even desired structure context-free kind context-free approximation grammar used perform first pass algorithms use context-free grammars often rely variant cyk algorithm usually heuristic prune away unlikely analyses save time see chart parsing however systems trade speed accuracy using e.g. linear-time versions shift-reduce algorithm somewhat recent development parse reranking parser proposes large number analyses complex system selects best option semantic parsers convert texts representations meanings psycholinguistics parsing involves assignment words categories formation ontological insights evaluation meaning sentence according rules syntax drawn inferences made word sentence known connotation normally occurs words heard read consequently psycholinguistic models parsing necessity incremental meaning build interpretation sentence processed normally expressed terms partial syntactic structure creation initially wrong structures occurs interpreting garden path sentences discourse analysis examines ways analyze language use semiotic events persuasive language may called rhetoric parser software component takes input data frequently text builds data structure – often kind parse tree abstract syntax tree hierarchical structure giving structural representation input checking correct syntax parsing may preceded followed steps may combined single step parser often preceded separate lexical analyser creates tokens sequence input characters alternatively combined scannerless parsing parsers may programmed hand may automatically semi-automatically generated parser generator parsing complementary templating produces formatted output may applied different domains often appear together scanf/printf pair input front end parsing output back end code generation stages compiler input parser often text computer language may also text natural language less structured textual data case generally certain parts text extracted rather parse tree constructed parsers range simple functions scanf complex programs frontend c++ compiler html parser web browser important class simple parsing done using regular expressions group regular expressions defines regular language regular expression engine automatically generating parser language allowing pattern matching extraction text contexts regular expressions instead used prior parsing lexing step whose output used parser use parsers varies input case data languages parser often found file reading facility program reading html xml text examples markup languages case programming languages parser component compiler interpreter parses source code computer programming language create form internal representation parser key step compiler frontend programming languages tend specified terms deterministic context-free grammar fast efficient parsers written compilers parsing done one pass multiple passes – see one-pass compiler multi-pass compiler implied disadvantages one-pass compiler largely overcome adding fix-ups provision made code relocation forward pass fix-ups applied backwards current program segment recognized completed example fix-up mechanism would useful would forward goto statement target goto unknown program segment completed case application fix-up would delayed target goto recognized conversely backward goto require fix-up location already known context-free grammars limited extent express requirements language informally reason memory language limited grammar remember presence construct arbitrarily long input necessary language example name must declared may referenced powerful grammars express constraint however parsed efficiently thus common strategy create relaxed parser context-free grammar accepts superset desired language constructs accepts invalid constructs later unwanted constructs filtered semantic analysis contextual analysis step example python following syntactically valid code following code however syntactically valid terms context-free grammar yielding syntax tree structure previous syntactically invalid terms context-sensitive grammar requires variables initialized use rather analyzed parsing stage caught checking values syntax tree hence part semantic analysis context-sensitive syntax practice often easily analyzed semantics following example demonstrates common case parsing computer language two levels grammar lexical syntactic first stage token generation lexical analysis input character stream split meaningful symbols defined grammar regular expressions example calculator program would look input codice_1 split tokens codice_2 codice_3 codice_4 codice_5 codice_6 codice_7 codice_8 codice_9 codice_10 meaningful symbol context arithmetic expression lexer would contain rules tell characters codice_3 codice_6 codice_9 codice_4 codice_8 mark start new token meaningless tokens like codice_16 codice_17 generated next stage parsing syntactic analysis checking tokens form allowable expression usually done reference context-free grammar recursively defines components make expression order must appear however rules defining programming languages expressed context-free grammars alone example type validity proper declaration identifiers rules formally expressed attribute grammars final phase semantic parsing analysis working implications expression validated taking appropriate action case calculator interpreter action evaluate expression program compiler hand would generate kind code attribute grammars also used define actions task parser essentially determine input derived start symbol grammar done essentially two ways parsers recursive-descent parser examples top-down parsers accommodate left recursive production rules although believed simple implementations top-down parsing accommodate direct indirect left-recursion may require exponential time space complexity parsing ambiguous context-free grammars sophisticated algorithms top-down parsing created frost hafiz callaghan accommodate ambiguity left recursion polynomial time generate polynomial-size representations potentially exponential number parse trees algorithm able produce left-most right-most derivations input regard given context-free grammar important distinction regard parsers whether parser generates leftmost derivation rightmost derivation see context-free grammar parsers generate leftmost derivation lr parsers generate rightmost derivation although usually reverse algorithms designed visual programming languages parsers visual languages sometimes based graph grammars adaptive parsing algorithms used construct self-extending natural language user interfaces well known parser development tools include following also see comparison parser generators lookahead establishes maximum incoming tokens parser use decide rule use lookahead especially relevant lr lalr parsers often explicitly indicated affixing lookahead algorithm name parentheses lalr 1 programming languages primary target parsers carefully defined way parser limited lookahead typically one parse parsers limited lookahead often efficient one important change trend came 1990 terence parr created antlr ph.d. thesis parser generator efficient k parsers k fixed value lr parsers typically actions seeing token shift add token stack later reduction reduce pop tokens stack form syntactic construct end error known rule applies conflict know whether shift reduce lookahead two advantages example parsing expression programming languages except apl smalltalk algebraic formulas give higher precedence multiplication addition case correct interpretation example note rule4 semantic rule possible rewrite grammar incorporate syntax however rules translated syntax initially input 1 2 3 parse tree resulting code correct according language semantics correctly parse without lookahead three solutions parse tree generated correct simply non-lookahead parsers strategy followed lalr parsers | [
2050,
5122,
5635,
2059,
1552,
1044,
2582,
538,
2599,
3624,
10791,
10794,
6188,
4662,
2103,
3127,
6208,
9796,
8262,
74,
5197,
6223,
2144,
6242,
7780,
10340,
8295,
4092,
1649,
116,
2167,
119,
4733,
6795,
6798,
9871,
5781,
8866,
2222,
4293,
... | None |
5,400 | 3 | RoboCop_(1988_video_game):robocop 1988 video game robocop beat 'em up/run gun arcade game developed published data east 1988 based 1987 film name sub-licensed data east ocean software obtained rights orion pictures script stage robocop hybrid game featuring elements beat 'em well run gun titles despite arcade game numerous versions appeared home computers video game consoles first group released 1988 apple ii pc compatibles amiga atari st apple pc ports developed quicksilver software amiga st versions developed directly ocean data east published game north america nes port followed 1989 developed sakata sas co version trs-80 coco 3 ocean developed published version game boy 1990 1989 ocean released different robocop game bore loose resemblance arcade version produced commodore 64 msx zx spectrum tandy color computer 3 amstrad cpc well pc compatibles meaning pcs ended two entirely different robocop games north american european audiences many ocean c64 titles cassette disk versions released north american release also published data east based disk version c64 robocop versions notorious high numbers bugs 2015 cracker group nostalgia released completely bug-fixed robocop compatible pal ntsc machines port game atari jaguar planned never released zx spectrum version robocop achieved particular critical success receiving crash smash award crash 94 sinclair user sinclair gave 8.8 10 also placing number 94 sinclair official top 100 overall opinion game better original arcade game capture original material smooth scrolling animation sampled speech sound effects highlighted addition zx spectrum robocop one biggest selling games time platform number one sales charts year half entered charts april 1989 still top five february 1991 readers ys voted 9th best game time title theme ocean software versions composed jonathan dunn become well known serene calm tune heavily contrasted tone actual game source material version theme heard game boy port later licensed european kitchen appliance company ariston use series tv adverts song also used theme song charlie brooker documentary videogames changed world well music internet short dilbert 3 song sampled lil b song bad mixtape white flame | [
7269,
9006,
2159,
1776,
6129,
7281,
9166,
6485,
6390,
10679
] | Test |
5,401 | 1 | Microsoft_Jet_Database_Engine:microsoft jet database engine microsoft jet database engine also microsoft jet engine simply jet database engine several microsoft products built first version jet developed 1992 consisting three modules could used manipulate database jet stands joint engine technology microsoft access visual basic use used jet underlying database engine however superseded general use first microsoft desktop engine msde later sql server express larger database needs jet databases upgraded microsoft parlance up-sized microsoft flagship sql server database product however mean ms jet red database match ms sql server storage capacity 5 billion record ms jet red database compression encryption turned requires 1 terabyte disk storage space comprising hundreds *.mdb files acting partial table database jet part relational database management system rdbms allows manipulation relational databases offers single interface software use access microsoft databases provides support security referential integrity transaction processing indexing record page locking data replication later versions engine extended run sql queries store character data unicode format create database views allow bi-directional replication microsoft sql server three modules jet one native jet isam driver dynamic link library dll directly manipulate microsoft access database files mdb using indexed sequential access method isam another one modules contains isam drivers dlls allow access variety isam databases among xbase paradox btrieve foxpro depending version jet final module data access objects dao dll dao provides api allows programmers access jet databases using programming language jet allows multiple users access database concurrently prevent data corrupted invalidated multiple users try edit record page database jet employs locking policy single user modify database records items database user applied lock gives exclusive access record lock released jet versions version 4 page locking model used jet 4 record locking model employed microsoft databases organized data pages fixed-length 2 kb jet 4 4 kb jet 4 data structures data stored records variable length may take less one page page locking model works locking pages instead individual records though less resource-intensive also means user locks one record records page collaterally locked result user access collaterally locked records even though user accessing need locked jet 4 record locking model eliminates collateral locks every record use available two mechanisms microsoft uses locking pessimistic locking optimistic locking pessimistic locking record page locked immediately lock requested optimistic locking locking delayed edited record saved conflicts less likely occur optimistic locking since record locked short period time however optimistic locking one certain update succeed another user could lock record first pessimistic locking update guaranteed succeed lock obtained users must wait lock released order make changes lock conflicts either require user wait cause request fail usually timeout common pessimistic locking jet supports transaction processing database systems capability odbc systems one-level transaction processing several isam systems like paradox support transaction processing transaction series operations performed database must done together — known atomicity one acid atomicity consistency isolation durability concepts considered key transaction processing features database management system transaction processing work jet 3.0 programmer needed begin transaction manually perform operations needed performed transaction commit save transaction transaction committed changes made memory actually written disk transactions number advantages independent database updates one main advantages transactions abandoned problem occurs transaction called rolling back transaction rollback restores state database records precisely state transaction began transactions also permit state database remain consistent system failure occurs middle sequence updates required atomic chance updates end written database either succeed changes discarded database system restarts odbc in-memory policy transactions also allow many updates record occur entirely within memory one expensive disk write end implicit transactions supported jet 3.0 transactions started automatically last transaction committed database implicit transactions jet occurred sql dml statement issued however found negative performance impact 32-bit windows windows 95 windows 98 jet 3.5 microsoft removed implicit transactions sql dml statements made jet enforces entity integrity referential integrity jet default prevent change record breaks referential integrity jet databases instead use propagation constraints cascading updates cascading deletes maintain referential integrity jet also supports business rules also known constraints rules apply column enforce data might placed table column example rule might applied allow date entered date_logged column earlier current date time rule might applied forces people enter positive value numeric field access jet databases done per user-level user information kept separate system database access controlled object system instance table query jet 4 microsoft implemented functionality allows database administrators set security via sql commands create add alter drop user drop group commands subset ansi sql 92 standard also apply grant/revoke commands jet 2 released security could also set programmatically dao queries mechanisms jet uses retrieve data database defined microsoft qbe query example microsoft access sql window access basic data access objects dao language converted sql select statement query compiled — involves parsing query involves syntax checking determining columns query database table converted internal jet query object format tokenized organised tree like structure jet 3.0 onwards optimised using microsoft rushmore query optimisation technology query executed results passed back application user requested data jet passes data retrieved query dynaset set data dynamically linked back database instead query result stored temporary table data updated directly user dynaset allows user view update data contained dynaset thus university lecturer queries students received distinction assignment finds error student record would need update data dynaset would automatically update student database record without need send specific update query storing query results temporary table jet originally started 1992 underlying data access technology came microsoft internal database product development project code named cirrus cirrus developed pre-release version visual basic code used database engine microsoft access tony goodhew worked microsoft time says would reasonably accurate say stage jet name team assigned work db engine modules access rather component team vb visual basic 3.0 basically tear access graft onto vb 've jet/odbc problems vb 3.0 jet became componentised access 2.0 released access odbc developers used parts jet code produce odbc driver retrofit provided allowed visual basic 3.0 users use updated jet issued access 2.0 jet 2.0 released several dynamic linked libraries dlls utilised application software microsoft access database dlls windows libraries common code used one application—by keeping code one application uses common library applications use independently code maintenance reduced functionality applications increases less development effort jet 2.0 comprised three dlls jet dll data access objects dao dll several external isam dlls jet dll determined sort database accessing perform requested data source mdb file microsoft access format would directly read write data file data source external would call correct odbc driver perform request dao dll component programmers could use interface jet engine mainly used visual basic access basic programmers isam dlls set modules allowed jet access three isam based databases xbase paradox btrieve jet 2.0 replaced jet 2.1 used database structure different locking strategies making incompatible jet 2.0 jet 3.0 included many enhancements including new index structure reduced storage size time taken create indices highly duplicated removal read locks index pages new mechanism page reuse new compacting method compacting database resulted indices stored clustered-index format new page allocation mechanism improve jet read-ahead capabilities improved delete operations speeded processing multithreading three threads used perform read ahead write behind cache maintenance implicit transactions users instruct engine start manually commit transactions database new sort engine long values memos binary data types stored separate tables dynamic buffering whereby jet cache dynamically allocated start limit changed first first fifo buffer replacement policy least recently used lru buffer replacement policy jet 3.0 also allowed database replication jet 3.0 replaced jet 3.5 uses database structure different locking strategies making incompatible jet 3.0 jet 4.0 gained numerous additional features enhancements microsoft access versions access 2000 access 2010 included upsizing wizard could upsize upgrade jet database equivalent database sql server table structure data many attributes original database reports queries macros security handled tool meaning manual modifications might needed application heavily reliant jet features standalone version jet 4 database engine component microsoft data access components mdac included every version windows windows 2000 jet database engine 32-bit run natively 64-bit versions windows meant native 64-bit applications 64-bit versions sql server could access data stored mdb files odbc ole db means except intermediate 32-bit software running wow64 acted proxy 64-bit client version 2007 onwards access includes office-specific version jet initially called office access connectivity engine ace called access database engine however ms-access consultants vba developers specialize ms-access likely refer ace database engine engine backward-compatible previous versions jet engine could read write .mdb files earlier access versions introduced new default file format .accdb brought several improvements access including complex data types multivalue fields attachment data type history tracking memo fields also brought security changes encryption improvements enabled integration microsoft windows sharepoint services 3.0 microsoft office outlook 2007 engine microsoft access 2010 discontinued support access 1.0 access 2.0 lotus 1-2-3 paradox files 64-bit version access 2010 ace driver/provider introduced essence provides 64-bit version jet driver part windows operating system available redistributable engine microsoft access 2013 discontinued support access 95 access 97 xbase files also discontinued support replication version 1608 microsoft access 2016 restored support xbase files version 1703 introduced large number data type data access technology standpoint jet considered deprecated technology microsoft microsoft continues support ace part microsoft access microsoft provides jet drivers microsoft windows therefore third party software support jet databases almost exclusively found windows open source project attempts enable working jet databases platforms mdb tools much extended java port named jackcess | [
10243,
3591,
10769,
9234,
1043,
6166,
5658,
1055,
2083,
8227,
4647,
1577,
10286,
4143,
9263,
11316,
1077,
6709,
8246,
4674,
9286,
4174,
4178,
83,
9813,
603,
608,
2145,
8804,
5225,
1656,
5754,
8315,
9340,
5761,
9348,
5765,
10886,
2183,
525... | None |
5,402 | 5 | Internet_Control_Message_Protocol:internet control message protocol internet control message protocol icmp supporting protocol internet protocol suite used network devices including routers send error messages operational information indicating example requested service available host router could reached icmp differs transport protocols tcp udp typically used exchange data systems regularly employed end-user network applications exception diagnostic tools like ping traceroute icmp ipv4 defined rfc 792 icmp part internet protocol suite defined rfc 792 icmp messages typically used diagnostic control purposes generated response errors ip operations specified rfc 1122 icmp errors directed source ip address originating packet example every device intermediate router forwarding ip datagram first decrements time live ttl field ip header one resulting ttl 0 packet discarded icmp time exceeded transit message sent datagram source address many commonly used network utilities based icmp messages traceroute command implemented transmitting ip datagrams specially set ip ttl header fields looking icmp time exceeded transit destination unreachable messages generated response related ping utility implemented using icmp echo request echo reply messages icmp uses basic support ip higher level protocol however icmp actually integral part ip although icmp messages contained within standard ip packets icmp messages usually processed special case distinguished normal ip processing many cases necessary inspect contents icmp message deliver appropriate error message application responsible transmission ip packet prompted sending icmp message icmp network layer protocol tcp udp port number associated icmp packets numbers associated transport layer icmp packet encapsulated ipv4 packet packet consists header data sections icmp header starts ipv4 header identified ip protocol number 1 icmp packets 8-byte header variable-sized data section first 4 bytes header fixed format last 4 bytes depend type/code icmp packet icmp error messages contain data section includes copy entire ipv4 header plus least first eight bytes data ipv4 packet caused error message maximum length icmp error messages 576 bytes data used host match message appropriate process higher level protocol uses port numbers assumed first eight bytes original datagram data variable size icmp packet data section exploited ping death large fragmented ping packets used denial-of-service attacks icmp data also used create covert channels communication channels known icmp tunnels control messages identified value type field code field gives additional context information message control messages deprecated since protocol first introduced source quench requests sender decrease rate messages sent router host message may generated router host sufficient buffer space process request may occur router host buffer approaching limit data sent high speed host several hosts time particular router network although router buffering capabilities buffering limited within specified range router queue data capacity limited buffering space thus queue gets filled incoming data discarded queue longer full acknowledgement mechanism present network layer client know whether data reached destination successfully hence remedial measures taken network layer avoid kind situations measures referred source quench source quench mechanism router sees incoming data rate much faster outgoing data rate sends icmp message clients informing slow data transfer speeds wait certain amount time attempting send data client receives message automatically slow outgoing data rate wait sufficient amount time enables router empty queue thus source quench icmp message acts flow control network layer since research suggested icmp source quench ineffective unfair antidote congestion routers creation source quench messages deprecated 1995 rfc 1812 furthermore forwarding kind reaction flow control actions source quench messages deprecated 2012 rfc 6633 redirect requests data packets sent alternative route icmp redirect mechanism routers convey routing information hosts message informs host update routing information send packets alternative route host tries send data router r1 r1 sends data another router r2 direct path host r2 available host r2 ethernet segment r1 send redirect message inform host best route destination via r2 host send packets destination directly r2 router still send original datagram intended destination however datagram contains routing information message sent even better route available rfc 1122 states redirects sent gateways sent internet hosts time exceeded generated gateway inform source discarded datagram due time live field reaching zero time exceeded message may also sent host fails reassemble fragmented datagram within time limit time exceeded messages used traceroute utility identify gateways path two hosts timestamp used time synchronization originating timestamp set time milliseconds since midnight sender last touched packet receive transmit timestamps used timestamp reply replies timestamp message consists originating timestamp sent sender timestamp well receive timestamp indicating timestamp received transmit timestamp indicating timestamp reply sent address mask request normally sent host router order obtain appropriate subnet mask recipients reply message address mask reply message icmp address mask request may used part reconnaissance attack gather information target network therefore icmp address mask reply disabled default cisco ios address mask reply used reply address mask request message appropriate subnet mask destination unreachable generated host inbound gateway inform client destination unreachable reason reasons message may include physical connection host exist distance infinite indicated protocol port active data must fragmented 'do n't fragment flag unreachable tcp ports notably respond tcp rst rather destination unreachable type 3 might expected destination unreachable never reported ip multicast transmissions | [
10242,
1541,
1030,
14,
8211,
6681,
6682,
10271,
6689,
9251,
2085,
7208,
7214,
8238,
562,
1586,
9269,
11319,
11321,
3133,
5181,
6723,
11332,
581,
8265,
8266,
4687,
6735,
1618,
10852,
10341,
9318,
10344,
3695,
4723,
2679,
4729,
5761,
5251,
... | Test |
5,403 | 1 | Stored_procedure:stored procedure stored procedure also termed proc storp sproc stopro storedproc storeproc sp sp subroutine available applications access relational database management system rdbms procedures stored database data dictionary uses stored procedures include data-validation integrated database access-control mechanisms furthermore stored procedures consolidate centralize logic originally implemented applications save time memory extensive complex processing requires execution several sql statements saved stored procedures applications call procedures one use nested stored procedures executing one stored procedure within another stored procedures may return result sets i.e. results codice_1 statement result sets processed using cursors stored procedures associating result-set locator applications stored procedures may also contain declared variables processing data cursors allow loop multiple rows table stored-procedure flow-control statements typically include codice_2 codice_3 codice_4 codice_5 codice_6 statements stored procedures receive variables return results modify variables return depending variable declared stored procedures similar user-defined functions udfs major difference udfs used like expression within sql statements whereas stored procedures must invoked using codice_7 statement exact correct implementation stored procedures varies one database system major database vendors support form depending database system stored procedures implemented variety programming languages example sql java c c++ stored procedures written non-sql languages may may execute sql statements increasing adoption stored procedures led introduction procedural elements sql language standards part sql/psm made sql imperative programming language database systems offer proprietary vendor-specific extensions exceeding sql/psm standard specification java stored procedures exists well sql/jrt systems stored procedures used control transaction management others stored procedures run inside transaction transactions effectively transparent stored procedures also invoked database trigger condition handler example stored procedure may triggered insert specific table update specific field table code inside stored procedure would executed writing stored procedures condition handlers also allows database administrators track errors system greater detail using stored procedures catch errors record audit information database external resource like file prepared statements take ordinary statement query parameterize different literal values used later time like stored procedures stored server efficiency provide protection sql injection attacks although simpler declarative prepared statements ordinarily written use procedural logic operate variables simple interface client-side implementations prepared statements widely reusable dbms | [
5641,
522,
8201,
2063,
2068,
1049,
5658,
9248,
5669,
10793,
5677,
10286,
6709,
5691,
11324,
8262,
9286,
2632,
9290,
6219,
11339,
8788,
10326,
7767,
10849,
9828,
10340,
8808,
2669,
1146,
3196,
3712,
9360,
10389,
4255,
4263,
9389,
10413,
2737... | Validation |
5,404 | 4 | Application_security:application security application security encompasses measures taken improve security application often finding fixing preventing security vulnerabilities different techniques used surface security vulnerabilities different stages applications lifecycle design development deployment upgrade maintenance always evolving largely consistent set common security flaws seen across different applications see common flaws different techniques find different subsets security vulnerabilities lurking application effective different times software lifecycle represent different tradeoffs time effort cost vulnerabilities found utilizing techniques appropriately throughout software development life cycle sdlc maximize security role application security team according patterns practices improving web application security book following classes common application security threats attacks owasp community publishes list top 10 vulnerabilities web applications outlines best security practices organizations aiming create open standards industry 2017 organization lists top application security threats proportion mobile devices providing open platform functionality expected continue increase future openness platforms offers significant opportunities parts mobile eco-system delivering ability flexible program service delivery= options may installed removed refreshed multiple times line user ’ needs requirements however openness comes responsibility unrestricted access mobile resources apis applications unknown untrusted origin could result damage user device network managed suitable security architectures network precautions application security provided form open os mobile devices symbian os microsoft brew etc. 2017 google expanded vulnerability reward program cover vulnerabilities found applications developed third parties made available google play store industry groups also created recommendations including gsm association open mobile terminal platform omtp several strategies enhance mobile application security including security testing techniques scour vulnerabilities security holes applications vulnerabilities leave applications open exploitation ideally security testing implemented throughout entire software development life cycle sdlc vulnerabilities may addressed timely thorough manner unfortunately testing often conducted afterthought end development cycle growth continuous delivery devops popular software development deployment models continuous security models becoming popular vulnerability scanners specifically web application scanners otherwise known penetration testing tools i.e ethical hacking tools historically used security organizations within corporations security consultants automate security testing http request/responses however substitute need actual source code review physical code reviews application source code accomplished manually automated fashion given common size individual programs often 500,000 lines code human brain execute comprehensive data flow analysis needed order completely check circuitous paths application program find vulnerability points human brain suited filtering interrupting reporting outputs automated source code analysis tools available commercially versus trying trace every possible path compiled code base find root cause level vulnerabilities many kinds automated tools identifying vulnerabilities applications require great deal security expertise use others designed fully automated use results dependent types information source binary http traffic configuration libraries connections provided tool quality analysis scope vulnerabilities covered common technologies used identifying application vulnerabilities include static application security testing sast technology frequently used source code analysis tool method analyzes source code security vulnerabilities prior launch application used strengthen code method produces fewer false positives implementations requires access application source code requires expert configuration lots processing power dynamic application security testing dast technology able find visible vulnerabilities feeding url automated scanner method highly scalable easily integrated quick dast drawbacks lie need expert configuration high possibility false positives negatives interactive application security testing iast solution assesses applications within using software instrumentation technique allows iast combine strengths sast dast methods well providing access code http traffic library information backend connections configuration information iast products require application attacked others used normal quality assurance testing advances professional malware targeted internet customers online organizations seen change web application design requirements since 2007 generally assumed sizable percentage internet users compromised malware data coming infected host may tainted therefore application security begun manifest advanced anti-fraud heuristic detection systems back-office rather within client-side web server code 2016 runtime application self-protection rasp technologies developed rasp technology deployed within alongside application runtime environment instruments application enables detection prevention attacks cert coordination center describes coordinated vulnerability disclosure cvd “ process reducing adversary advantage information security vulnerability mitigated. ” cvd iterative multi-phase process involves multiple stakeholders users vendors security researchers may different priorities must work together resolve vulnerability cvd processes involve multiple stakeholders managing communication vulnerability resolution critical success operational perspective many tools processes aid cvd include email web forms bug tracking systems coordinated vulnerability platforms | [
5636,
10756,
6665,
2084,
1573,
3629,
7739,
9791,
11333,
2118,
4681,
9293,
87,
4198,
107,
3698,
5245,
5246,
9345,
130,
9356,
2705,
4755,
10392,
1689,
10909,
2213,
7337,
9901,
7855,
11446,
2238,
3262,
2758,
711,
7368,
9926,
9932,
5325,
4820... | None |
5,405 | 5 | SOCKS:socks socks internet protocol exchanges network packets client server proxy server socks5 additionally provides authentication authorized users may access server practically socks server proxies tcp connections arbitrary ip address provides means udp packets forwarded socks performs layer 5 osi model session layer intermediate layer presentation layer transport layer socks server accepts incoming client connection tcp port 1080 protocol originally developed/designed david koblas system administrator mips computer systems mips taken silicon graphics 1992 koblas presented paper socks year usenix security symposium making socks publicly available protocol extended version 4 ying-da lee nec socks reference architecture client owned permeo technologies spin-off nec blue coat systems bought permeo technologies socks5 protocol originally security protocol made firewalls security products easier administer approved ietf 1996 protocol developed collaboration aventail corporation markets technology outside asia socks de facto standard circuit-level gateways another use socks circumvention tool allowing traffic bypass internet filtering access content otherwise blocked e.g. governments workplaces schools country-specific web services ssh suites openssh support dynamic port forwarding allows user create local socks proxy free user limitations connecting predefined remote port server tor onion proxy software presents socks interface clients hacked computers may configured socks proxy software obscuring control botnet optimise credit card fraud socks operates lower level http proxying socks uses handshake protocol inform proxy software connection client trying make acts transparently possible whereas regular proxy may interpret rewrite headers say employ another underlying protocol ftp however http proxy simply forwards http request desired http server though http proxying different usage model mind connect method allows forwarding tcp connections however socks proxies also forward udp traffic work reverse http proxies http proxies traditionally aware http protocol performing higher-level filtering though usually applies get post methods connect method bill wishes communicate jane internet firewall exists network bill authorized communicate jane directly bill connects socks proxy network informing connection wishes make jane socks proxy opens connection firewall facilitates communication bill jane information technical specifics socks protocol see sections bill wishes download web page jane runs web server bill directly connect jane server firewall put place network order communicate server bill connects network http proxy web browser communicates proxy exactly way would directly jane server possible sends standard http request header http proxy connects jane server transmits back bill data jane server returns typical socks4 connection request looks like socks client socks server socks server socks client example socks4 request connect fred 66.102.7.99:80 server replies ok point onwards data sent socks client socks server relayed 66.102.7.99 vice versa command field may 0x01 connect 0x02 bind bind command allows incoming connections protocols active ftp socks4a extends socks4 protocol allow client specify destination domain name rather ip address useful client resolve destination host domain name ip address client set first three bytes dstip null last byte non-zero value corresponds ip address 0.0.0.x x nonzero inadmissible destination address thus never occur client resolve domain name following null byte terminating userid client must send destination domain name terminate another null byte used connect bind requests client socks server server socks client server using protocol socks4a must check dstip request packet represents address 0.0.0.x nonzero x server must read domain name client sends packet server resolve domain name make connection destination host socks5 protocol defined rfc 1928 extension socks4 protocol offers choices authentication adds support ipv6 udp latter used dns lookups initial handshake consists following authentication methods supported numbered follows initial greeting client server choice communicated subsequent authentication method-dependent username password authentication method 0x02 described rfc 1929 username/password authentication client authentication request server response username/password authentication client connection request server response client software must native socks support order connect socks programs allow users circumvent limitations | [
10242,
10271,
2085,
7208,
2093,
562,
3133,
5181,
11332,
8265,
4687,
10341,
10344,
4725,
9860,
4229,
649,
1164,
6797,
9868,
3218,
9365,
11413,
2206,
3742,
8355,
9380,
9381,
3751,
3752,
10924,
5811,
9909,
1208,
7865,
4797,
4287,
3777,
7873,
... | Test |
5,406 | 2 | Nokia_X_platform:nokia x platform nokia x platform linux-based mobile operating system software platform originally developed nokia subsequently microsoft mobile introduced 24 february 2014 forked android used devices nokia x family also next nokia linux project ill-fated meego 17 july 2014 acquisition nokia devices unit microsoft announced nokia x smartphones introduced marking end nokia x platform within months introduction phones succeeded low-cost lumia devices microsoft mobile brand name nokia x software platform based android open source project aosp linux kernel nokia combined android apps nokia experiences maps nokia xpress mixradio microsoft services skype outlook nokia officially described software bringing best worlds also encompasses features asha platform fastlane notification centre user interface mimics windows phone os heavily compared amazon.com fire os also based aosp google applications replaced nokia microsoft first released google play store included nokia offering apps nokia store however since v2.1 update september 2014 users allowed install google play various google services third party tools users attempt install google services nokia x devices would usually get bricked would require nokia software recovery tool restore data february 2014 75 android apps compatible platform nokia also noted developers port remaining missing apps matter hours attempt encourage developers contribute platform previously added compatible android apps without developer approval sdk available platform includes emulator based android emulator nokia discouraging developers using windows phone design patterns encouraging android design guidelines nokia x. nokia vp developer relations commented nokia imaging sdk likely ported platform windows phone | [
8576,
10754,
6787,
6276,
8829,
11271,
4364,
6797,
8976,
3857,
3477,
1687,
6301,
4383,
10016,
10273,
8098,
3626,
5677,
9262,
7727,
3248,
7857,
7983,
823,
1083,
321,
7492,
8262,
9033,
5067,
2380,
2892,
6476,
7246,
9166,
4305,
2259,
4051,
72... | None |
5,407 | 4 | Blacklist_(computing):blacklist computing computing blacklist blocklist basic access control mechanism allows elements email addresses users passwords urls ip addresses domain names file hashes etc except explicitly mentioned items list denied access opposite whitelist means items list let whatever gate used greylist contains items temporarily blocked temporarily allowed additional step performed blacklists applied various points security architecture host web proxy dns servers email server firewall directory servers application authentication gateways type element blocked influenced access control location dns servers may well-suited block domain names example urls firewall well-suited blocking ip addresses less blocking malicious files passwords example uses include company might prevent list software running network school might prevent access list web sites computers business wants ensure computer users choosing easily guessed poor passwords blacklists used protect variety systems computing content blacklist likely needs targeted type system defended information system includes end-point hosts like user machines servers blacklist location may include certain types software allowed run company environment example company might blacklist peer peer file sharing systems addition software people devices web sites also blacklisted email providers anti-spam feature essentially blacklists certain email addresses deemed unwanted example user wearies unstoppable emails particular address may blacklist address email client automatically route messages address junk-mail folder delete without notifying user e-mail spam filter may keep blacklist email addresses mail would prevented reaching intended destination may also use sending domain names sending ip addresses implement general block addition private email blacklists lists kept public use including goal blacklist web browser prevent user visiting malicious deceitful web page via filtering locally common web browsing blacklist google safe browsing installed default firefox safari chrome blacklisting also apply user credentials common systems websites blacklist certain reserved usernames allowed chosen system website user populations reserved usernames commonly associated built-in system administration functions password blacklists similar username blacklists typically contain significantly entries username blacklists password blacklists applied prevent users choosing passwords easily guessed well known could lead unauthorized access malicious parties password blacklists deployed additional layer security usually addition password policy sets requirements password length and/or character complexity significant number password combinations fulfill many password policies still easily guessed i.e. password123 qwerty123 blacklists distributed variety ways use simple mailing lists dnsbl common distribution method leverages dns lists make use rsync high-volume exchanges data web-server functions may used either simple get requests may used complicated interfaces restful api expressed recent conference paper focusing blacklists domain names ip addresses used internet security lists generally intersect therefore appears lists converge one set malicious indicators concern combined economic model means blacklists essential part network defense need used concert whitelists greylists example would adblock plus blocklist includes number features including whitelists within blacklist adding prefix two symbols two pipe symbols e.g ||www.blocksite.com | [
899,
4100,
5387,
9745,
1172,
1305,
10906,
1438,
8224,
929,
8998,
2737,
2227,
9909,
823,
2108,
4797,
1472,
6592,
11073,
708,
2887,
9181,
2527,
9824,
9569,
6757,
2408,
5482,
5866,
9712,
10105,
7035,
5245
] | None |
5,408 | 4 | Mass_assignment_vulnerability:mass assignment vulnerability mass assignment computer vulnerability active record pattern web application abused modify data items user normally allowed access password granted permissions administrator status many web application frameworks offer active record object-relational mapping features external data serialization formats automatically converted input internal objects turn database record fields framework interface conversion permissive application designer n't mark specific fields immutable possible overwrite fields never intended modified outside e.g admin permissions flag vulnerabilities found applications written ruby rails asp.net mvc java play framework 2012 mass assignment ruby rails allowed bypassing mapping restrictions resulted proof concept injection unauthorized ssh public keys user accounts github vulnerabilities ruby rails allowed creation internal objects specially crafted json structure asp.net core mapping restriction declared using codice_1 attribute | [
11221,
9467,
5636,
10341
] | Validation |
5,409 | 9 | F-Script_(programming_language):f-script programming language f-script object-oriented scripting programming language apple macos operating system developed philippe mougin f-script interactive language based smalltalk using macos native cocoa api f-script based pure object paradigm every entity manipulated within language object base syntax concepts identical language smalltalk canonical example object-oriented language specific extensions support array programming language apl f-script provides interpreted interactive environment support workspaces provide rich set functions including object persistence distributed objects graphical user interface gui framework database access among things like smalltalk f-script syntax simple without requiring specific notation control structures provided unified manner codice_1 operation unlike smalltalk f-script provides specific notational extensions support codice_2 class using curly brackets describe literal arrays may contain f-script expressions example codice_3 valid array literal empty array denoted codice_4 arrays arrays supported transparently since array another object message expressions f-script similar smalltalk specify object receiver message operation called message argument objects needed operation f-script supports unary binary keyword messages f-script message semantics extended support array programming recognizing array operation adding numerical vectors must viewed generating number messages relating elements vectors involved thus codice_5 codice_6 f-script allows codice_7 f-script chiefly used lightweight scripting layer top macos cocoa application programming interface api embedded applications using f-script framework interface builder palettes also used interactively f-script interpreter prototype applications finally used explore applications object hierarchies using injector f-script anywhere | [
9345,
2980,
10406,
7983,
9780,
1852,
8262,
4943,
2901,
11221,
2519,
1112,
862,
11625,
9323,
8303,
9714,
499,
3323,
511
] | Test |
5,410 | 2 | Mark_Shuttleworth:mark shuttleworth mark richard shuttleworth born 18 september 1973 south african british entrepreneur founder ceo canonical ltd. company behind development linux-based ubuntu operating system 2002 became first south african travel space space tourist lives isle man holds dual citizenship south africa united kingdom born welkom south africa orange free state surgeon nursery-school teacher shuttleworth attended school western province preparatory school eventually became head boy 1986 followed one term rondebosch boys high school bishops/diocesan college head boy 1991 shuttleworth obtained bachelor business science degree finance information systems university cape town lived smuts hall student became involved installation first residential internet connections university 1995 shuttleworth founded still-extant thawte consulting company specialized digital certificates internet security december 1999 thawte acquired verisign earning shuttleworth r3.5 billion million equivalent million september 2000 shuttleworth formed hbd venture capital dragons business incubator venture capital provider march 2004 formed canonical ltd. promotion commercial support free software projects especially ubuntu operating system december 2009 shuttleworth stepped ceo canonical ltd jane silber took canonical ceo position shuttleworth resumed position ceo canonical july 2017 end silber tenure 1990s shuttleworth participated one developers debian operating system 2001 formed shuttleworth foundation nonprofit organisation dedicated social innovation also funds educational free open source software projects south africa freedom toaster 2004 returned free software world funding development ubuntu linux distribution based debian company canonical ltd 2005 founded ubuntu foundation made initial investment 10 million dollars ubuntu project shuttleworth often referred tongue-in-cheek title self-appointed benevolent dictator life sabdfl come list names people hire project shuttleworth took six months debian mailing list archives travelling antarctica aboard icebreaker kapitan khlebnikov early 2004 september 2005 purchased 65 stake impi linux 15 october 2006 announced mark shuttleworth became first patron kde highest level sponsorship available relationship ended 2012 together financial support kubuntu ubuntu variant kde main desktop 17 december 2009 mark announced effective march 2010 would step ceo canonical focus energy product design partnership customers jane silber coo canonical since 2004 took job ceo canonical september 2010 received honorary degree open university work 9 november 2012 shuttleworth kenneth rogoff took part debate opposite garry kasparov peter thiel oxford union entitled innovation enigma 25 october 2013 shuttleworth ubuntu awarded austrian anti-privacy big brother award sending local ubuntu unity dash searches canonical servers default year earlier 2012 shuttleworth defended anonymisation method used shuttleworth gained worldwide fame 25 april 2002 second self-funded space tourist first-ever south african space flying space adventures launched aboard russian soyuz tm-34 mission spaceflight participant paying approximately voyage two days later soyuz spacecraft arrived international space station spent eight days participating experiments related aids genome research 5 may 2002 returned earth soyuz tm-33 order participate flight shuttleworth undergo one year training preparation including seven months spent star city russia space radio conversation nelson mandela 14-year-old south african girl michelle foster asked marry politely dodged question stating honoured question changing subject terminally ill foster provided opportunity conversation mark shuttleworth nelson mandela reach dream foundation private jet bombardier global express often referred canonical one fact owned hbd venture capital company dragon depicted side plane norman hbd venture capital mascot upon moving r2.5 billion capital south africa isle man south african reserve bank imposed r250 million levy order release assets shuttleworth appealed lengthy legal battle reserve bank ordered repay r250 million plus interest shuttleworth announced would donating entire amount trust established help others take cases constitutional court 18 june 2015 constitutional court south africa reversed set aside findings lower courts ruling dominant purpose exit charge regulate conduct rather raise revenue | [
1026,
5644,
2581,
4123,
10780,
3618,
6691,
2109,
10817,
3654,
8263,
10822,
589,
4177,
1107,
8787,
4192,
7793,
3189,
5755,
7812,
8326,
8848,
657,
2195,
6808,
1694,
6302,
8354,
8364,
3245,
1717,
6352,
3802,
4831,
1761,
4841,
7913,
9971,
536... | Test |
5,411 | 4 | Shade_sandbox:shade sandbox shade sandbox sandbox-based isolation program developed eugene balabanov shade distributed consumers shareware solution creates isolated virtual environment within computer rather running software browsing internet directly instead perform actions fenced-off safe area mechanism creates highly controlled environment running untested untrustworthy apps without threatening host operating system shade sandbox basically plugin security toolkit engine platform enables developers build security-related solutions file monitors api spy utilities course virtual environments platform available corporate customers vendor site suggests capabilities platform provides plugins findmysoft rated shade sandbox 5 5 stars naming essential softpedia describes shade simple yet reliable anti-virus protection | [
5380,
4972,
7983,
9488,
8466,
7380,
3484
] | Test |
5,412 | 9 | SWEET16:sweet16 sweet16 interpreted byte-code language invented steve wozniak implemented part integer basic rom apple ii series computers created wozniak needed manipulate 16-bit pointer data implementation basic apple ii 8-bit computer sweet16 code executed running 16-bit processor sixteen internal 16-bit little-endian registers named registers well-defined functions 16 virtual registers 32 bytes total located zero page apple ii real physical memory map – values stored low byte followed high byte sweet16 interpreter located integer basic rom according wozniak sweet16 implementation model frugal coding taking 300 bytes memory sweet16 runs one-tenth speed equivalent native 6502 code | [
8868,
1029,
5733,
9739,
10796,
3630,
1776,
7281,
5395,
372,
9911,
7323
] | Validation |
5,413 | 6 | ISO_9660:iso 9660 iso 9660 file system optical disc media published international organization standardization iso file system considered international technical standard since specification available anybody purchase implementations written many operating systems iso 9660 traces roots high sierra format file system high sierra arranged file information dense sequential layout minimize nonsequential access using hierarchical eight levels directories deep tree file system arrangement similar unix fat facilitate cross platform compatibility defined minimal set common file attributes directory ordinary file time recording name attributes name extension version used separate system use area future optional extensions file may specified high sierra adopted december 1986 changes international standard ecma international ecma-119 submitted fast tracking iso eventually accepted iso 9660:1988 2013 iso published amendment 1 iso 9660 standard introducing new data structures relaxed file name rules intended bring harmonization iso 9660 widely used 'joliet specification december 2017 3rd edition ecma-119 published technically identical iso 9660 amendment 1 following rough overall structure iso 9660 file system system area first 32,768 data bytes disc 16 sectors 2,048 bytes unused iso 9660 therefore available uses example cd-rom may contain alternative file system descriptor area often used hybrid cds offer classic mac os-specific macos-specific content multi-byte values stored twice little-endian big-endian format either one-after-another specification calls both-byte orders duplicated data structures path table structures designed unaligned members endian encoding however help implementors data structures need read byte-wise convert properly aligned data data area begins set one volume descriptors terminated volume descriptor set terminator collectively volume descriptor set acts header data area describing content similar bios parameter block used fat hpfs ntfs formatted disks volume descriptor set terminator simply particular type volume descriptor purpose marking end set structures volume descriptor 2048 bytes size fitting perfectly single mode 1 mode 2 form 1 sector following structure data field volume descriptor may subdivided several fields exact content depending type standard volume descriptor types following iso 9660 compliant disc contains least one primary volume descriptor describing file system volume descriptor set terminator indicating end descriptor sequence primary volume descriptor provides information volume characteristics metadata including root directory record indicates sector root directory located fields contain description name volume information created application size logical blocks file system uses segment volume also stored field inside primary volume descriptor well amount space occupied volume measured number logical blocks addition primary volume descriptor supplementary volume descriptors enhanced volume descriptors may present supplementary volume descriptors describe volume primary volume descriptor normally used providing additional code page support standard code tables insufficient standard specifies iso 2022 used managing code sets wider 8 bytes iso 2375 escape sequences used identify particular code page used consequently iso 9660 supports international single-byte multi-byte character sets provided fit framework referenced standards however iso 9660 specify code pages guaranteed supported use code tables defined standard subject agreement originator recipient volume enhanced volume descriptors introduced iso 9660 amendment 1 relax requirements volume descriptors directory records referenced example directory depth exceed eight file identifiers need contain file version number length file directory identifier maximized 207 redundant copies volume descriptor also included case first copy descriptor becomes corrupt directory entries stored following location root directory entry evaluation filenames begun directories files stored extents sequential series sectors files directories differentiated file attribute indicates nature similar unix attributes file stored directory entry describes file optionally extended attribute record locate file directory names file path checked sequentially going location directory obtain location subsequent subdirectory however file also located path table provided file system path table stores information directory parent location disc since path table stored contiguous region searched much faster jumping particular locations directory file path thus reducing seek time standard specifies three nested levels interchange paraphrased section 10 additional restrictions body standard depth directory hierarchy must exceed 8 root directory level 1 path length file must exceed 255 section 6.8.2.1 standard also specifies following name restrictions sections 7.5 7.6 path tables summarize directory structure relevant directory hierarchy providing directory identifier location extent directory recorded length extended attributes associated directory index parent directory path table entry restrictions filename length 8 characters plus 3 character extension interchange level 1 directory depth 8 levels including root directory serious limitation iso 9660 file system rock ridge extension works around eight-directory depth limit folding paths practice however drivers oses care directory depth rule often ignored addition restrictions mentioned cd-rom producer may choose one lower levels interchange specified chapter 10 standard restrict file name length 30 characters 8+3 file identifiers 8 directory identifiers order promote interchangeability implementations implement full standard sometimes mistakenly interpreted restriction iso 9660 standard numbers iso 9660 file systems except single byte value used gmt offset unsigned numbers length file extent disc stored 32 bit value allows maximum length 4.2 gb precisely one byte less 4 gib note older operating systems may handle values incorrectly i.e signed instead unsigned would make impossible access files larger 2 gb size latter holds true also operating systems without large file support based often assumed file iso 9660 formatted disc larger 2-1 size file size stored unsigned 32 bit value 2-1 maximum however possible circumvent limitation using multi-extent fragmentation feature iso 9660 level 3 create iso 9660 file systems single files 8 tib files larger 4 gib split multiple extents sequential series sectors exceeding 4 gib limit example free software infrarecorder imgburn mkisofs well roxio toast able create iso 9660 file systems use multi-extent files store files larger 4 gib appropriate media recordable dvds empirical tests 4.2 gb fragmented file dvd media shown microsoft windows xp supports mac os x 10.4.8 handle case properly case mac os x driver appears support file fragmentation i.e supports iso 9660 level 2 level 3 linux supports multiple extents another limitation number directories iso image structure called path table directory image path table provides number parent directory entry problem parent directory number 16-bit number limiting range 1 65,535 content directory written also different place making path table redundant suitable fast searching operating systems e.g windows use path table others e.g linux iso image disc consists 65,535 directories readable linux early windows versions files additional directories visible show empty zero length software tools problems managing path table directory limit exceeded popular application using iso format mkisofs aborts path table overflow nero burning rom windows pinnacle instant cd/dvd check whether problem occurs produce invalid iso file disc without warning several extensions iso 9660 relax limitations operating systems support extensions name translation file trans.tbl must used located every directory including root directory obsolete since operating systems use today iso 13490 standard extension iso 9660 format adds support multiple sessions disc since iso 9660 design read-only pre-mastered file system data written one go session medium written provision altering stored content iso 13490 created allow adding files writeable disc cd-r multiple sessions iso 13346/ecma-167 standard designed conjunction iso 13490 standard address shortcomings iso 9660 subset evolved udf format adopted dvds jis x 0606:1998 also known iso 9660:1999 japanese industrial standard draft created japanese national body jtc1 n4222 order make improvements remove limitations original iso 9660 standard draft submitted 1998 ratified iso standard yet changes includes removal restrictions imposed original standard extending maximum file name length 207 characters removing eight-level maximum directory nesting limit removing special meaning dot character filenames operating systems allow relaxations well reading optical discs several disc authoring tools nero burning rom mkisofs imgburn support so-called iso 9660:1999 mode sometimes called iso 9660 v2 iso 9660 level 4 mode removes restrictions following guidelines iso 9660:1999 draft iso 9660 file system images iso images common way electronically transfer contents cd-roms often filename extension codice_1 codice_2 less common also use commonly referred isos operating systems support reading iso 9660 formatted discs new versions support extensions rock ridge joliet operating systems support extensions usually show basic non-extended features plain iso 9660 disc operating systems support iso 9660 extensions include following | [
5120,
10752,
2564,
11270,
5643,
6669,
3598,
4624,
10257,
9236,
6677,
5142,
8214,
537,
3611,
540,
5149,
3102,
9245,
9249,
9762,
8227,
8740,
5158,
7720,
1577,
10281,
2101,
3126,
1079,
7225,
11323,
10812,
4669,
576,
3648,
8772,
10310,
1098,
... | None |
5,414 | 7 | UNICORE:unicore unicore uniform interface computing resources grid computing technology resources supercomputers cluster systems information stored databases unicore developed two projects funded german ministry education research bmbf european-funded projects unicore evolved middleware system used several supercomputer centers unicore served basis research projects unicore technology open source bsd licence available sourceforge concept grid computing first introduced book grid blueprint new computing infrastructure end 1998 1997 development unicore initiated german supercomputer centers alternative globus toolkit first prototype developed german unicore project foundations production version laid follow-up project unicore plus ended 2002 follow-up european projects extended functionality worked towards providing implementations open grid forum standards resulted release unicore 6 28 august 2007 unicore consists three layers user server target system tier user tier represented various clients primary clients unicore rich client graphical user interface based eclipse framework unicore commandline client ucc clients use soap web services communicate server tier xml documents used transmit platform site independent descriptions computational data related tasks resource information workflow specifications client server servers accessible via secure socket layer protocol single secure entry point unicore site gateway accepts authenticates requests forwards target service server unicore/x used access particular set grid resources site unicore supports many different system architectures ensures organization full control resources unicore/x servers may used access supercomputer linux cluster single pc unicore/x server creates concrete target system specific actions xml job description abstract job objects ajo received client available unicore services include job submission job management file access file transfer client-server server-server storage operations mkdir ls etc workflow submission management target system tier consists target system interface tsi directly interfaces underlying local operating system resource management system security within unicore relies usage permanent x.509 certificates issued trusted certification authority ca certificates used provide single sign-on unicore client i.e password requests handed user addition certificates used authentication authorization including mapping unicore user certificates local accounts e.g unix uid/gid signing xml requests sent ssl based communication channels across 'insecure internet links using x.509 certificates one example consideration well-known standards e.g released global grid forum ggf within unicore architecture trust delegation unicore uses signed saml assertions local authorisation controlled xacml policies components unicore technology open source software bsd license downloaded sourceforge repository many european international research projects base grid software implementations unicore e.g eurogrid grip openmolgrid viola japanese naregi project projects extended extending set core unicore functions including new features specific research project focus goals projects limited computer science community scientific domains bioengineering computational chemistry also using unicore basis work research like openmolgrid chemomentum projects within european deisa project leading hpc centers europe joined deploy operate pervasive distributed heterogeneous multi-tera-scale supercomputing platform unicore used grid middleware access deisa resources unicore deployed distributed computing infrastructures europe prace european grid infrastructure egi foreseen deployed upcoming extreme science engineering discovery environment xsede infrastructure united states unicore successfully used production environments e.g within john von neumann-institute computing nic access 294912 core jugene ibm bluegene/p supercomputer 26304 core juropa cluster users resources come broad field scientific domains including e.g astrophysics quantum physics medicine biology computational chemistry climatology | [
11353,
10625,
5956,
198,
3449,
3849,
5258,
7018,
11658,
3323,
8912,
8370,
5492,
249,
2651,
8702,
7935
] | Test |
5,415 | 9 | Language_primitive:language primitive computing language primitives simplest elements available programming language primitive smallest 'unit processing available programmer given machine atomic element expression language primitives units meaning i.e. semantic value language thus different tokens parser minimal elements syntax machine instruction usually generated assembler program often considered smallest unit processing although always case typically performs perceived one operation copying byte string bytes one computer memory location another adding one processor register another many today computers however actually embody even lower unit processing known microcode interprets machine code microcode instructions would genuine primitives instructions would typically available modification hardware vendor programmers high-level programming language hll program composed discrete statements primitive data types may also perceived perform single operation represent single data item higher semantic level provided machine copying data item one location another may actually involve many machine instructions instance finally hll statements particularly involving loops generate thousands even millions primitives low-level programming language lll comprise genuine instruction path length processor execute lowest level perception referred abstraction penalty interpreted language statement similarities hll primitives added layer statement executed manner similar hll statement must first processed interpreter process may involve many primitives target machine language fourth-generation programming languages 4gl fifth-generation programming languages 5gl simple one-to-many correspondence high-to-low level primitives elements interpreted language primitives embodied 4gl 5gl specifications approach original problem less procedural language construct oriented toward problem solving systems engineering | [
2691,
6021,
7173,
8582,
9871,
5395,
10145,
1841,
8627,
9911,
7612,
8262,
4042,
7627,
8143,
2529,
4838,
9330,
9331
] | Test |
5,416 | 4 | Sproxil:sproxil sproxil american venture capital-backed for-profit company based cambridge massachusetts provides consumer product verification service called mobile authentication service mas help consumers avoid purchasing counterfeit products service first mobile authentication service mas launch nigeria iso 27001 iso 9001 certified company also offers supply chain protection solutions including track trace mobile-based loyalty marketing programs advisory services sproxil operations nigeria mali ghana serving west africa tanzania kenya serving east africa india pakistan asia sproxil ’ service places security label scratch-off panel protected products consumers scratch panel point purchase reveal unique one-time use code form mass serialization code sent via sms mobile app country-specific short code consumer receives reply almost instantly indicating product genuine suspicious company also 24/7 call center provide support verification process take anonymous reports suspicious counterfeiting activity sproxil ’ services currently used several pharmaceutical companies fight counterfeit drugs fake drug market according world customs organization estimated 200 billion year industry problem counterfeit drugs particularly acute emerging markets world health organization estimates 30 drugs markets fake may harmful consumers date sproxil protects products across multiple industries including pharmaceuticals agribusiness automotive parts beauty personal care etc 2010 nafdac nigerian government agency overseeing food drugs endorsed sproxil platform service widely deployed throughout nigeria april 2011 cnn published video discussing role sproxil played fight counterfeit drugs nigeria sproxil along pfizer vodafone waterhealth international committed business call action bcta global leadership initiative made companies apply core business expertise achievement eight internationally agreed millennium development goals mdgs sproxil ceo ashifi gogo praised former united states president bill clinton described gogo ’ work “ genuinely remarkable achievement. ” february 2011 sproxil announced received 1.8 million funding acumen fund funding used help company expand india johnson johnson gsk glaxosmithkline using sproxil services africa nigerian distributor merck kgaa named biofem june 2011 sproxil launched operations india july 2011 kenya pharmacy poisons board ppb also adopted similar text message-based anti-counterfeiting systems early 2012 sproxil announced one million people africa checked medicines using text-message based verification service developed sproxil august 2012 sproxil bharti airtel global telecommunications company announced partnership combat counterfeit drug market africa using mpa airtel offer service absolutely free users charge sms based verification february 2013 sproxil signed east african cables protect electric cables zinduka initiative initiative utilizes mpa solution help consumers verify electrical cables genuine purchase partnership marked sproxil expansion non-pharmaceutical markets industries uses sproxil solution textile clothing underwear also around time prashant yadav senior research fellow director healthcare research initiative joined sproxil board advisors yadav expert pharmaceutical healthcare supply chain management emerging markets formerly professor supply chain management mit-zaragoza international logistics program currently serves advisor multiple organizations area pharmaceutical supply chains ceo ashifi gogo recently named white house immigrant innovator champion change schwab foundation social entrepreneur year 2014 work sproxil 2014 company expanded mobile authentication services originally available consumers sms call center adding mobile apps web app solution suite year sproxil became iso-27001 information security controls iso-9001 quality management systems certified comprehensive review internal processes soon kenya-based agribusiness company juanco sps officially launched consumer-facing project protects pesticide bestox 100ec mpa technology date company processed 75 million verifications consumers highest recorded number verifications kind 2017 unilever global development award 2016 innovative healthcare service provider year 2015 interface health excellence ihx challenge 2015 frost sullivan enabling technology leadership award 2014 schwab foundation social entrepreneur year award 2013 uspto patents humanity award 2013 1 health care 7 overall fast company magazine world 50 innovative companies 2012 ismp cheers award george didomizio industry award 2012 icc world business development award 2010 honorable mention global finals ibm entrepreneur smartcamp competition 2010 masschallenge finalist 2010 mobile infrastructure award mitx 2010 people ’ choice award accelerate michigan 2010 prize winner african diaspora marketplace 2010 audience choice award life sciences xconomy xsite 2009 outstanding commitment award global health clinton global initiative university | [
3323
] | Test |
5,417 | 3 | ARM_Cortex-A12:arm cortex-a12 arm cortex-a12 32-bit processor core licensed arm holdings implementing armv7-a architecture provides 4 cache-coherent cores cortex-a12 successor cortex-a9 arm renamed a12 variant cortex-a17 since second revision core early 2014 indistinguishable performance arm claims cortex-a12 core 40 percent powerful cortex-a9 core new features found cortex-a9 include hardware virtualization 40-bit large physical address extensions lpae addressing announced supporting big.little however shortly afterwards arm cortex-a17 announced upgraded version capability key features cortex-a12 core | [
11282,
9235,
11289,
1057,
38,
4139,
8237,
9774,
2097,
8250,
8253,
7745,
7747,
2635,
99,
8812,
8815,
10361,
638,
644,
8842,
146,
659,
7833,
666,
5786,
6815,
4258,
4773,
9913,
8383,
10945,
4821,
2788,
3301,
9964,
6391,
3835,
2814,
781,
69... | Test |
5,418 | 9 | Principles_of_Compiler_Design:principles compiler design principles compiler design alfred aho jeffrey ullman classic textbook compilers computer programming languages often called dragon book cover depicts knight dragon battle dragon green labeled complexity compiler construction knight wields lance shield labeled lalr parser generator syntax directed translation respectively rides horse labeled data flow analysis book may called green dragon book distinguish successor aho sethi ullman red dragon book second edition compilers principles techniques tools added fourth author monica s. lam dragon became purple hence becoming purple dragon book book also contains entire code making compiler back cover offers original inspiration cover design dragon replaced windmills knight quixote book published addison-wesley acknowledgments mention book entirely typeset bell labs using troff unix operating system little time seen outside laboratories | [
1952,
8262,
9002,
3468,
7983,
11023,
5492,
5464
] | None |
5,419 | 1 | Ship_registration_in_Hong_Kong:ship registration hong kong hong kong shipping register set 1990 hong kong merchant shipping registration ordinance administered marine department hong kong since transfer sovereignty united kingdom 1997 hong kong authorised basic law government people ’ republic china using name “ hong kong china ” maintain separate ship registration system april 1999 hong kong government launched new measures improve ship registration system hong kong cooperation government shipping industry total tonnage ship registry hong kong reached 100 millions gross tonnes 2,440 vessels registered january 2016 hong kong ship register world ’ fourth largest ship register world ’ largest national flag register first time registration fee ship determined according gross tonnage gt annual tonnage charge ship determined referring net tonnage nt minimum annual tonnage charge hk 1,500 every tonne 1000 nt costing extra hk 3.5 15,000 nt whereby rate lowers hk 3 per tonne thereafter charge would exceed hk 77,500 annual tonnage charge atc reduction scheme since february 2006 annual tonnage charge atc reduction scheme enacted reduce long term cost ship owners whereby every two years qualifying period satisfying registered ship owner would right enjoy six months atc reduction following year general ship eligible registration ship 3 types registration full registration provisional registration bare boat charter registration registration procedures requires submission ship hong kong shipping register full provisional registration mortgages ship registered agents hk flag registration include hong kong registered ships enjoy 30 preferential port dues mainland china ports since january 2000 order reduce port light dues hong kong registered ships hksar expects sign agreements countries two-tier charging system income derived international trade hong kong registered ships exempted profits tax hksar also entered bilateral double taxation relief agreements 40 countries include agreement avoidance double taxation dta denmark germany netherlands norway singapore sri lanka united kingdom united states reciprocal tax exemption rte chile korea new zealand comprehensive dta cdta austria belgium brunei canada czech france guernsey hungary indonesia ireland italy japan jersey korea kuwait liechtenstein luxembourg mainland china malaysia malta mexico netherlands new zealand portugal qatar romania south africa spain switzerland thailand united arab emirates united kingdom vietnam flag state quality control fsqc system based information system monitor quality hong kong registered ships analyzing collecting information unqualified conditions ship identified flag state inspection pre-registration quality control prqc system involves marine department inspect ship ’ condition registered hong kong ship meet safety pollution prevention standards announced international maritime organization | [
10073,
41,
676
] | Test |
5,420 | 9 | Gregor_Kiczales:gregor kiczales gregor kiczales american computer scientist currently full time professor computer science university british columbia vancouver british columbia canada best known developing concept aspect-oriented programming aspectj extension java programming language designed working xerox parc also one co-authors specification common lisp object system author book art metaobject protocol along jim des rivières daniel g. bobrow kiczales work throughout years focused allowing software engineers create programs look much possible like design reduce complexity make code maintenance easier ultimately improving software quality pursuing undergraduate studies mit kiczales started research career 1980 mit lab computer science stayed 1983 1984 joined xerox palo alto research center software research lab member research staff becoming principal scientist 1996 throughout time parc kiczales developed important research works including aspect-oriented programming aspectj left parc 1999 focus computer science education 2000 moved canada joined department computer science university british columbia tenured professor ubc kiczales started software practices lab designed number courses related software engineering programming languages importantly designed cpsc 110 introductory programming course ubc curriculum students take first year undergraduate studies course focuses systematic program design means design recipes 2002 co-founded intentional software charles simonyi left company 2003 order return ubc 2012 senior aito dahl-nygaard prize work common lisp object system named acm fellow contributions aspect-oriented programming july 2017 appointed executive director ubc extended learning | [
11490,
2438,
8173,
5677,
2062,
5585,
9969,
9877
] | Test |
5,421 | 4 | Author_Domain_Signing_Practices:author domain signing practices computing author domain signing practices adsp optional extension dkim e-mail authentication scheme whereby domain publish signing practices adopts relaying mail behalf associated authors adsp adopted standards track rfc 5617 august 2009 declared historic november 2013 ... almost deployment use 4 years since ... author address one specified header field defined rfc 5322 unusual cases one address defined field rfc 5322 provides sender field used instead domains 5322- addresses necessarily elaborated purported responsible address covered sender id specified rfc 4407 domain 5322- address also necessarily envelope sender address defined rfc 5321 also known smtp mail envelope- 5321- return-path optionally protected spf specified rfc 7208 author domain signature valid dkim signature domain name dkim signing entity i.e. tag dkim-signature header field domain name author address binding recognizes higher value author domain signatures valid signatures may happen found message fact proves entity controls dns zone author — hence also destination replies message author — relayed author message likely author submitted message proper message submission agent message qualification verified independently published domain signing practice practices published dns record author domain author address john.doe example.com may set three possible signing practices provided adsp specification explicitly discourages publishing record different unknown domains independent users usage policy explicitly restrict sending mail designated mail servers since mail sent independently organization signed however explicitly caveat worded straightforward understand purpose limitations adsp one adsp authors holds better publish private lists discardable domains maintained competent people rather letting domain state policy recognizing spec shipped untested prototype author popular adsp implementation proposed downgrade adsp experimental status later actually downgraded historical consideration dmarc covers less use case influential tied time adsp known asp author signing practices original ssp sender signing practices protocol naming poll domainkeys dkim predecessor outbound signing policy consisting single character domain signs email otherwise dkim intentionally avoided signers policies considerations dkim validate message field directly policy-neutral authentication protocol association signer right use field visible end users deferred separate specification eric allman author sendmail editor adsp specification ietf dkim working group draft adsp specification started june 2007 went 11 revisions lengthy discussion published rfc august 2009 declared historic four years later november 2013 ... almost deployment use 4 years since ... | [
2848,
8130,
1125,
2887,
8202,
8332,
8337,
9909,
472,
4793
] | None |
5,422 | 3 | King's_Knight:king knight game became square first north american release redmond subsidiary squaresoft first release independent company 1986 release title screen credits workss programming king knight saw second release 1987 nec pc-8801mkii sr sharp x1 versions game retitled king knight special released exclusively japan first game designed hironobu sakaguchi famicom nobuo uematsu provided musical score king knight uematsu third work video game music composition king knight follows basic storyline many nes-era role-playing video games displayed princess claire olthea kidnapped kingdom izander player must choose one four heroes knight/warrior ray jack wizard kaliva monster/gigant barusa kid thief toby train set forth attack gargatua castle defeat evil dragon tolfida rescue princess king knight vertically scrolling shooter main objective dodge destroy onscreen enemies obstacles various items however add depth game character player collect various power-ups increase character level maximum twenty levels per character many seven jump increases seven speed increases three weapon increases three shield increases also life ups collected increase character life meter also life downs avoided onscreen icons affect stage hidden cave entrances/exits secret revealer reveals hidden stones block progress finally four types elements collected level vital completion last stage elements simply elements b c d. stage various power-ups element type cave caves given level always house least one element type mention various powerups vital player finds caves always hidden generally found middle stage caves also statues shoot fireballs end cave dragon fight dragon defeated player exit cave continue level differences present famicom msx versions king knight japanese north american versions well japanese famicom version american nes version king knight differed little title screen disparity title screen reflected copyright publisher msx version king knight differed famicom version variety ways opening modified prior intro screen players could specify type controller would like use either keyboard joystick in-game dynamics similar although differences exist msx version flanks screen closed stage maps moved slightly items appear original locations finally msx version may seem easier characters sustain damage attacks developers also took advantage technological capabilities available msx upgrade msx port featured sound channels famicom many music tracks sound effects altered improved msx version also boasts wider range colors updated graphics new monster boss designs dragons end caves example replaced lizard-like monsters new sidebar displayed player life meter allocated power-ups allocated elements msx could smoothly render vertical scrolling – unlike famicom – movement graphics choppy comparison changes similar changes took place square final fantasy ported msx2 september 18 2016 square enix announced remake titled king knight wrath dark dragon ios android produced daisuke motohashi developed flame hearts developed mobile spin-off associated final fantasy xv game borrows original version scrolling action role-playing game style adds new camera perspective orchestral version former chiptune soundtrack game free-to-play four-player multiplayer mode square enix announced game september 2016 tokyo game show promotional material placed game final fantasy xv universe alongside justice monsters five another mobile companion game series square enix announced earlier 2016 king knight wrath dark dragon planned release android ios platforms japan 2016 announcement north american release game release postponed 2017 released worldwide september 13 2017 end service subsequently announced game take place june 26 2018 less year worldwide release king knight one video games adapted manga titled published gamest comics collection april 1999 drawn kouta hirano king knight given 3/10 ign 3/10 well nintendo life | [
10931,
5436,
9006
] | Test |
5,423 | 4 | CESG_Listed_Adviser_Scheme:cesg listed adviser scheme cesg listed adviser scheme programme run cesg provide pool information assurance consultants government departments public-sector bodies uk clas consultants advised systems handle protectively marked information including secret instance may advised gsi accreditation clas consultants held security clearance least sc clas consultants developed risk assessments line is1 risk management accreditation document sets rmads line is2 2011 entry clas closed replacement system designed 2013 'new clas implemented open membership 'new clas required members cesg certified professionals clas closed january 2016 cesg certified professional ccp scheme recognises expertise working information assurance cyber security arenas government industry sets standard ia professionals working sector provides rigorous independent assessment competence ia professionals ccp status endorsement ia expertise confirms information risk support business managed balanced pragmatic way clas closed ccp cesg-approved credential applies individual professionals rather companies | [
7979,
691,
11172,
4595
] | None |
5,424 | 4 | Mollom:mollom mollom web service analyzed quality content posted websites included comments contact-form messages blogs forum posts mollom screened contributions posted participating websites mollom originally developed dries buytaert also founder lead developer drupal cms used three specific technologies detect spam malicious content machine learning text analytics captcha according acquia mollom launch march 2008 acquisition acquia august 2012 mollom blocked one billion spam messages customers including sony music stanford university twitter mollom acquired acquia august 2012 april 27 2017 company announced would stop sale mollom service may 1 2017 service shut completely april 2 2018 blocked 13.5 billion spam comments since inception | [
519
] | Test |
5,425 | 2 | IBMDOS.COM:ibmdos.com ibmdos.com filename dos kernel loaded initially invoked dos bios ibmbio.com boot process contains hardware-independent parts operating system including embedded fat12 fat16 newer versions fat32 file system code well code provide dos api applications file exists pc dos 1.0 7.10 dr dos 5.0 higher except dr-dos 7.06 ms-dos using msdos.sys version 1.10 6.22 purpose dr dos 3.31 3.41 used equivalent drbdos.sys file instead compatibility purposes dos applications ibmdos.com file name briefly also used ibm version os/2 1.0 resembled os2dos.com os/2 kernel file used microsoft default file located root directory bootable drive/partition normally c hidden read-only system file attributes set ibmdos.com binary image containing executable code rather true com-style program hidden attribute set keep file accidentally invoked command prompt would lead crash necessary dr-dos 7.02 higher systems file fat binary also containing tiny com-style stub displaying version info exiting gracefully loaded inappropriately digital research terminology kernel component operating system called bdos basic disk operating system term originally coined gary kildall 1975 cp/m continued used dri operating systems except concurrent dos 286 flexos microsoft used name well referring kernel msx-dos operating system fat file system specific code called fdos dri terminology | [
9762,
4548,
5220,
5158,
6148,
6921,
8301,
9166,
7983,
178,
3314,
9972,
4409,
954,
2811
] | None |
5,426 | 4 | Karen_Todner:karen todner karen elizabeth todner born april 1962 nuneaton england british solicitor clients include hacker ryan cleary linked lulzsec gary mckinnon known pentagon hacker lauri love todner qualified solicitor 1987 20s became founding member kaim todner llp law firm london kaim todner solicitors formed 1990 specialising criminal law particular expertise extradition beginning march 2016 todner practise acquired one legal alternative business structure originally set 2013 came shortly todner announced intention close practice due legal aid cuts since acquisition one legal todner firm kaim todner continued operating name part one legal alternative business structure todner commented delighted secured way firm continue working present format umbrella one legal karen left kaim todner one legal september 2017 found www.karentodner.com todner appeared number extradition cases early case successful defence gary mckinnon set new legal precedent british law mckinnon legal team applied judicial review home secretary rejection medical evidence stated could easily tried uk unnecessary cruel inhumane inflict stress removing homeland family medical support network starting winter 2013 todner started representing lauri love british student arrested suspicion hacking us military computers love accused committing cyber attacks part hacktivist campaign 2012 2013 protest death aaron swartz computer programmer committed suicide facing 35 years us prison charges computer misuse september 2016 decision made extradite love us todner said confident appeal 100 mps showed support love campaign extradition order overturned health grounds october 2016 announced mp barry sheerman chair parliamentary commission autism write president obama asking throw extradition request leaves office january 2017 wednesday 12 october 2016 house commons prime ministers questions david burrowes mp raised case lauri love issues difficulties faced various forms autism come contact justice system others including national autistic society liberty courage foundation showed support love appeal 24 october 105 cross-party backbenchers signed letter president obama raising deep concern safety lauri love pointing long history serious mental health issues depression episodes psychosis november 2016 home secretary amber rudd backed decision extradite love america todner stated fears driven suicide extradited lodging appeal home office decision letter home office opposing love extradition risk suicide wrote we.. urge recognise seriousness mr love mental illness withdraw request extradition permit prosecution proceed england mr love would able stand trial bail support close family medical support network love said home secretary refused send us trial called home secretary decision extradite ‘ aberration justice ’ legal team kaim todner solicitors pointed uk citizen accused hacking extradited us todner also stated home secretary refused extradite love uk–us extradition treaty 2003 unfair repealed 25 april 2017 high court accepted love appeal extradition lodged todner behalf hearing date yet set however todner commented reason permission granted high court acknowledge grounds raised issues great importance delighted news lauri continue everything ensure prevention extradition united states america starting 2012 todner represented david mcintyre queen lancashire regiment soldier war veteran served afghanistan bosnia northern ireland iraq mclntyre accused overcharging us peace group security contract running firm employed team 20 provide security american clients including iraqi ambassador us overcharging us government security services baghdad iraq mcintyre left army 2002 set security company called quantum risk eight counts fraud mcintyre charged relate claims overcharged us peace group security contract running quantum risk december 2008 july 2009 mcintyre business closed 2009 followed enrolment royal military police served afghanistan july 2012 mcintyre arrested uniform operational setting afghanistan flown country 45 minutes later appeared westminster magistrates court london 36 hours later mcintyre faced eight counts fraud concerning contract united states institute peace usip alleged overcharged organisation 100,000 us dollars £65,000 us extradition request approved home secretary theresa may mcintyre appealed submitting report british army consultant psychiatrist confirming suffered ptsd todner commented firm consider detail secretary state conclusion see whether seek judicial review decision | [
9240,
5385,
11659
] | Test |
5,427 | 4 | Ekoparty:ekoparty ekoparty annual computer security conference brings together variety people interested information security briefings take place regularly buenos aires argentina ekoparty founded 2001 juan pablo daniel borgna leonardo pigner federico kirschbaum jerónimo basaldúa francisco amato addition talks ekoparty different activities like workshops wargames wardriving lockpicking challenges forensics challenges | [
2275,
9319,
7222,
7449,
3707,
5373,
2558
] | Test |
5,428 | 9 | TACPOL_(programming_language):tacpol programming language tacpol tactical procedure oriented language block structured programming language developed united states army tacfire tactical fire direction command control application tacpol similar pl/i unlike pl/i tacpol keywords—called particles —are reserved words used identifiers roughly 100 reserved words tacpol identifiers length longer eight characters first five concatenated last three characters actually used tacpol supports fixed-point binary numeric data fixed-length character strings 512 bytes fixed-length bit strings 32 bits support floating point numeric data pointers arrays may three dimensions dynamic bounds permitted additional types records called groups limited single level nesting tables arrays groups unions called cells control structures include if-then-else iteration case statements procedures may value parameters quantity parameters – reference without type-checking parameterless procedure label parameters tacpol compiler ran generated code an/gyk-12 militarized version litton industries l-3050 32-bit minicomputer | [
8262,
1611,
428,
721,
6102,
8502
] | None |
5,429 | 9 | Pvts:pvts pilo visual tools scheme pvts basic interpreter implementation visualization tools scheme programming language developed rollins college written java pvts contains interpreter also known read-eval-print loop well three visualization modules global environment viewer function call viewer data structure viewer pvts free software licensed gnu general public license gpl available online pvts limited interpreter capabilities cover r5rs standard scheme language standard purpose software display graphically scheme code aid students learning language | [
10083,
8262,
5612,
5677,
7983
] | None |
5,430 | 2 | Linux_Assigned_Names_and_Numbers_Authority:linux assigned names numbers authority linux assigned names numbers authority lanana central registry names numbers used within linux created 2000 h. peter anvin 2013 along filesystem hierarchy standard matters moved linux standard base operates linux foundation auspices per russ herrold linux device list created 1992 rick miller maintained 1993 1995 adopted h. peter anvin 2000 created lanana maintain list similar lists future name registry playful reference iana central registry names numbers used internet 2002 lanana became official workgroup free standards group | [
7938,
7812,
8326,
4360,
4493,
2195,
11155,
1813,
10780,
1694,
3618,
4011,
9646,
8631,
823,
9660,
10817,
5067,
8147,
1761,
4841
] | None |
5,431 | 2 | Android_Automotive:android automotive android automotive variation google android operating system tailored use vehicle dashboards introduced march 2017 platform developed google intel together car manufacturers volvo audi project aims provide operating system codebase vehicle manufacturers develop version operating system besides infotainment tasks messaging navigation music playback operating system aims handle vehicle-specific functions controlling air conditioning contrarily android auto android automotive full operating system running vehicle device relying external device operate operating system first announced google march 2017 february 2018 polestar volvo ’ brand electric performance cars announced polestar 2 first car built-in android automotive expected release 2020 april 2019 google opened apis developers start developing applications android automotive | [
4096,
5637,
8719,
3600,
7700,
9244,
11294,
1578,
10284,
5677,
3633,
1083,
6212,
69,
8262,
4683,
4685,
11343,
3664,
8280,
8285,
2658,
8821,
11391,
1670,
7816,
5262,
6800,
11408,
10393,
8858,
7835,
673,
7841,
8870,
1191,
1203,
7359,
196,
32... | None |
5,432 | 2 | VDSO:vdso vdso virtual dynamic shared object kernel mechanism exporting carefully selected set kernel space routines user space applications applications call kernel space routines in-process without incurring performance penalty context switch inherent calling kernel space routines means system call interface vdso developed offer vsyscall features overcoming limitations small amount statically allocated memory allows 4 system calls addresses abi process compromises security security issue mitigated emulating virtual system call emulation introduces additional latency vdso uses standard mechanisms linking loading i.e standard executable linkable format elf format vdso memory area allocated user space exposes kernel functionalities vdso dynamically allocated offers improved safety memory space randomization supports 4 system calls vdso links provided via glibc library kernel vdso support traditional syscall made vdso helps reduce calling overhead simple kernel routines also work way select best system-call method computer architectures ia-32 advantage methods exported routines provide proper dwarf debug attributed record format debugging information implementation generally implies hooks dynamic linker find vdsos | [
10016,
9921,
642,
5380,
8966,
6664,
5492,
823
] | Test |
5,433 | 4 | Authentication:authentication authentication authentikos real genuine αὐθέντης authentes author act proving assertion identity computer system user contrast identification act indicating person thing identity authentication process verifying identity might involve validating personal identity documents verifying authenticity website digital certificate determining age artifact carbon dating ensuring product document counterfeit authentication relevant multiple fields art antiques anthropology common problem verifying given artifact produced certain person certain place period history computer science verifying user identity often required allow access confidential data systems authentication considered three types first type authentication accepting proof identity given credible person first-hand evidence identity genuine authentication required art physical objects proof could friend family member colleague attesting item provenance perhaps witnessed item creator possession autographed sports memorabilia could involve someone attesting witnessed object signed vendor selling branded items implies authenticity may evidence every step supply chain authenticated centralized authority-based trust relationships back secure internet communication known public certificate authorities decentralized peer-based trust also known web trust used personal services email files pretty good privacy gnu privacy guard trust established known individuals signing cryptographic key key signing parties instance second type authentication comparing attributes object known objects origin example art expert might look similarities style painting check location form signature compare object old photograph archaeologist hand might use carbon dating verify age artifact chemical spectroscopic analysis materials used compare style construction decoration artifacts similar origin physics sound light comparison known physical environment used examine authenticity audio recordings photographs videos documents verified created ink paper readily available time item implied creation attribute comparison may vulnerable forgery general relies facts creating forgery indistinguishable genuine artifact requires expert knowledge mistakes easily made amount effort required considerably greater amount profit gained forgery art antiques certificates great importance authenticating object interest value certificates however also forged authentication poses problem instance son han van meegeren well-known art-forger forged work father provided certificate provenance well see article jacques van meegeren criminal civil penalties fraud forgery counterfeiting reduce incentive falsification depending risk getting caught currency financial instruments commonly use second type authentication method bills coins cheques incorporate hard-to-duplicate physical features fine printing engraving distinctive feel watermarks holographic imagery easy trained receivers verify third type authentication relies documentation external affirmations criminal courts rules evidence often require establishing chain custody evidence presented accomplished written evidence log testimony police detectives forensics staff handled antiques accompanied certificates attesting authenticity signed sports memorabilia usually accompanied certificate authenticity external records problems forgery perjury also vulnerable separated artifact lost computer science user given access secure systems based user credentials imply authenticity network administrator give user password provide user key card access device allow system access case authenticity implied guaranteed consumer goods pharmaceuticals perfume fashion clothing use three forms authentication prevent counterfeit goods taking advantage popular brand reputation damaging brand owner sales reputation mentioned item sale reputable store implicitly attests genuine first type authentication second type authentication might involve comparing quality craftsmanship item expensive handbag genuine articles third type authentication could presence trademark item legally protected marking identifying feature aids consumers identification genuine brand-name goods software companies taken great steps protect counterfeiters including adding holograms security rings security threads color shifting ink ways someone may authenticated fall three categories based known factors authentication something user knows something user something user authentication factor covers range elements used authenticate verify person identity prior granted access approving transaction request signing document work product granting authority others establishing chain authority security research determined positive authentication elements least two preferably three factors verified three factors classes elements factor weakest level authentication single component one three categories factors used authenticate individual ’ identity use one factor offer much protection misuse malicious intrusion type authentication recommended financial personally relevant transactions warrant higher level security multi-factor authentication involves two authentication factors something know something something two-factor authentication special case multi-factor authentication involving exactly two factors example using bankcard something user along pin something user knows provides two-factor authentication business networks may require users provide password knowledge factor pseudorandom number security token ownership factor access very-high-security system might require mantrap screening height weight facial fingerprint checks several inherence factor elements plus pin day code knowledge factor elements still two-factor authentication frequent types authentication available use authenticating online users differ level security provided combining factors one three categories factors authentication u.s. government national information assurance glossary defines strong authentication layered authentication approach relying two authenticators establish identity originator receiver information european central bank ecb defined strong authentication procedure based two three authentication factors factors used must mutually independent least one factor must non-reusable non-replicable except case inherence factor must also incapable stolen internet european well us-american understanding strong authentication similar multi-factor authentication 2fa exceeding rigorous requirements fast identity online fido alliance striving establish technical specifications strong authentication conventional computer systems authenticate users initial log-in session cause critical security flaw resolve problem systems need continuous user authentication methods continuously monitor authenticate users based biometric trait study used behavioural biometrics based writing styles continuous authentication method recent research shown possibility using smartphones ’ sensors accessories extract behavioral attributes touch dynamics keystroke dynamics gait recognition attributes known behavioral biometrics could used verify identify users implicitly continuously smartphones authentication systems built based behavioral biometric traits known active continuous authentication systems term digital authentication also known electronic authentication refers group processes confidence user identities established presented via electronic methods information system also referred e-authentication digital authentication process creates technical challenges need authenticate individuals entities remotely network american national institute standards technology nist created generic model digital authentication describes processes used accomplish secure authentication authentication information pose special problems electronic communication vulnerability man-in-the-middle attacks whereby third party taps communication stream poses two communicating parties order intercept information extra identity factors required authenticate party identity counterfeit products often offered consumers authentic counterfeit consumer goods electronics music apparel counterfeit medications sold legitimate efforts control supply chain educate consumers help ensure authentic products sold used even security printing packages labels nameplates however subject counterfeiting secure key storage device used authentication consumer electronics network authentication license management supply chain management etc generally device authenticated needs sort wireless wired digital connection either host system network nonetheless component authenticated need electronic nature authentication chip mechanically attached read connector host e.g authenticated ink tank use printer products services secure coprocessors applied offer solution much difficult counterfeit options time easily verified packaging labeling engineered help reduce risks counterfeit consumer goods theft resale products package constructions difficult copy pilfer-indicating seals counterfeit goods unauthorized sales diversion material substitution tampering reduced anti-counterfeiting technologies packages may include authentication seals use security printing help indicate package contents counterfeit subject counterfeiting packages also include anti-theft devices dye-packs rfid tags electronic article surveillance tags activated detected devices exit points require specialized tools deactivate anti-counterfeiting technologies used packaging include literary forgery involve imitating style famous author original manuscript typewritten text recording available medium packaging – anything box e-mail headers help prove disprove authenticity document however text audio video copied new media possibly leaving informational content use authentication various systems invented allow authors provide means readers reliably authenticate given message originated relayed involve authentication factors like opposite problem detection plagiarism information different author passed person work common technique proving plagiarism discovery another copy similar text different attribution cases excessively high quality style mismatch may raise suspicion plagiarism literacy authentication readers ’ process questioning veracity aspect literature verifying questions via research fundamental question authentication literature – one believe related authentication project therefore reading writing activity students documents relevant research process builds students critical literacy documentation materials literature go beyond narrative texts likely include informational texts primary sources multimedia process typically involves internet hands-on library research authenticating historical fiction particular readers consider extent major historical events well culture portrayed e.g. language clothing food gender roles believable period historically fingerprints used authoritative method authentication court cases us elsewhere raised fundamental doubts fingerprint reliability outside legal system well fingerprints shown easily spoofable british telecom top computer-security official noting fingerprint readers already tricked one spoof another hybrid two-tiered authentication methods offer compelling solution private keys encrypted fingerprint inside usb device computer data context cryptographic methods developed see digital signature challenge-response authentication currently spoofable originator key compromised originator anyone attacker knows n't know compromise irrelevant known whether cryptographically based authentication methods provably secure since unanticipated mathematical developments may make vulnerable attack future occur may call question much authentication past particular digitally signed contract may questioned new attack cryptography underlying signature discovered process authorization distinct authentication whereas authentication process verifying say authorization process verifying permitted trying mean authorization presupposes authentication anonymous agent could authorized limited action set one familiar use authentication authorization access control computer system supposed used authorized must attempt detect exclude unauthorized access therefore usually controlled insisting authentication procedure establish degree confidence identity user granting privileges established identity | [
2050,
5636,
7,
519,
8202,
8203,
6159,
9744,
9745,
531,
8211,
1557,
7192,
2080,
9248,
10274,
2083,
2084,
10790,
2087,
6184,
1069,
7729,
10801,
2099,
1588,
4663,
5178,
6204,
3133,
9791,
10815,
4163,
2118,
6220,
10831,
5200,
1618,
4691,
1032... | Validation |
5,434 | 4 | CDP_Spoofing:cdp spoofing computer networking cdp spoofing technique employed compromise operation network devices use cisco discovery protocol cdp discovering neighboring devices cdp spoofing network security threat mitigated taking precautionary measures order prevent cisco discovery protocol cdp created computer networking company cisco originally developed 1994 original intent make easier find devices network cdp may used cisco routers switches network equipment advertise software version capabilities ip address two versions cdp cdpv1 cdpv2 cdpv1 original version involved finding basic information networking devices devices able receive information networking device directly connected cdpv2 predecessor first version extensive previous version includes utilities checking errors made configuring two devices e.g configuring mismatched native vlans cdp enabled globally default cisco routers switches servers protocol disabled globally however disabled interface encapsulation changed re-enabled interface protocol often used aid network administrators finding discovering devices easier devices discovered easier help certain network problems device arrangement network management networking tasks although beneficial features attackers accumulate information devices leaves device type ip address ios version exposed vulnerable attackers use information mimic devices steal information create various network problems recommended disable cdp entire device rather interfaces fully mitigate threat cdp spoofing attacks cdp suggest disabling cdp used device necessity device although cdp enabled default disabled re-enabled globally interfaces command syntaxhighlight config cdp run /syntaxhighlight disable globally syntaxhighlight config cdp run /syntaxhighlight enable certain interface syntaxhighlight config-if cdp enable /syntaxhighlight disable certain interface syntaxhighlight config-if cdp enable /syntaxhighlight table display whether device established connection another device devices syntaxhighlight device name show cdp neighbors /syntaxhighlight note command show names devices ports connecting devices model name/number features device show traffic passed cdp devices syntaxhighlight device name show cdp traffic /syntaxhighlight commands help mitigate detect cdp attacks cdp spoofing also help discover flaws within system e.g mismatched native vlans could inhibiting connection devices router running cdp receives cdp packet begins build table shows neighboring devices discovered devices discovered intermittently send packet updated information packet contains various information interface ’ device ’ types names packets sent cdp encrypted creating messages devices easily read plain-text cdp spoofing creation forged packets impersonate devices either real arbitrary attack type denial-of-service dos attack used flood connected devices using cdp attacker exploit functionality sending thousands spoofed cdp packets 01:00:0c cc cc cc fill neighbor tables devices network running cdp happens traffic network may dropped device resources necessary route device command line interface may also become unresponsive making difficult disable cdp ongoing attack administrators may disable cdp result make network secure cost able benefit cdp | [
2409,
6834,
3629,
11321
] | None |
5,435 | 4 | Login:login computer security logging logging signing signing process individual gains access computer system identifying authenticating user credentials typically form username matching password credentials sometimes referred login logon sign-in sign-on practice modern secure systems also often require second factor extra security access longer needed user log log sign sign logging usually used enter specific page trespassers see user logged login token may used track actions user taken connected site logging may performed explicitly user taking actions entering appropriate command clicking website link labeled also done implicitly user powering workstation closing web browser window leaving website refreshing webpage within defined period case websites use cookies track sessions user logs session-only cookies site usually deleted user computer addition server invalidates associations session making session-handle user cookie store useless feature comes handy user using public computer computer using public wireless connection security precaution one rely implicit means logging system especially public computer instead one explicitly log wait confirmation request taken place logging computer leaving common security practice preventing unauthorized users tampering also people choose password-protected screensaver set activate period inactivity requiring user re-enter login credentials unlock screensaver gain access system different methods logging may via image fingerprints eye scan password oral textual input etc terms became common time sharing systems 1960s bulletin board systems bbs 1970s early home computers personal computers generally require windows nt os/2 linux 1990s noun login comes verb log analogy verb clock computer systems keep log users access system term log comes chip log historically used record distance travelled sea recorded ship log log book sign connotes idea based analogy manually signing log visitors book agreed difference meaning three terms login logon sign different technical communities tend prefer one another – unix novell linux apple typically using login apple style guide saying users log file server log ... contrast microsoft style guides traditionally suggested opposite prescribed log logon past microsoft reserved sign accessing internet windows 8 onwards moved sign terminology local authentication | [
8197,
4750,
3343,
8976,
273,
25,
4505,
3867,
4893,
7965,
11680,
929,
3362,
5287,
7207,
4009,
3371,
1069,
2222,
1790,
2737,
10673,
11188,
3381,
6837,
823,
8504,
5433,
7994,
7739,
700,
1350,
4298,
7893,
1622,
87,
93,
10592,
3041,
8417,
45... | Train |
5,436 | 3 | Final_Fantasy_(video_game):final fantasy video game final fantasy fantasy role-playing video game developed published square 1987 first game square final fantasy series created hironobu sakaguchi originally released nes final fantasy remade several video game consoles frequently packaged final fantasy ii video game collections story follows four youths called light warriors carry one world four elemental orbs darkened four elemental fiends together quest defeat evil forces restore light orbs save world final fantasy originally conceived working title fighting fantasy trademark issues dire circumstances surrounding square well sakaguchi prompted name changed game great commercial success received generally positive reviews spawned many successful sequels supplementary titles form final fantasy series original regarded one influential successful role-playing games nintendo entertainment system playing major role popularizing genre critical praise focused game graphics criticism targeted time spent wandering search random battle encounters raise player experience level march 2003 versions final fantasy sold combined total two million copies worldwide final fantasy four basic game modes overworld map town dungeon maps battle screen menu screen overworld map scaled-down version game fictional world player uses direct characters various locations primary means travel across overworld foot ship canoe airship become available player progresses exception battles preset locations bosses enemies randomly encountered field maps overworld map traveling foot canoe ship must either fought fled game plot develops player progresses towns dungeons town citizens offer helpful information others shops sell items equipment dungeons appear areas include forests caves mountains swamps underwater caverns buildings dungeons often treasure chests containing rare items available stores game menu screen allows player keep track experience points levels choose equipment characters wield use items magic character basic attribute level range one fifty determined character amount experience gaining level increases character attributes maximum hit points hp represents character remaining health character dies reach zero hp characters gain experience points winning battles combat final fantasy menu-based player selects action list options attack magic item battles turn-based continue either side flees defeated player party wins character gain experience gil flees returned map screen every character party dies game unsaved progress lost final fantasy first game show player characters right side screen enemies left side screen opposed first-person view player begins game choosing four characters form party locked choice duration game character occupation character class different attributes abilities either innate acquired six classes fighter thief black belt red mage white mage black mage later game player option character undergo class upgrade whereby sprite portraits mature classes gain ability use weapons magic previously could use game contains variety weapons armor items bought found make characters powerful combat character eight inventory slots four hold weapons four hold armor character class restrictions weapons armor may use weapons armor magical used combat cast spells magical artifacts provide protection certain spells shops characters buy items help recover traveling items available include potions heal characters remove ailments like poison petrification tents cabins used world map heal player optionally save game houses also recovers party magic saving special items may gained quests magic common ability game several character classes use spells divided two groups white defensive healing black debilitating destructive magic bought white black magic shops assigned characters whose occupation allows use spells classified level one eight four white four black spells per level character may learn three spells per level white black mages potentially learn respective spells red mages ninja knight use high-level magic final fantasy takes place fantasy world three large continents elemental powers world determined state four crystals governing one four classical elements earth fire water wind world final fantasy inhabited numerous races including humans elves dwarves mermaids dragons robots non-human races one town game although individuals sometimes found human towns areas well four hundred years prior start game lefeinish people used power wind craft airships giant space station called floating castle game watched country decline wind crystal went dark two hundred years later violent storms sank massive shrine served center ocean-based civilization water crystal went dark earth crystal fire crystal followed plaguing earth raging wildfires devastating agricultural town melmond plains vegetation decayed time later sage lukahn tells prophecy four light warriors come save world time darkness game begins appearance four youthful light warriors heroes story carry one darkened orbs initially light warriors access kingdom coneria ruined temple fiends warriors rescue princess sara evil knight garland king coneria builds bridge enables light warriors passage east town pravoka light warriors liberate town bikke band pirates acquire pirates ship use warriors embark chain delivery quests shores aldi sea first retrieve stolen crown marsh cave king ruined castle turns dark elf astos defeating gains crystal eye return blind witch matoya exchange herb needed awaken elf prince cursed astos elf prince gives light warriors mystic key capable unlocking door key unlocks storage room coneria castle holds tnt nerrick one dwarves cave dwarf/dwarf village destroys small isthmus using tnt connecting aldi sea outside world visiting near-ruined town melmond light warriors go earth cave defeat vampire retrieve star ruby gains passage sage sadda cave sadda rod warriors venture deeper earth cave destroy earth fiend lich light warriors obtain canoe enter gurgu volcano defeat fire fiend kary levistone nearby ice cave allows raise airship reach northern continents prove courage retrieving rat tail castle ordeal king dragons bahamut promotes light warrior kind gesture repaid fairy receiving special liquid produces oxygen warriors use help defeat water fiend kraken sunken shrine also recover slab allows linguist named dr. unne teach lefeinish language lefeinish give light warriors access floating castle tiamat wind fiend taken four fiends defeated orbs restored portal opens temple fiends takes 2000 years past warriors discover four fiends sent garland archdemon chaos back time sent fiends future creating time loop could live forever light warriors defeat chaos thus ending paradox return home ending paradox however light warriors changed future one heroic deeds remain unknown outside legend hironobu sakaguchi intended make role-playing game rpg long time employer square refused give permission expected low sales product however rpg dragon quest released proved hit japan company reconsidered stance genre approved sakaguchi vision rpg inspired three colleagues volunteered join project headed thought rough boss spite unsuccessful creations eventually final fantasy developed team seven core staff members within square referred a-team sakaguchi convinced fellow game designers koichi ishii akitoshi kawazu join project kawazu mainly responsible battle system sequences based heavily tabletop game dungeons dragons rpg wizardry example enemies weaknesses elements fire ice included japanese rpgs point kawazu grown fond aspects western rpgs decided incorporate final fantasy also advocated player option freely choose party member classes beginning game feels fun rpg begins create character scenario written freelance writer kenji terada based story sakaguchi ishii heavily influenced game setting idea crystals also suggested illustrator yoshitaka amano character designer sakaguchi declined first never heard artist name sakaguchi showed ishii drawings magazine clippings told art style looking ishii revealed actually created amano hence leading involvement game music final fantasy composed nobuo uematsu marked 16th video game music composition iranian-american programmer nasir gebelli hired code game initially tried understand aspects gameplay soon advised sakaguchi program design concepts explain everything gebelli detail gebelli also responsible creating considered first rpg minigame sliding puzzle added game despite part original game design among developers graphic designer kazuko shibuya programmers kiyoshi yoshii ken narita well debugger hiroyuki ito project started show promise designer hiromichi tanaka b-team joined aid development lack faith sakaguchi team well unpopularity within company motivated staff members give best sakaguchi took in-development rom game japanese magazine famicom tsushin would review however famitsu gave game extensive coverage initially 200,000 copies shipped sakaguchi pleaded company make 400,000 help spawn sequel management agreed original nes version successfully shipped 520,000 copies japan following successful north american localization dragon quest nintendo america translated final fantasy english published north america 1990 north american version final fantasy met modest success partly due nintendo then-aggressive marketing tactics version game marketed pal region final fantasy origins 2003 years several theories emerged game called final fantasy 2015 sakaguchi stated beginning team wished name could shortened way game title could abbreviated latin script pronounced four syllables japanese language original working title sakaguchi rpg concept fighting fantasy changed avoid issues tabletop game name already released reason choosing word final form eventual title final fantasy explained twofold uematsu one thing stemmed sakaguchi personal situation would quit game industry gone back university game sold well another square threat bankruptcy time meant game could company last although sakaguchi confirmed theories later downplayed rationale choosing word final saying definitely back-to-the-wall type situation back word starts f would fine final fantasy remade several times different platforms frequently packaged final fantasy ii various collections remakes retain basic story battle mechanics various changes made different areas including graphics sound specific game elements final fantasy first re-released msx2 system published microcabin japan june 1989 access almost three times much storage space famicom version suffered problems present nintendo cartridge media including noticeable loading times also minor graphical upgrades much-improved music tracks sound effects 1994 final fantasy i・ii compilation final fantasy final fantasy ii launched famicom version released japan graphical updates wonderswan color remake released japan december 9 2000 featured many new graphical changes 8-bit graphics original famicom game updated battle scenes incorporated full background images character enemy sprites redrawn look like ones super famicom final fantasy games japan final fantasy final fantasy ii re-released separately combined game playstation collection released japan 2002 final fantasy ii premium package europe north america 2003 final fantasy origins version similar wonderswan color remake featured several changes detailed graphics remixed soundtrack added full motion video sequences art galleries yoshitaka amano illustrations memo save function december 18 2012 port re-released part final fantasy 25th anniversary ultimate box release final fantasy ii dawn souls like final fantasy origins port first two games series released game boy advance 2004 dawn souls version incorporates various new elements including four additional dungeons updated bestiary minor changes square enix released version final fantasy two japanese mobile phone networks 2004 version ntt docomo foma 900i series launched march title final fantasy subsequent release cdma 1x win-compatible phones launched august another titular version released softbank yahoo keitai phones july 3 2006 games refined graphics compared original 8-bit game advanced many later console handheld ports square enix planned release version north american mobile phones 2006 delayed 2010 released collaboration namco retains game difficulty mp system original famicom version elements updated graphics spell names monster names bosses items areas borrowed game boy advance wonderswan color versions including additional areas monsters present gba version game data saved original famicom version using tent sleeping bag cottage going inn however three save game slots temporary save option available game 20th anniversary final fantasy square enix remade final fantasy final fantasy ii playstation portable games released japan north america 2007 european territories 2008 psp version features higher-resolution 2d graphics full motion video sequences remixed soundtrack new dungeon well bonus dungeons dawn souls script dawn souls version aside new dungeon square enix released original nes version game wii virtual console service japan may 26 2009 north america october 5 2009 pal region import may 7 2010 february 25 2010 square enix released ios version final fantasy based psp port touch controls worldwide june 13 2012 square enix released windows phone version based ios version july 27 2012 square enix released android port largely based ios version though lacking new dungeons 20th-anniversary edition november 11 2016 game alongside 29 games included nes classic edition nintendo classic mini nintendo entertainment system released nintendo final fantasy well received critics commercially successful original nes version shipped 520,000 copies japan according square publicity department japanese famicom msx releases sold combined 600,000 copies north american nes release sold 700,000 copies march 31 2003 game including re-releases remakes time shipped 1.99 million copies worldwide 1.21 million copies shipped japan 780,000 abroad november 19 2007 another playstation portable version shipped 140,000 copies editors ign ranked final fantasy 11th best game nes calling game class system diverse praising convenient use vehicles means traveling across world map gamesradar ranked eighth best nes game ever made staff felt dragon warrior introduced gamers genre final fantasy popularized 2004 readers retro gamer voted final fantasy 93rd top retro game staff noting despite poor visuals relatively simple quest many still consider original best exception ffvii 2006 final fantasy appeared japanese magazine famitsu top 100 games list readers voted 63rd best game time gamefaqs users made similar list 2005 ranked final fantasy 76th rated 49th best game made nintendo system nintendo power top 200 games list 2008 nintendo power ranked 19th best nintendo entertainment system video game praising setting basics console role-playing games along dragon warrior citing examples epic stories leveling random battles character classes final fantasy one influential early console role-playing games played major role legitimizing popularizing genre according ign matt casamassina final fantasy storyline deeper engaging story original dragon quest known dragon warrior north america modern critics pointed game poorly paced contemporary standards involves much time wandering search random battle encounters raise experience levels money exploring solving puzzles reviewers find level-building exploration portions game amusing ones 1987 famitsu initially described original final fantasy one many imitated dragon quest formula game considered weakest difficult installment series subsequent versions final fantasy garnered mostly favorable reviews media peer schneider ign enjoyed wonderswan color version praising graphical improvements especially environments characters monsters famitsu scored version 30 40 final fantasy origins generally well-received gamepro said music fantastic graphics suitably retro cuteness reviews generally positive jeremy dunham ign giving particular praise improved english translation saying better previous version game playstation portable version critically successful previous releases gamespot kevin vanord cited visuals strongest enhancement stated additional random enemy encounters updated graphics add much value dawn souls package rated 76th nintendo power top 200 games list soundtrack album released together score final fantasy ii 1989 game tracks became mainstays final fantasy series prelude arpeggio played title screen opening theme played party crosses bridge early game later referred final fantasy theme victory fanfare played every victorious battle opening motif battle theme also reused number times series theme song plays player characters first cross bridge coneria become recurring theme music series featured numbered final fantasy titles final fantasy also basis series finale video game-themed cartoon series entitled fractured fantasy captain n 8-bit theater sprite-based webcomic created brian clevinger parodies game become popular gaming community since started march 2001 elements video game also appeared series fighting games dissidia final fantasy dissidia 012 final fantasy dissidia final fantasy nt warrior light based yoshitaka amano design lead character garland respective hero villain representing final fantasy warrior light voiced toshihiko seki japanese version grant george english version garland voiced kenji utsumi dissidia final fantasy 012 dissidia final fantasy kōji ishii dissidia final fantasy nt japanese versions christopher sabat english versions games add background information world final fantasy instance dissidia 012 final fantasy names world final fantasy world order distinguish world b world dissidia characters music final fantasy also appeared theatrhythm final fantasy series | [
5762,
9673,
5260,
5422,
7023,
9006,
4530,
10931,
7166,
8735
] | Test |
5,437 | 5 | Address_Resolution_Protocol:address resolution protocol address resolution protocol arp communication protocol used discovering link layer address mac address associated given internet layer address typically ipv4 address mapping critical function internet protocol suite arp defined 1982 internet standard std 37 arp implemented many combinations network data link layer technologies ipv4 chaosnet decnet xerox parc universal packet pup using ieee 802 standards fddi x.25 frame relay asynchronous transfer mode atm ipv4 ieee 802.3 ieee 802.11 common usage internet protocol version 6 ipv6 networks functionality arp provided neighbor discovery protocol ndp address resolution protocol request-response protocol whose messages encapsulated link layer protocol communicated within boundaries single network never routed across internetworking nodes property places arp link layer internet protocol suite address resolution protocol uses simple message format containing one address resolution request response size arp message depends link layer network layer address sizes message header specifies types network use layer well size addresses message header completed operation code request 1 reply 2 payload packet consists four addresses hardware protocol address sender receiver hosts principal packet structure arp packets shown following table illustrates case ipv4 networks running ethernet scenario packet 48-bit fields sender hardware address sha target hardware address tha 32-bit fields corresponding sender target protocol addresses spa tpa arp packet size case 28 bytes arp protocol parameter values standardized maintained internet assigned numbers authority iana ethertype arp 0x0806 appears ethernet frame header payload arp packet confused ptype appears within encapsulated arp packet two computers office computer 1 computer 2 connected local area network ethernet cables network switches intervening gateways routers computer 1 packet send computer 2 dns determines computer 2 ip address 192.168.0.55 send message also requires computer 2 mac address first computer 1 uses cached arp table look 192.168.0.55 existing records computer 2 mac address 00 eb:24 b2:05 ac mac address found sends ethernet frame destination address 00 eb:24 b2:05 ac containing ip packet onto link cache produce result 192.168.0.55 computer 1 send broadcast arp request message destination ff ff ff ff ff ff mac address accepted computers local network requesting answer 192.168.0.55 computer 2 responds arp response message containing mac ip addresses part fielding request computer 2 may insert entry computer 1 arp table future use computer 1 receives caches response information arp table send packet arp probe arp request constructed all-zero sender ip address spa term used ipv4 address conflict detection specification beginning use ipv4 address whether received manual configuration dhcp means host implementing specification must test see address already use broadcasting arp probe packets arp may also used simple announcement protocol useful updating hosts mappings hardware address sender ip address mac address changed announcement also called gratuitous arp message usually broadcast arp request containing sender protocol address spa target field tpa=spa target hardware address tha set zero alternative way broadcast arp reply sender hardware protocol addresses sha spa duplicated target fields tpa=spa tha=sha gratuitous arp request message gratuitous arp reply messages standards-based methods arp request preferred devices may configured use either two types garp arp announcement intended solicit reply instead updates cached entries arp tables hosts receive packet operation code may indicate request reply arp standard specifies opcode processed arp table updated address fields many operating systems perform gratuitous arp startup helps resolve problems would otherwise occur example network card recently changed changing ip-address-to-mac-address mapping hosts still old mapping arp caches gratuitous arp also used interface drivers provide load balancing incoming traffic team network cards used announce different mac address within team receive incoming packets arp announcements used defend link-local ip addresses zeroconf protocol ip address takeover within high-availability clusters arp mediation refers process resolving layer 2 addresses virtual private wire service vpws different resolution protocols used connected circuits e.g. ethernet one end frame relay ipv4 provider edge pe device discovers ip address locally attached customer edge ce device distributes ip address corresponding remote pe device pe device responds local arp requests using ip address remote ce device hardware address local pe device ipv6 pe device discovers ip address local remote ce devices intercepts local neighbor discovery nd inverse neighbor discovery ind packets forwards remote pe device inverse address resolution protocol inverse arp inarp used obtain network layer addresses example ip addresses nodes data link layer layer 2 addresses primarily used frame relay dlci atm networks layer 2 addresses virtual circuits sometimes obtained layer 2 signaling corresponding layer 3 addresses must available virtual circuits used since arp translates layer 3 addresses layer 2 addresses inarp may described inverse addition inarp implemented protocol extension arp uses packet format arp different operation codes reverse address resolution protocol reverse arp rarp like inarp translates layer 2 addresses layer 3 addresses however inarp requesting station queries layer 3 address another node whereas rarp used obtain layer 3 address requesting station address configuration purposes rarp obsolete replaced bootp later superseded dynamic host configuration protocol dhcp arp provide methods authenticating arp replies network arp replies come systems one required layer 2 address arp proxy system answers arp request behalf another system forward traffic normally part network design dialup internet service contrast arp spoofing answering system spoofer replies request another system address aim intercepting data bound system malicious user may use arp spoofing perform man-in-the-middle denial-of-service attack users network various software exists detect perform arp spoofing attacks though arp provide methods protection attacks ipv6 uses neighbor discovery protocol extensions secure neighbor discovery rather arp computers also maintain lists known addresses rather using active protocol model computer maintains database mapping layer 3 addresses e.g. ip addresses layer 2 addresses e.g. ethernet mac addresses data maintained primarily interpreting arp packets local network link thus often called arp cache traditionally methods also used maintain mapping addresses static configuration files centrally maintained lists since least 1980s networked computers utility called 'arp interrogating manipulating table embedded systems networked cameras networked power distribution devices lack user interface use so-called arp stuffing make initial network connection although misnomer arp involved solution issue network management consumer devices specifically allocation ip addresses ethernet devices solution adopted follows devices typically method disable process device operating normally vulnerable attack | [
10242,
1030,
2568,
6674,
8211,
6681,
6682,
8729,
4638,
10271,
6689,
9251,
2085,
7208,
7214,
8238,
562,
1586,
9780,
9269,
11321,
3133,
5181,
6723,
11332,
6214,
71,
8265,
4174,
4687,
10329,
10332,
9824,
10341,
10344,
1647,
3695,
9839,
4723,
... | Test |
5,438 | 7 | Bootstrapping_node:bootstrapping node bootstrapping node also known rendezvous host node overlay network provides initial configuration information newly joining nodes may successfully join overlay network bootstrapping nodes predominantly found decentralized peer-to-peer p2p networks dynamically changing identities configurations member nodes networks attempting join p2p network specific discovery membership protocols configuration information may required newly joining node unaware protocols newly established joining node able communicate nodes ultimately join network furthermore protocols configuration requirements may dynamically change infrastructure membership p2p network evolves therefore need able dynamically inform newly joining node required protocols configurations several methods may used joining node identify bootstrapping nodes objective bootstrapping node provide newly joining nodes sufficient configuration information new node may successfully join network access resources shared content discovery protocol information instruct new node discover peers network membership protocol information instruct new node request-to-join subsequently join peer groups network configuration information overlay network dependent instructions may provided example overlay dependent instructions instructing new node obtain zone configuration information may designed p2p network admission control used joining network supports trust management include things encryption/signature protocols admission policies | [
8640,
2887,
10792,
3629,
1087
] | Validation |
5,439 | 5 | IEEE_802.2:ieee 802.2 ieee 802.2 original name iso/iec 8802-2 standard defines logical link control llc upper portion data link layer osi model original standard developed institute electrical electronics engineers ieee collaboration american national standards institute ansi adopted international organization standardization iso 1998 still remains integral part family ieee 802 standards local metropolitan networks llc software component provides uniform interface user data link service usually network layer llc may offer three types services conversely llc uses services media access control mac dependent specific transmission medium ethernet token ring fddi 802.11 etc. using llc compulsory ieee 802 networks exception ethernet also used fiber distributed data interface fddi part ieee 802 family ieee 802.2 sublayer adds control information message created upper layer passed llc transmission another node data link resulting packet generally referred llc protocol data unit pdu additional information added llc sublayer llc header llc header consist dsap destination service access point ssap source service access point control field two 8-bit fields dsap ssap allow multiplex various upper layer protocols llc however many protocols use subnetwork access protocol snap extension allows using ethertype values specify protocol transported atop ieee 802.2 also allows vendors define protocol value spaces 8 16 bit hdlc-style control field serves distinguish communication mode specify specific operation facilitate connection control flow control connection mode acknowledgements acknowledged connectionless mode ieee 802.2 provides two connectionless one connection-oriented operational modes use multicasts broadcasts reduce network traffic information needs propagated stations network however type 1 service provides guarantees regarding order received frames compared order sent sender even get acknowledgment frames received device conforming ieee 802.2 standard must support service type 1 network node assigned llc class according service types supports 802.2 llc pdu following format subnetwork access protocol snap extension used located start information field 802.2 header includes two eight-bit address fields called service access points sap collectively lsap osi terminology although lsap fields 8 bits long low-order bit reserved special purposes leaving 128 values available purposes low-order bit dsap indicates whether contains individual group address low-order bit ssap indicates whether packet command response packet remaining 7 bits ssap specify lsap always individual address packet transmitted lsap numbers globally assigned ieee uniquely identify well established international standards protocols families protocols assigned one saps may operate directly top 802.2 llc protocols may use subnetwork access protocol snap ieee 802.2 indicated hexadecimal value 0xaa 0xab source response ssap dsap snap extension allows using ethertype values private protocol id spaces ieee 802 networks used datagram connection-oriented network services ethernet ieee 802.3 networks exception ieee 802.3x-1997 standard explicitly allowed using ethernet ii framing 16-bit field mac addresses carry length frame followed ieee 802.2 llc header ethertype value followed upper layer data framing datagram services supported data link layer although ipv4 assigned lsap value 6 0x6 arp assigned lsap value 152 0x98 ipv4 almost never directly encapsulated 802.2 llc frames without snap headers instead internet standard rfc 1042 usually used encapsulating ipv4 traffic 802.2 llc frames snap headers fddi ieee 802 networks ethernet ethernet networks typically use ethernet ii framing ethertype 0x800 ip 0x806 arp ipx protocol used novell netware networks supports additional ethernet frame type 802.3 raw ultimately supporting four frame types ethernet 802.3 raw 802.2 llc 802.2 snap ethernet ii two frame types fddi non-ethernet ieee 802 networks 802.2 llc 802.2 snap possible use diverse framings single network possible even upper layer protocol case nodes using unlike framings directly communicate following destination source sap fields control field ieee 802.2 conceptually derived hdlc three types pdus carry data most-often used unacknowledged connectionless mode u-format used identified value '11 lower two bits single-byte control field | [
8708,
7045,
9860,
3847,
7049,
2827,
2701,
1297,
5118,
5270,
2206,
5671,
6187,
4396,
434,
3762,
4918,
3383,
7865,
11321,
5437,
4543,
4546,
3780,
11332,
1997,
5071,
2904,
10332,
5469,
5472,
1893,
4581,
5863,
5875,
11125,
6904,
3323,
8828,
3... | Test |
5,440 | 4 | InterWorking_Labs:interworking labs interworking labs privately owned company scotts valley california business optimizing application performance applications embedded systems founded 1993 chris wellens marshall rose first company formed specifically test network protocol compliance products tests allow computer devices many different companies communicate networks interworking labs products diagnose replicate re-mediate application performance problems company first product silvercreek tests simple network management protocol snmp agent implementation switch server phone hundreds thousands individual tests including conformance stress robustness negative testing tests detect diagnose implementation errors private standard mibs well snmpv1 v2c v3 stacks implementations maxwell family products emulate real world networks problems delays rerouting corruption impaired packets protocols domain name system delays limited bandwidth new impairments added maxwell using c c++ python extensions controlled via graphical command line script interfaces supports set protocol impairments tcp/ip dhcp icmp tls sip testing maxwell products named maxwell demon thought experiment 19th century physicist james clerk maxwell maxwell ’ demon demonstrated second law thermodynamics—which says entropy increases—is true average thought experiment maxwell imagined double chamber uniform mixture hot cold gas molecules demon intelligent sits two chambers operating trap door every time cold low-energy molecule comes demon opens door lets molecule side eventually cold gas molecules one side chamber hot ones although molecules continue move randomly introduction intelligence system reduces entropy instead increasing maxwell product sits middle network conversation opens closes figurative door basis specific criteria maxwell intelligently modifies packet based pre-selected criteria sends packet way interworking labs advised internet engineering task force ietf maxwell network emulations reproduce real conditions lab products deployed interworking labs co-founded 1993 chris wellens marshall rose two met 1992 interop company mountain view california wellens director technology rose interop program committee also working group chair ietf simple network management protocol snmp wellens—who overseeing trade fair 5000-node interopnet well array interoperability demonstrations network protocols— noticed engineers different companies often interpreted network protocols differently ended struggling make products send receive data one another—sometimes minutes showcase demonstrations engineers asked interop create interoperability lab network communication issues could worked private less stressful environment interop founder ceo dan lynch concluded industry needed interoperability testing lab lynch asked wellens write business plan permanent interoperability lab rose proposed lab first task create try set tests snmp protocol since snmp area familiar one engineers particular problems interop wellens volunteered organize group developers interoperability test summit rose would create set tests assist developing initial plan time however ziff-davis acquired interop chose proceed interoperability lab wellens lynch agreed pursue idea 1993 wellens established interworking labs january 1994 organized first snmp interoperability test summit using 50 snmp tests written rose first test summit large number implementations failed rose tests.. results persuaded several major corporations interoperability testing would critical component functioning networks participants second 1994 snmp test summit included cabletron systems cisco systems eicon technology empirical tools technologies epilogue technology corp. fujitisu ossi ibm ibm research network general corp. peer networks snmp research synoptics communications tgv inc. wellfleet communications 2000 wellens asked karl auerbach join interworking labs board directors 2002 wellens hired auerbach part cisco advanced internet architecture group serve chief technology officer interworking labs advisory board consisted several members ietf expertise networking protocols andy bierman jeff case dave perkins randy presuhn steve waldbusser wireless networks used hospitals police military turned computer networks essential lifeline utilities computer networks keep economies transportation energy food supplies flowing commonly belong critical infrastructure region performance networks adverse conditions significant concern militaries industry local regional governments according wellens ucita significantly protected software publishers liability failure products software publishers may become increasingly liable consequences network failures—especially comprehensive networking testing existed used online retailers example demonstrate multimillion-dollar losses due network problems security flaws network collapse denial service attack video links | [
2887,
8554,
2045,
6834,
5402,
3323,
3133,
10271
] | Test |
5,441 | 1 | Two-phase_locking:two-phase locking databases transaction processing two-phase locking 2pl concurrency control method guarantees serializability also name resulting set database transaction schedules histories protocol utilizes locks applied transaction data may block interpreted signals stop transactions accessing data transaction life 2pl protocol locks applied removed two phases two types locks utilized basic protocol shared exclusive locks refinements basic protocol may utilize lock types using locks block processes 2pl may subject deadlocks result mutual blocking two transactions lock system object associated shared resource data item elementary type row database page memory database lock database object data-access lock may need acquired transaction accessing object correct use locks prevents undesired incorrect inconsistent operations shared resources concurrent transactions database object existing lock acquired one transaction needs accessed another transaction existing lock object type intended access checked system existing lock type allow specific attempted concurrent access type transaction attempting access blocked according predefined agreement/scheme practice lock object directly block transaction operation upon object rather blocks transaction acquiring another lock object needed held/owned transaction performing operation thus locking mechanism needed operation blocking controlled proper lock blocking scheme indicates lock type blocks lock type two major types locks utilized common interactions lock types defined blocking behavior follows several variations refinements major lock types exist respective variations blocking behavior first lock blocks another lock two locks called incompatible otherwise locks compatible often lock types blocking interactions presented technical literature lock compatibility table following example common major lock types according two-phase locking protocol transaction handles locks two distinct consecutive phases transaction execution two phase locking rule summarized never acquire lock lock released serializability property guaranteed schedule transactions obey rule typically without explicit knowledge transaction end phase 1 safely determined transaction completed processing requested commit case locks released phase 2 difference 2pl c2pl c2pl transactions obtain locks need transactions begin ensure transaction already holds locks block waiting locks conservative 2pl prevents deadlocks comply s2pl protocol transaction needs comply 2pl release write exclusive locks ended i.e. either committed aborted hand read shared locks released regularly phase 2 protocol appropriate b-trees causes bottleneck b-trees always starts searching parent root rigorousness rigorous scheduling rigorous two-phase locking comply strong strict two-phase locking ss2pl locking protocol releases write exclusive read shared locks applied transaction transaction ended i.e. completing executing ready becoming either committed aborted protocol also complies s2pl rules transaction obeying ss2pl viewed phase 1 lasts transaction entire execution duration phase 2 degenerate phase 2 thus one phase actually left two-phase name seems still utilized due historical development concept 2pl 2pl super-class ss2pl property schedule also called rigorousness also name class schedules property ss2pl schedule also called rigorous schedule term rigorousness free unnecessary legacy two-phase well independent locking mechanism principle blocking mechanisms utilized property respective locking mechanism sometimes referred rigorous 2pl ss2pl special case s2pl i.e. ss2pl class schedules proper subclass s2pl every ss2pl schedule also s2pl schedule s2pl schedules exist ss2pl ss2pl concurrency control protocol choice database systems utilized since early days 1970s proven effective mechanism many situations provides besides serializability also strictness special case cascadeless recoverability instrumental efficient database recovery also commitment ordering co participating distributed environments co based distributed serializability global serializability solutions employed subset co efficient implementation distributed ss2pl exists without distributed lock manager dlm distributed deadlocks see resolved automatically fact ss2pl employed multi database systems ensures global serializability known years discovery co co came understanding role atomic commitment protocol maintaining global serializability well observation automatic distributed deadlock resolution see detailed example distributed ss2pl matter fact ss2pl inheriting properties recoverability co significant subset 2pl general form besides comprising simple serializability mechanism however serializability also implied co known provide ss2pl significant qualities 2pl general form well combined strictness i.e. strict 2pl s2pl known utilized practice popular ss2pl require marking end phase 1 2pl s2pl thus simpler implement also unlike general 2pl ss2pl provides mentioned useful strictness commitment ordering properties many variants ss2pl exist utilize various lock types various semantics different situations including cases lock-type change transaction notable variants use multiple granularity locking comments two schedule classes define schedules respective properties common schedules either one contains strictly contains equal incomparable containment relationships among 2pl classes major schedule classes summarized following diagram 2pl subclasses inherently blocking means optimistic implementations exist whenever optimistic 2pl mentioned refers different mechanism class includes also schedules 2pl class locks block data-access operations mutual blocking transactions results deadlock execution transactions stalled completion reached thus deadlocks need resolved complete transactions executions release related computing resources deadlock reflection potential cycle precedence graph would occur without blocking deadlock resolved aborting transaction involved potential cycle breaking cycle often detected using wait-for graph graph conflicts blocked locks materialized conflicts materialized database due blocked operations reflected precedence graph affect serializability indicates transaction waiting lock release transaction cycle means deadlock aborting one transaction per cycle sufficient break cycle transaction aborted due deadlock resolution application decide next usually application restart transaction beginning may delay action give transactions sufficient time finish order avoid causing another deadlock distributed environment atomic commitment protocol typically two-phase commit 2pc protocol utilized atomicity recoverable data data transaction control partitioned among 2pc participants i.e. data object controlled single 2pc participant distributed global deadlocks deadlocks involving two participants 2pc resolved automatically follows ss2pl effectively utilized distributed environment global deadlocks due locking generate voting-deadlocks 2pc resolved automatically 2pc see commitment ordering co exact characterization voting-deadlocks global cycles reference except co articles known notice general case 2pl global deadlocks similarly resolved automatically synchronization point protocol phase-1 end distributed transaction synchronization point achieved voting notifying local phase-1 end propagated participants distributed transaction way decision point atomic commitment analogy decision point co conflicting operation 2pl happen phase-1 end synchronization point resulting voting-deadlock case global data-access deadlock voting-deadlock also locking based global deadlock automatically resolved protocol aborting transaction involved missing vote typically using timeout comment | [
2688,
9481,
10505,
10258,
7446,
10518,
4376,
9112,
5658,
7581,
7968,
290,
1314,
7461,
8742,
5550,
5808,
10418,
9527,
3768,
3004,
9661,
9663,
4416,
2369,
10048,
11457,
3398,
8518,
72,
2901,
9942,
9177,
987,
860,
9183,
11362,
10471,
8808,
9... | Test |
5,442 | 8 | Hit_(Internet):hit internet hit request web server file web page image javascript cascading style sheet may many hits per page view since html page contain multiple files images | [
225,
3462,
3688,
9768,
5935,
6576,
8914,
5150
] | None |
5,443 | 7 | M2Mi_Corporation:m2mi corporation machine-to-machine intelligence m2mi corp founded nasa research park moffett federal airfield provides authentic platform m2m internet things economy m2mi founded 2006 geoffrey barnard m2mi founding member oasis mqtt standards group geoffrey barnard served chair security sub-committee m2mi m2m intelligence® application provides m2m iot application globally connect manage secure perform in-stream analysis quickly monetize organization connected assets strong focus cybersecurity privacy m2mi also provides iot security suite professional edition™ designed securing industrial applications enforcing specific industry compliance allows organizations quickly generate deploy iot device code comply industry ’ regulations professional edition includes means device owners monitor devices health using intuitive dashboards alerts group commands insight analytics includes set optimized ciphers resource limited devices iot security suite professional edition™ designed handle security across devices iot gateways network infrastructures | [
4194,
4979
] | Test |
5,444 | 3 | Silvermont:silvermont silvermont microarchitecture low-power atom celeron pentium branded processors used systems chip socs made intel silvermont forms basis total four soc families silvermont announced news media may 6 2013 intel headquarters santa clara california intel repeatedly said first bay trail devices would available holiday 2013 timeframe leaked slides showed release window bay trail-t august 28 – september 13 2013 avoton rangeley announced available second half 2013 first merrifield devices announced 1h14 airmont 14 nm die shrink silvermont launched early 2015 first seen atom x7-z8700 used microsoft surface 3 airmont microarchitecture includes following soc families silvermont based cores also used modified knight landing iteration intel xeon phi hpc chips silvermont first atom processor feature out-of-order architecture intel revealed q4 2016 quarterly report quality issues c2000 product family effect financial performance company data center group quarter erratum named avr54 published intel state defect chip lpc clock affected systems may experience inability boot may cease operation workaround available requiring platform hardware changes soc failures thought led failures cisco synology products though discussion c2000 root cause failure reported non-disclosure agreement many vendors intel released new c0 stepping c2000 series april 2017 corrected bug july 2017 intel published similar quality issue affects also atom e3800 series embedded processors erratum named vli89 published intel state similar issue atom c2000 defect chip lpc clock affected systems may experience inability boot may cease operation issues extend also usb bus sd card circuitry happen certain conditions activity high several years april 2018 intel announced releasing new d1 stepping fix issue lpc usb sd card buses circuitry degradation issues also apply bay trail processors intel celeron j1900 n2800/n2900 series also pentium n3500 j2850 j2900 series celeron j1800 j1750 series based affected silicon cisco stated failures atom c2000 processors occur early 18 months use higher failure rates occurring 36 months mitigations found limit impact systems firmware update lpc bus called lpc_clkrun reduces utilization lpc interface turn decreases eliminates lpc bus degradation systems however compatible new firmware usb maximum 10 active time 50tb transmit traffic life expectancy lifetime port recommended use sd card boot device remove card system use 14nm airmont architecture processors also affected design flaws noted braswell specification update chp49 errata addition lpc sd card circuitry degradation issues 14nm designs also issues real time clock rtc circuitry degradation usb buses however affected unspecified firmware changes required mitigate rtc circuitry degradation intel plan release new stepping braswell intel admitted issue stating impact consumers depends use condition list desktop processors follows found bug blueprint c2000 cpus family may cause failure embedded ethernet ports list server processors follows list upcoming communications processors follows list embedded processors follows list mobile processors follows list tablet hybrid processors follows list smartphone processors follows list smartphone processors follows list desktop processors follows list mobile processors follows list smartphone tablet processors follows silvermont based processor cores used knights landing versions intel xeon phi multiprocessor hpc chips changes hpc including avx-512 vector units | [
3459,
5380,
2821,
3973,
8325,
9095,
5386,
9611,
4108,
9741,
398,
6926,
5649,
7313,
5523,
6804,
8851,
4886,
9111,
3352,
5883,
8231,
1832,
2088,
10669,
9391,
5681,
10675,
4276,
1461,
10548,
1083,
2237,
5309,
8125,
8126,
6339,
5444,
9541,
10... | Test |
5,445 | 1 | Multilingual_Multiscript_Plant_Name_Database:multilingual multiscript plant name database multilingual multiscript plant name database mmpnd multilingual database names taxa plants located university melbourne managed maintained michel h. porcher database includes names taxa 900 genera higher plants counting mushrooms addition scientific name synonyms contains names taxa 82 major languages website says includes 70 languages 40 languages dialects included mmpnd mentioned many taxa grin-global germplasm resources information network references porcher m. h. et al searchable world wide web multilingual multiscript plant name database mmpnd on-line resource pl names international plant names index ipni mentions multilingual multiscript plant name database searchable language script holds lot information including index medicinal plants regarding aims mmpnd following said ... intention cover many useful plants possible useful one part world however weed even noxious weed another political stand whether selection species declared useful people provided get minimum information handle data basically foresee 8 categories plants order decreasing importance consider vegetables cereals fruits mushrooms fungi herbs pasture fodder crops medicinal plants may termed utilitarian crops fibre oil crops stimulants etc feel last fifty years first 3 categories attracting far little attention taxonomists especially species level three groups edible plants include world staple foods related cultivars selections bred improved centuries basic ingredients world ethnic cuisines ... first objective focus useful plants cultivated ones database currently contains names plants economic importance well names savage plants genus last updating indicated multilingual names presented genera follows indexes plant names various languages en abutilon allium chinense amaranthus tricolor banana beetroot orange beta vulgaris black-eyed pea blood banana ... 95 citations ca 11 citations de ... 34 citations es ... 27 citations fr ... 28 citations | [] | Test |
5,446 | 4 | Illinois_Security_Lab:illinois security lab illinois security lab research laboratory university illinois urbana–champaign established 2004 support research education computer network security lab part computer science department information trust institute current research projects concern health information technology critical infrastructure protection past projects addressed messaging networking privacy lab performing work strategic healthcare advanced research projects security sharps project developing security privacy technologies help remove key barriers prevent use health information systems implementing electronic health records health information exchanges telemedicine networked control systems electric power grid use computers tasks like protecting substations overloads digital protective relays metering facilities advanced meters lab developed attested meter provide security privacy advanced meters worked security building automation systems substation automation advances networking distributed computing medical devices combining changes way health care financed growing number elderly people produce strong prospects widespread use assisted living health care approach benefit transferring medical information collected homes dedicated facilities clinicians data networks lab explored security engineering systems prototypes field trials formal methods based architecture uses partially trusted assisted living service provider alsp third party intermediary assisted persons clinicians scalable distributed systems demand ability express adapt diverse policies numerous distinct administrative domains lab introduced technologies messaging systems adaptive security policies based wsemail internet messaging implemented web service attribute-based messaging abm addressing based attributes recipients although significant progress formal analysis security integrity confidentiality relatively less progress treating denial-of-service attacks lab explored techniques based shared channel model envisions bandwidth limiting factor attacks focuses host-based counter-measures selective verification exploits adversary bandwidth limitations favor valid parties also developing new formal methods reasoning dynamic configuration vpns many new information technologies profound impact privacy threats provoked legislation calls deeper regulation lab developed ways treat privacy rules formally including better ways reason using formal methods conformance implications regulations quantify classify privacy attitudes control risks new technologies lab showed formally encode hipaa consent regulations using privacy apis analyzed model checking | [
10020,
2409,
6698,
939,
2558
] | Validation |
5,447 | 9 | Craig_Chambers:craig chambers craig chambers computer scientist google since 2007 prior professor department computer science engineering university washington received b.s degree computer science mit 1986 ph.d. computer science stanford 1992 best known influential research language self introduced prototypes alternative classes code-splitting compilation technique generates separate code paths fast general cases speed execution dynamically-typed programs | [] | Test |
5,448 | 3 | Motorola_G5_project:motorola g5 project motorola g5 project unsuccessful attempt around 2000-2001 create 64-bit powerpc processor successor motorola powerpc 7400 series roadmaps era designated powerpc 7500 suggested motorola working g5 chip said chip failed early stages mass production thus could widely made usable chip apple began producing 64-bit systems g5 brand used ibm powerpc 970 also known powerpc g5 | [
8102,
336,
3472,
3323,
8700
] | None |
5,449 | 8 | Semantic_web_service:semantic web service semantic web service like conventional web services server end client–server system machine-to-machine interaction via world wide web semantic services component semantic web use markup makes data machine-readable detailed sophisticated way compared human-readable html usually easily understood computer programs mainstream xml standards interoperation web services specify syntactic interoperability semantic meaning messages example web services description language wsdl specify operations available web service structure data sent received specify semantic meaning data semantic constraints data requires programmers reach specific agreements interaction web services makes automatic web service composition difficult semantic web services built around universal standards interchange semantic data makes easy programmers combine data different sources services without losing meaning web services activated behind scenes web browser makes request web server uses various web services construct sophisticated reply would able semantic web services also used automatic programs run without connection web browser semantic-web-services platform uses owl web ontology language allow data service providers semantically describe resources using third-party ontologies sswap simple semantic web architecture protocol sswap establishes lightweight protocol owl classes predicates see sswap protocol concept canonical graph enable providers logically describe service service essentially transformation possibly null input subject possibly null output object services semantically discoverable based subsumption hierarchies well input output data types sadi semantic automated discovery integration semantic-web-service initiative consists set design-practices semantic-web-service publishing minimizes use non-standard protocols message structures sadi services natively consume data rdf resource description framework format input output data must instances owl individuals input output classes defined owl-dl unlike canonical web services sadi services use soap messaging protocol unlike sswap sadi services project-specific messaging scaffold services invoked passing rdf instance data service endpoint http post multiplexing achieved sending one owl individual http post invocation sadi imposes single constraint behavior service uri output individual must uri corresponding input individual practice results services create semantic linkages input output service thus chaining sadi services together workflow results uninterrupted linked data graph choreography concerned describing external visible behavior services set message exchanges optionally following message exchange pattern mep functionality consumer point view orchestration deals describing number services two cooperate communicate aim achieving common goal | [
8929,
10020,
6629,
8070,
1481,
3052,
9871,
11674,
10452,
2901,
53,
119,
3000,
10486,
10938,
4797,
479
] | None |
5,450 | 9 | SPSS:spss spss statistics software package used interactive batched statistical analysis long produced spss inc. acquired ibm 2009 current versions 2015 named ibm spss statistics software name originally stood statistical package social sciences spss reflecting original market although software popular fields well including health sciences marketing research hub published full-length freely accessible spss video tutorial playlist spss widely used program statistical analysis social science also used market researchers health researchers survey companies government education researchers marketing organizations data miners others original spss manual nie bent hull 1970 described one sociology influential books allowing ordinary researchers statistical analysis addition statistical analysis data management case selection file reshaping creating derived data data documentation metadata dictionary stored datafile features base software statistics included base software many features spss statistics accessible via pull-down menus programmed proprietary 4gl command syntax language command syntax programming benefits reproducible output simplifying repetitive tasks handling complex data manipulations analyses additionally complex applications programmed syntax accessible menu structure pull-down menu interface also generates command syntax displayed output although default settings changed make syntax visible user also pasted syntax file using paste button present menu programs run interactively unattended using supplied production job facility additionally macro language used write command language subroutines python programmability extension access information data dictionary data dynamically build command syntax programs python programmability extension introduced spss 14 replaced less functional sax basic scripts purposes although saxbasic remains available addition python extension allows spss run statistics free software package r. version 14 onwards spss driven externally python vb.net program using supplied plug-ins version 20 onwards two scripting facilities well many scripts included installation media normally installed default spss statistics places constraints internal file structure data types data processing matching files together considerably simplify programming spss datasets two-dimensional table structure rows typically represent cases individuals households columns represent measurements age sex household income two data types defined numeric text string data processing occurs sequentially case-by-case file dataset files matched one-to-one one-to-many many-to-many addition cases-by-variables structure processing separate matrix session one process data matrices using matrix linear algebra operations graphical user interface two views toggled clicking one two tabs bottom left spss statistics window 'data view shows spreadsheet view cases rows variables columns unlike spreadsheets data cells contain numbers text formulas stored cells 'variable view displays metadata dictionary row represents variable shows variable name variable label value label print width measurement type variety characteristics cells views manually edited defining file structure allowing data entry without using command syntax may sufficient small datasets larger datasets statistical surveys often created data entry software entered computer-assisted personal interviewing scanning using optical character recognition optical mark recognition software direct capture online questionnaires datasets read spss spss statistics read write data ascii text files including hierarchical files statistics packages spreadsheets databases spss statistics read write external relational database tables via odbc sql statistical output proprietary file format *.spv file supporting pivot tables addition in-package viewer stand-alone reader downloaded proprietary output exported text microsoft word pdf excel formats alternatively output captured data using oms command text tab-delimited text pdf xls html xml spss dataset variety graphic image formats jpeg png bmp emf several variants spss statistics exist spss statistics gradpacks highly discounted versions sold students spss statistics server version spss statistics client/server architecture add-on packages enhance base software additional features examples include complex samples adjust clustered stratified samples custom tables create publication-ready tables spss statistics available either annual monthly subscription license spss statistics launched version 25 aug 08 2017 spss v25 adds new advanced statistics random effects solution results genlinmixed robust standard errors glm/unianova profile plots error bars within advanced statistics custom tables add-on v25 also includes new bayesian statistics capabilities method statistical inference publication ready charts powerful new charting capabilities including new default templates ability share microsoft office applications software released first version 1968 statistical package social sciences spss developed norman h. nie dale h. bent c. hadlai hull principals incorporated spss inc. 1975 early versions spss statistics written fortran designed batch processing mainframes including example ibm icl versions originally using punched cards data program input processing run read command file spss commands either raw input file fixed format data single record type 'getfile data saved previous run save precious computer time 'edit run could done check command syntax without analysing data version 10 spss-x 1983 data files could contain multiple record types prior spss 16.0 different versions spss available windows mac os x unix spss statistics version 13.0 mac os x compatible intel-based macintosh computers due rosetta emulation software causing errors calculations spss statistics 15.0 windows needed downloadable hotfix installed order compatible windows vista version 16.0 version runs windows mac linux graphical user interface written java mac os version provided universal binary making fully compatible powerpc intel-based mac hardware spss inc announced july 28 2009 acquired ibm us 1.2 billion dispute ownership name spss 2009 2010 product referred pasw predictive analytics software january 2010 became spss ibm company complete transfer business ibm done october 1 2010 date spss ibm company ceased exist ibm spss fully integrated ibm corporation one brands ibm software group business analytics portfolio together ibm algorithmics ibm cognos ibm openpages companion software ibm spss family used data mining text analytics ibm spss modeler realtime credit scoring services ibm spss collaboration deployment services spss data collection spss dimensions sold 2015 unicom systems inc. division unicom global merged integrated software suite unicom intelligence survey design survey deployment data collection data management reporting ida interactive data analysis software package originated formerly national opinion research center norc university chicago initially offered hp-2000 somewhat later ownership spss also available dec decsystem-20 scss software product intended online use ibm mainframes although c conversational also represented distinction regarding data stored used column-oriented rather row-oriented internal database gave good interactive response time spss conversational statistical system scss whose strong point spss cross-tabulation | [
10757,
5129,
7945,
3980,
2317,
5006,
6157,
6797,
7950,
1042,
4630,
2457,
7580,
7326,
4255,
8606,
9633,
3493,
9893,
6311,
6952,
5677,
2222,
7983,
10413,
7217,
6962,
8627,
5172,
9397,
823,
696,
10040,
3771,
8509,
6718,
6850,
5830,
5703,
480... | Test |
5,451 | 2 | Warmux:warmux warmux free open-source video game turn-based artillery game genre started wormux 2002 game renamed warmux november 2010 avoid potential trademark conflicts game multiplatform many desktop computer mobile platforms available several players play together typically one using team game played online every player uses version game 2 modes private mode one must provide opponents one address port public mode index server publish game online games available since 0.8beta1 supertuxkart teams styled mascots various free software projects gnu linux freebsd kde gimp openoffice.org firefox thunderbird suse workrave nufw spip bugzilla 0.9.0 cpu player selected single player gameplay allowing compete computer-driven teams feature first appeared 0.7.9 hidden due limited abilities project started december 2002 lawrence azzoug moy wormux game developed source code data free software distributed terms gnu general public license originally developed based clanlib library project later switched sdl due cross-platform sdl middle-layer game ported many oses platforms windows unix-like systems including linux freebsd android amigaos 4 aros maemo symbian^3 mac os x november 2010 old name nowiki /nowiki wormux nowiki /nowiki dropped favor nowiki /nowiki warmux nowiki /nowiki name nowiki /nowiki wormux nowiki /nowiki originally homage old classic worms games among popular artillery game genre developers decided renaming project order avoid possible confusion latest version 11.04.1 released 30th april 2011 community fell apart game development abandoned around 2012 domain name lost acquired cyber squatters project transferred gna.org repository could restart development warmux project went gna shutdown may 2017 critiques game generally positive raiden realm praised game similarity original worms games saying anyone ever loved played famous worms pc game series wormux game well noting even n't much fan ... 'll find wormux none less captivating enjoyable fosswire declared wormux makes formidable clone original series absolutely love wormux right minifrag.com said wormux loaded turn-based cartoon combat goodness netbook gamer wormux everything going also included linuxlinks listing 42 best free linux games well holding four five star rating linux game tome wormux selected september 2008 hotpick linux format game became quite popular packaged several linux distributions different versions game downloaded via gna 2009 march 2016 least 123,000 times | [
10790,
5612,
6797,
3791,
10480,
2769,
6993,
5397,
823,
11418
] | None |
5,452 | 2 | Distributed_operating_system:distributed operating system distributed operating system software collection independent networked communicating physically separate computational nodes handle jobs serviced multiple cpus individual node holds specific software subset global aggregate operating system subset composite two distinct service provisioners first ubiquitous minimal kernel microkernel directly controls node hardware second higher-level collection system management components coordinate node individual collaborative activities components abstract microkernel functions support user applications microkernel management components collection work together support system goal integrating multiple resources processing functionality efficient stable system seamless integration individual nodes global system referred transparency single system image describing illusion provided users global system appearance single computational entity distributed os provides essential services functionality required os adds attributes particular configurations allow support additional requirements increased scale availability user distributed os works manner similar single-node monolithic operating system although consists multiple nodes appears users applications single-node separating minimal system-level functionality additional user-level modular services provides separation mechanism policy mechanism policy simply interpreted something done versus something done respectively separation increases flexibility scalability locale typically node kernel provides minimally complete set node-level utilities necessary operating node underlying hardware resources mechanisms include allocation management disposition node resources processes communication input/output management support functions within kernel communications sub-system foremost importance distributed os distributed os kernel often supports minimal set functions including low-level address space management thread management inter-process communication ipc kernel design referred microkernel modular nature enhances reliability security essential features distributed os common kernel identically replicated nodes system therefore nodes system use similar hardware combination minimal design ubiquitous node coverage enhances global system extensibility ability dynamically introduce new nodes services system management components software processes define node policies components part os outside kernel components provide higher-level communication process resource management reliability performance security components match functions single-entity system adding transparency required distributed environment distributed nature os requires additional services support node responsibilities global system addition system management components accept defensive responsibilities reliability availability persistence responsibilities conflict consistent approach balanced perspective deep understanding overall system assist identifying diminishing returns separation policy mechanism mitigates conflicts architecture design distributed operating system must realize individual node global system goals architecture design must approached manner consistent separating policy mechanism distributed operating system attempts provide efficient reliable distributed computing framework allowing absolute minimal user awareness underlying command control efforts multi-level collaboration kernel system management components turn distinct nodes distributed operating system functional challenge distributed operating system point system must maintain perfect harmony purpose simultaneously maintain complete disconnect intent implementation challenge distributed operating system opportunity produce foundation framework reliable efficient available robust extensible scalable system however opportunity comes high cost complexity distributed operating system exceptional degree inherent complexity could easily render entire system anathema user logical price realizing distributed operation system must calculated terms overcoming vast amounts complexity many areas many levels calculation includes depth breadth range design investment architectural planning required achieving even modest implementation design development considerations critical unforgiving instance deep understanding distributed operating system overall architectural design detail required exceptionally early point exhausting array design considerations inherent development distributed operating system design considerations potentially affect many others significant degree leads massive effort balanced approach terms individual design considerations many permutations aid effort rely documented experience research distributed computing power research experimentation efforts began earnest 1970s continued 1990s focused interest peaking late 1980s number distributed operating systems introduced period however implementations achieved even modest commercial success fundamental pioneering implementations primitive distributed operating system component concepts date early 1950s individual steps focused directly distributed computing time many may realized important impact pioneering efforts laid important groundwork inspired continued research areas related distributed computing mid-1970s research produced important advances distributed computing breakthroughs provided solid stable foundation efforts continued 1990s accelerating proliferation multi-processor multi-core processor systems research led resurgence distributed os concept one first efforts dyseac general-purpose synchronous computer one earliest publications association computing machinery april 1954 researcher national bureau standards national institute standards technology nist presented detailed specification dyseac introduction focused upon requirements intended applications including flexible communications also mentioned computers specification discussed architecture multi-computer systems preferring peer-to-peer rather master-slave one earliest examples computer distributed control dept army reports certified reliable passed acceptance tests april 1954 completed delivered time may 1954 portable computer housed tractor-trailer 2 attendant vehicles 6 tons refrigeration capacity described experimental input-output system lincoln tx-2 emphasized flexible simultaneously operational input-output devices i.e. multiprogramming design tx-2 modular supporting high degree modification expansion system employed multiple-sequence program technique technique allowed multiple program counters associate one 32 possible sequences program code explicitly prioritized sequences could interleaved executed concurrently affecting computation process also control flow sequences switching devices well much discussion related device sequencing similar dyseac tx-2 separately programmed devices operate simultaneously increasing throughput full power central unit available device tx-2 another example system exhibiting distributed control central unit dedicated control one early effort abstracting memory access intercommunicating cells cell composed collection memory elements memory element basically binary electronic flip-flop relay within cell two types elements symbol cell cell structure stores data string symbols consisting name set parameters information linked cell associations theory contended addressing wasteful non-valuable level indirection information accessed two ways direct cross-retrieval direct retrieval accepts name returns parameter set cross-retrieval projects parameter sets returns set names containing given subset parameters similar modified hash table data structure allowed multiple values parameters key name configuration ideal distributed systems constant-time projection memory storing retrieval inherently atomic exclusive cellular memory intrinsic distributed characteristics would invaluable impact user hardware/device application programming interfaces indirect authors considering distributed systems stating algorithms scalable synchronization shared-memory multiprocessors measurements distributed file system memory coherence shared virtual memory systems transactions transactional memory composable memory transactions transactional memory architectural support lock-free data structures software transactional memory dynamic-sized data structures software transactional memory oceanstore architecture global-scale persistent storage weighted voting replicated data sanity checks byzantine generals problem fail-stop processors approach designing fault-tolerant computing systems recoverability distributed snapshots determining global states distributed systems optimistic recovery distributed systems better illustrate point examine three system architectures centralized decentralized distributed examination consider three structural aspects organization connection control organization describes system physical arrangement characteristics connection covers communication pathways among nodes control manages operation earlier two considerations centralized system one level structure constituent elements directly depend upon single control element decentralized system hierarchical bottom level unites subsets system entities entity subsets turn combine higher levels ultimately culminating central master element distributed system collection autonomous elements concept levels centralized systems connect constituents directly central master entity hub spoke fashion decentralized system aka network system incorporates direct indirect paths constituent elements central entity typically configured hierarchy one shortest path two elements finally distributed operating system requires pattern direct indirect connections possible two elements consider 1970s phenomena “ string art ” spirograph drawing fully connected system spider web interstate highway system u.s. cities examples partially connected system centralized decentralized systems directed flows connection central entity distributed systems communicate along arbitrary paths pivotal notion third consideration control involves allocating tasks data system elements balancing efficiency responsiveness complexity centralized decentralized systems offer control potentially easing administration limiting options distributed systems difficult explicitly control scale better horizontally offer fewer points system-wide failure associations conform needs imposed design organizational chaos transparency single-system image refers ability application treat system operates without regard whether distributed without regard hardware implementation details many areas system benefit transparency including access location performance naming migration consideration transparency directly affects decision making every aspect design distributed operating system transparency impose certain requirements and/or restrictions design considerations systems optionally violate transparency varying degrees meet specific application requirements example distributed operating system may present hard drive one computer c drive another computer g user require knowledge device drivers drive location devices work way application perspective less transparent interface might require application know computer hosts drive transparency domains inter-process communication ipc implementation general communication process interaction dataflow threads and/or processes within node nodes distributed os intra-node inter-node communication requirements drive low-level ipc design typical approach implementing communication functions support transparency sense interprocess communication greatest underlying concept low-level design considerations distributed operating system process management provides policies mechanisms effective efficient sharing resources distributed processes policies mechanisms support operations involving allocation de-allocation processes ports processors well mechanisms run suspend migrate halt resume process execution resources operations either local remote respect distributed os maintains state synchronization processes system example load balancing common process management function load balancing monitors node performance responsible shifting activity across nodes system balance one load balancing function picking process move kernel may employ several selection mechanisms including priority-based choice mechanism chooses process based policy 'newest request system implements policy systems resources memory files devices etc distributed throughout system given moment nodes may light idle workloads load sharing load balancing require many policy-oriented decisions ranging finding idle cpus move move many algorithms exist aid decisions however calls second level decision making policy choosing algorithm best suited scenario conditions surrounding scenario distributed os provide necessary resources services achieve high levels reliability ability prevent and/or recover errors faults physical logical defects cause errors system system reliable must somehow overcome adverse effects faults primary methods dealing faults include fault avoidance fault tolerance fault detection recovery fault avoidance covers proactive measures taken minimize occurrence faults proactive measures form transactions replication backups fault tolerance ability system continue operation presence fault event system detect recover full functionality event actions taken make every effort preserve single system image availability fraction time system respond requests many benchmark metrics quantify performance throughput response time job completions per unit time system utilization etc respect distributed os performance often distills balance process parallelism ipc managing task granularity parallelism sensible relation messages required support extremely effective also identifying beneficial migrate process data rather copy data effective well cooperating concurrent processes inherent need synchronization ensures changes happen correct predictable fashion three basic situations define scope need improper synchronization lead multiple failure modes including loss atomicity consistency isolation durability deadlock livelock loss serializability flexibility distributed operating system enhanced modular characteristics distributed os providing richer set higher-level services completeness quality kernel/microkernel simplifies implementation services potentially enables service providers greater choice providers services architectural design e1 distributed operating system cronus distributed operating system design development minix distributed operating system | [
9224,
9739,
6675,
7187,
10776,
25,
1049,
5658,
4637,
9762,
5158,
7217,
9784,
10809,
576,
2120,
10333,
97,
8298,
7285,
118,
9335,
2168,
1147,
3197,
1150,
2179,
10883,
6797,
3729,
9366,
6296,
7325,
9887,
3248,
6837,
8388,
8901,
9932,
5840,
... | None |
5,453 | 4 | Cruise_ship_ID_card:cruise ship id card cruise ship id card plastic card size credit card serves several functions passengers cruise ship cruise ship id cards scanned entrances ship various points throughout ship either via magnetic strip rfid readers bar code order identify passenger allow entry exit ship allow entry certain areas ship including passenger cabin bill purchases passenger various functions information printed ship card may include rare picture passenger displayed card frequently scanned presence computer display picture passenger screen functions ship card may include | [] | Validation |
5,454 | 2 | Media_Transfer_Protocol:media transfer protocol media transfer protocol mtp extension picture transfer protocol ptp communications protocol allows media files transferred atomically portable devices whereas ptp designed downloading photographs digital cameras media transfer protocol allows transfer music files digital audio players media files portable media players well personal information personal digital assistants mtp key part wmdrm10-pd digital rights management drm service windows media platform mtp part windows media framework thus closely related windows media player versions microsoft windows operating system windows xp sp2 support mtp windows xp requires windows media player 10 higher later windows versions built-in support microsoft also made available mtp porting kit older versions windows back windows 98 usb implementers forum device working group standardised mtp full-fledged universal serial bus usb device class may 2008 since mtp official extension ptp shares class code main purpose protocol allow transfer media files associated metadata portable devices one transfer function time support operations open edit modify workaround copy hosting system operations copy back protocol originally implemented use across usb extended use across tcp/ip bluetooth windows vista supports mtp tcp/ip windows 7 windows vista platform update windows vista also support mtp bluetooth host connecting mtp device called mtp initiator whereas device mtp responder main reason using mtp rather example usb mass-storage device class msc latter operates granularity mass storage device block usually practice fat block rather logical file level words usb mass storage class designed give host computer undifferentiated access bulk mass storage compact flash rather file system might safely shared target device except specific files host might modifying/accessing practice therefore usb host computer mounted msc partition assumes absolute control storage may safely modified device without risk data corruption host computer severed connection furthermore host computer full control connected storage device risk host computer may corrupt file system reformat file system supported usb device otherwise modify way usb device completely understand mtp ptp specifically overcome issue making unit managed storage local file rather entire possibly large unit mass storage block level way mtp works like transactional file system either entire file written/read nothing storage media affected failed transfers device maintains database/index content disk mtp saves cost re-scanning entire disk every time content modified additionally mtp allows mtp initiators identify specific capabilities device respect file formats functionality particular mtp initiators may provide passwords information unlock files otherwise enable digital rights management nothing specific nature core standard features available via vendor extensions mtpz zune extension mtp specifically denies access files authentication processed possible using windows media player 10 higher mtp advantages marked “ ” disadvantages marked “ ” exposing filesystem metadata index integrity full control device unless operating system exposes mtp devices virtual file systems occur natively windows thus mtp devices assigned drive letters mtp-unaware software able make use devices limiting user mtp-specific programs one specific concern antivirus software host computer may aware mtp devices making potentially less secure mass storage devices although files mtp devices copied moved host use mtp-unaware antivirus software chance scan antivirus scanning might also impractical due blocking regular use device despite identifiability ptp/mtp usb device class libmtp documentation indicates vendor product id combination plays functional role identifying mtp device also windows drivers libmtp includes vast listings vendor product id numbers devices supports along workarounds bugs non-generic methodology hinders mtp drivers forward compatibility new devices mtp specification includes enumeration file formats called object format use enumeration communicating supported file formats formats transferred files apart uncategorized formats beginning list formats grouped categories image audio video document formats category one undefined format followed specific formats also super-generic undefined object format jolla cited lack webm support mtp one reason support video format mobile operating system sailfish os unclear limitation tools spec webm defined mtp 1.1 spec features used efficient alternatives whole-file transfers re-uploads mtp 1.1 spec according go-mtpfs mtp supported windows xp windows media player 10 later versions installed windows vista later mtp support built older versions windows specifically windows 2000 windows 98 windows microsoft released mtp porting kit contains mtp device driver manufacturers creative technology also provide legacy mtp drivers players usually consist mtp porting kit files customized inf file describing specific players mtp-compatible devices assigned drive letters instead appear devices applications windows explorer compared devices implement usb mass storage devices accessed programmatically scripts normal windows programs depend drive letters instead files must manipulated using windows explorer applications specially written mtp support windows mtp-compatible devices support feature called auto sync lets users configure windows media player automatically transfer copied newly acquired content devices whenever connected provided content compatible windows media player auto sync customizable player transfer content meets certain criteria songs rated four stars higher instance changes made file properties user rating file playback counts device propagated back computer device reconnected copies files accessed mtp may remain host computer even reboot accessible user account accessed well user accounts able read user account files including administrative users windows 7 sensor platform supports sensors built mtp-compatible devices free open-source implementation media transfer protocol available libmtp library incorporates product device ids many sources commonly used software mtp support gnome applications like gnome files formerly called nautilus archive manager formerly called file-roller use gio-based gvfs access files mtp devices proper mtp support added gvfs version 1.15.2 2013-01-15 philip langdale early patches gvfs enable google direct i/o extensions available kde project develops mtp kio slave similar level integration gvfs related gnome kde *nix graphical mtp-capable media player gmtp several tools provide fuse based file system mounting mtp devices within unix filesystem hierarchy making accessible program operates files directories examples include mtpfs jmtpfs go-mtpfs simple-mtpfs macos built-in support mtp application digital images third-party drivers mount mtp devices drives also several third-party file transfer applications available mac os x v10.5 later later versions several operating systems including amigaos android aros morphos symbian os support mtp sometimes additional drivers software disadvantage mtp devices android compared usb mass storage although file timestamps preserved copying files android device one computer copying direction file modification timestamps replaced time copy done companies including creative technology intel iriver samsung electronics manufacture devices based microsoft portable media center specification widely adopted mtp supporting devices introduced 2004 consumer electronics show initial period uncertain reactions several large media player producers creative technology iriver adopted mtp protocol place protocols many devices audio software applications support mtp | [
2432,
9762,
2213,
1098,
4459,
6797,
5103,
7983,
8080,
11184,
3923,
10229,
8246,
823,
8410,
1083
] | Train |
5,455 | 3 | One_Per_Desk:one per desk one per desk opd innovative hybrid personal computer/telecommunications terminal based hardware sinclair ql one per desk built international computers limited icl launched uk 1984 result collaborative project icl sinclair research british telecom begun 1981 originally intended incorporate sinclair flat-screen crt technology rebadged versions opd sold united kingdom merlin tonto australia telecom australia computerphone ql opd borrowed 68008 cpu zx8301/8302 ulas 128 kb ram dual microdrives re-engineered icl greater reliability 8049 intelligent peripheral controller unique opd telephony module incorporating intel 8051 microcontroller also controlled keyboard two pstn lines v.21/v.23 modem plus built-in telephone handset ti tms5220 speech synthesiser automatic answering incoming calls opd supplied either 9-inch monochrome white monitor 14-inch colour monitor monitors also housed power supply opd later 3.5 floppy disk drives also available third-party vendors icl preferred supplier uk local government opds found way onto desks council officers due cost tended issued senior often elderly interest computers secretaries handle administrative work many devices simply used telephones system firmware bfs basic functional software unrelated ql qdos operating system although subset superbasic provided microdrive cartridge bfs provided application-switching voice/data call management call answering phone number directories viewdata terminal emulation simple calculator psion applications suite bundled ql also ported opd xchange available optional rom pack optional application software available rom included various terminal emulators satellite computing icl7561 emulator plus action diary presentation software address book inter-opd communications utilities icl supplied application used synchronise national bingo game across hundreds bingo halls uk integral v.23 dialup modem used provide remote communications central server several uk icl mainframe series 39 customers local government ministry defence sectors used statistics applications opd systems view graphical representations mainframe reports integral v.23 modem used download mainframe british telecom business systems sold opd merlin m1800 tonto bt intended tonto centralised desktop information system able access online services mainframes similar systems bt telephone network tonto retailed £1,500 launch opd peripherals software rom cartridges also badged merlin brand bt withdrew support tonto february 1993 name tonto derived outstanding new telecoms opportunity enhanced version opd produced small numbers united states market 68008fn cpu 256 kb ram standard rs-232 port enhanced firmware telephone answering function female voice slight new jersey accent | [
512,
1121,
3936,
5730,
7269,
3594,
10666,
8524,
2541,
406,
4151,
3960,
2045
] | None |
5,456 | 9 | Christopher_Strachey:christopher strachey christopher s. strachey 16 november 1916 – 18 may 1975 british computer scientist one founders denotational semantics pioneer programming language design member strachey family prominent government arts administration academia christopher strachey born 16 november 1916 oliver strachey rachel ray costelloe hampstead england oliver strachey son richard strachey great grandson sir henry strachey 1st baronet elder sister writer barbara strachey 1919 family moved 51 gordon square stracheys belonged bloomsbury group whose members included virginia woolf john maynard keynes christopher uncle lytton strachey 13 christopher went gresham school holt showed signs brilliance general performed poorly admitted king college cambridge college alan turing 1935 continued neglect studies strachey studied mathematics transferred physics end third year cambridge strachey suffered nervous breakdown possibly related coming terms homosexuality returned cambridge managed lower second natural sciences tripos unable continue education christopher joined standard telephones cables stc research physicist first job providing mathematical analysis design electron tubes used radar complexity calculations required use differential analyser initial experience computing machine sparked strachey interest began research topic application research degree university cambridge rejected strachey continued work stc throughout second world war war fulfilled long-standing ambition becoming schoolmaster st edmund school canterbury teaching mathematics physics three years later able move prestigious harrow school 1949 stayed three years january 1951 friend introduced mike woodger national physical laboratory npl lab successfully built reduced version alan turing automatic computing engine ace concept dated 1945 pilot ace spare time strachey developed program game draughts also known checkers finished preliminary version may 1951 game completely exhausted pilot ace memory draughts program tried run first time 30 july 1951 npl unsuccessful due program errors strachey heard manchester mark 1 much bigger memory asked former fellow-student alan turing manual transcribed program operation codes machine around october 1951 summer 1952 program could play complete game draughts reasonable speed strachey programmed first ever music performed computer rendition british national anthem mark ii manchester electronic computer manchester 1951 later year short extracts three pieces recorded bbc outside broadcasting unit national anthem ba ba black sheep mood researchers university canterbury christchurch restored acetate master disc 2016 results may heard soundcloud may 1952 strachey gave two-part talk study control animals machines cybernetics bbc home service science survey programme strachey worked national research development corporation nrdc 1952 1959 working st. lawrence seaway project able visit several computer centres united states catalogue instruction sets later worked programming elliott 401 computer ferranti pegasus computer together donald b. gillies filed 3 patents computing design including design base registers program relocation also worked analysis vibration aircraft working briefly roger penrose developed concept time-sharing 1959 strachey left nrdc become computer consultant working nrdc emi ferranti organisations number wide-ranging projects work included logical design computers providing autocode later design high-level programming languages contract produce autocode ferranti orion computer strachey hired peter landin became one assistant duration strachey consulting period 1962 remaining consultant accepted position cambridge university 1965 strachey accepted position oxford university first director programming research group later university first professor computer science fellow wolfson college oxford collaborated dana scott strachey elected distinguished fellow british computer society 1971 pioneering work computer science 1973 strachey along robert milne began write essay submitted adams prize competition continued work revising book form strachey seen heard recorded lighthill debate ai see lighthill report strachey contracted illness diagnosed jaundice period seeming recovery returned died infectious hepatitis 18 may 1975 developed combined programming language cpl influential set lecture notes fundamental concepts programming languages formalised distinction l- r- values seen c programming language strachey also coined term currying although invent underlying concept instrumental design ferranti pegasus computer macro language m4 derives much strachey gpm general purpose macrogenerator one earliest macro expansion languages department computer science university oxford christopher strachey professorship computing currently held samson abramsky frs november 2016 strachey 100 event held oxford university celebrate centenary strachey birth including viewing weston library oxford christopher strachey archive held bodleian library collection | [
5510,
11020,
5783,
9497,
3737,
2585,
1947,
8879,
5683,
11574,
3767,
1982,
11075,
8262,
5585,
9047,
10729,
2283,
9330,
372,
1783,
2045
] | Test |
5,457 | 3 | Interrupt:interrupt system programming interrupt signal processor emitted hardware software indicating event needs immediate attention interrupt alerts processor high-priority condition requiring interruption current code processor executing processor responds suspending current activities saving state executing function called interrupt handler interrupt service routine isr deal event interruption temporary interrupt handler finishes unless handling interrupt emitted fatal error processor resumes normal activities two types interrupts hardware interrupts software interrupts softirqs hardware interrupts used devices communicate require attention operating system. bare-metal program running cpu oses internally hardware interrupts implemented using electronic alerting signals sent processor external device either part computer disk controller external peripheral example pressing key keyboard moving mouse triggers hardware interrupts cause processor read keystroke mouse position unlike software type described hardware interrupts asynchronous occur middle instruction execution requiring additional care programming act initiating hardware interrupt referred interrupt request irq different devices usually associated different interrupts using unique value associated interrupt makes possible know hardware device caused interrupts interrupt values often called irq lines interrupt lines software interrupts also called exceptions unlike interrupts exceptions occur synchronously respect processor clock sometimes referred synchronous interrupts software interrupt caused either exceptional condition processor special instruction instruction set causes interrupt executed former often called trap exception used errors events occurring program execution exceptional enough handled within program example divide-by-zero exception thrown processor arithmetic logic unit commanded divide number zero instruction error impossible operating system catch exception decide usually aborting process displaying error message software interrupt instructions function similarly subroutine calls used variety purposes request services device drivers like interrupts sent disk controller request reading writing data disk interrupt interrupt handler number hardware interrupts limited number interrupt request irq lines processor may hundreds different software interrupts interrupts commonly used technique computer multitasking especially real-time computing system said interrupt-driven interrupts similar signals difference signals used inter-process communication ipc mediated kernel possibly via system calls handled processes interrupts mediated processor handled kernel kernel may pass interrupt signal process caused typical examples sigsegv sigbus sigill sigfpe hardware interrupts introduced optimization eliminating unproductive waiting time polling loops waiting external events first system use approach dyseac completed 1954 although earlier systems provided error trap functions interrupts may implemented hardware distinct component control lines may integrated memory subsystem implemented hardware distinct component interrupt controller circuit ibm pc programmable interrupt controller pic may connected interrupting device processor interrupt pin multiplex several sources interrupt onto one two cpu lines typically available implemented part memory controller interrupts mapped system memory address space interrupts categorized different types processors typically internal interrupt mask allows software ignore external hardware interrupts set setting clearing mask may faster accessing interrupt mask register imr pic disabling interrupts device cases x86 architecture disabling enabling interrupts processor act memory barrier however may actually slower interrupt leaves machine well-defined state called precise interrupt interrupt four properties interrupt meet requirements called imprecise interrupt phenomenon overall system performance severely hindered excessive amounts processing time spent handling interrupts called interrupt storm univac 1103 computer generally credited earliest use interrupts 1953 earlier univac 1951 arithmetic overflow either triggered execution two-instruction fix-up routine address 0 programmer option caused computer stop ibm 650 1954 incorporated first occurrence interrupt masking national bureau standards dyseac 1954 first use interrupts i/o ibm 704 first use interrupts debugging transfer trap could invoke special routine branch instruction encountered.the mit lincoln laboratory tx-2 system 1957 first provide multiple levels priority interrupts level-triggered interrupt interrupt signaled maintaining interrupt line high low logic level device wishing signal level-triggered interrupt drives interrupt request line active level high low holds level serviced ceases asserting line cpu commands otherwise handles condition caused signal interrupt typically processor samples interrupt input predefined times bus cycle state t2 z80 microprocessor interrupt n't active processor samples cpu n't see one possible use type interrupt minimize spurious signals noisy interrupt line spurious pulse often short noticed multiple devices may share level-triggered interrupt line designed interrupt line must pull-down pull-up resistor actively driven settles inactive state devices actively assert line indicate outstanding interrupt let line float actively drive signaling interrupt line asserted state one one sharing devices signaling outstanding interrupt level-triggered interrupts favored easy share interrupt request line without losing interrupts multiple shared devices interrupt time upon detecting assertion interrupt line cpu must search devices sharing interrupt request line one triggered interrupt detected servicing device cpu may recheck interrupt line status determine whether devices also need service line de-asserted cpu avoids checking remaining devices line since devices interrupt frequently others device interrupts particularly expensive careful ordering device checks employed increase efficiency original pci standard mandated level-triggered interrupts advantage sharing interrupts also serious problems sharing level-triggered interrupts long device line outstanding request service line remains asserted possible detect change status device deferring servicing low-priority device option would prevent detection service requests higher-priority devices device line cpu know service interrupt device permanently blocks interrupts devices edge-triggered interrupt interrupt signaled level transition interrupt line either falling edge high low rising edge low high device wishing signal interrupt drives pulse onto line releases line inactive state pulse short detected polled i/o special hardware may required detect multiple devices may share edge-triggered interrupt line designed interrupt line must pull-down pull-up resistor actively driven settles inactive state default sate devices signal interrupt briefly driving line non-default state let line float actively drive signaling interrupt type connection also referred open collector line carries pulses generated devices analogous pull cord buses trolleys passenger pull signal driver requesting stop however interrupt pulses different devices may merge occur close time avoid losing interrupts cpu must trigger trailing edge pulse e.g rising edge line pulled driven low detecting interrupt cpu must check devices service requirements edge-triggered interrupts suffer problems level-triggered interrupts sharing service low-priority device postponed arbitrarily interrupts high-priority devices continue received get serviced device cpu know service may raise spurious interrupts wo n't interfere interrupt signaling devices however easy edge-triggered interrupt missed example interrupts masked period unless type hardware latch records event impossible recover problem caused many lockups early computer hardware processor know expected something modern hardware often one interrupt status registers latch interrupts requests well-written edge-driven interrupt handling code check registers ensure events missed elderly industry standard architecture isa bus uses edge-triggered interrupts without mandating devices able share irq lines mainstream isa motherboards include pull-up resistors irq lines well-behaved isa devices sharing irq lines work fine parallel port also uses edge-triggered interrupts many older devices assume exclusive use irq lines making electrically unsafe share 3 ways multiple devices sharing line raised first exclusive conduction switching exclusive connection pins next bus connected line listening cards bus must know talk talk ie isa bus talking triggered two ways accumulation latch logic gates logic gates expect continual data flow monitored key signals accumulators trigger remote side excites gate beyond threshold thus negotiated speed required speed versus distance advantages trigger generally method excitation detected rising edge falling edge threshold oscilloscope trigger wide variety shapes conditions triggering software interrupts must built software os app c app trigger table table functions header app os know use appropriately related hardware however confuse hardware interrupts signal cpu cpu enacts software table functions similarly software interrupts systems use hybrid level-triggered edge-triggered signaling hardware looks edge also verifies interrupt signal stays active certain period time common use hybrid interrupt nmi non-maskable interrupt input nmis generally signal major – even catastrophic – system events good implementation signal tries ensure interrupt valid verifying remains active period time 2-step approach helps eliminate false interrupts affecting system message-signaled interrupt use physical interrupt line instead device signals request service sending short message communications medium typically computer bus message might type reserved interrupts might pre-existing type memory write message-signalled interrupts behave much like edge-triggered interrupts interrupt momentary signal rather continuous condition interrupt-handling software treats two much manner typically multiple pending message-signaled interrupts message virtual interrupt line allowed merge closely spaced edge-triggered interrupts merge message-signalled interrupt vectors shared extent underlying communication medium shared additional effort required identity interrupt indicated pattern data bits requiring separate physical conductor many distinct interrupts efficiently handled reduces need sharing interrupt messages also passed serial bus requiring additional lines pci express serial computer bus uses message-signaled interrupts exclusively push button analogy applied computer systems term doorbell doorbell interrupt often used describe mechanism whereby software system signal notify computer hardware device work done typically software system place data well-known mutually agreed upon memory location ring doorbell writing different memory location different memory location often called doorbell region may even multiple doorbells serving different purposes region act writing doorbell region memory rings bell notifies hardware device data ready waiting hardware device would know data valid acted upon would typically write data hard disk drive send network encrypt etc term doorbell interrupt usually misnomer similar interrupt causes work done device however doorbell region sometimes implemented polled region sometimes doorbell region writes physical device registers sometimes doorbell region hardwired directly physical device registers either writing directly physical device registers may cause real interrupt occur device central processor unit cpu one doorbell interrupts compared message signaled interrupts similarities multiple devices sharing interrupt line triggering style act spurious interrupt sources respect many devices one line workload servicing interrupts grows proportion square number devices therefore preferred spread devices evenly across available interrupt lines shortage interrupt lines problem older system designs interrupt lines distinct physical conductors message-signaled interrupts interrupt line virtual favored new system architectures pci express relieve problem considerable extent devices poorly designed programming interface provide way determine whether requested service may lock otherwise misbehave serviced want devices tolerate spurious interrupts also tolerate sharing interrupt line isa cards due often cheap design construction notorious problem devices becoming much rarer hardware logic becomes cheaper new system architectures mandate shareable interrupts interrupts provide low overhead good latency low load degrade significantly high interrupt rate unless care taken prevent several pathologies various forms livelocks system spends time processing interrupts exclusion required tasks extreme conditions large number interrupts like high network traffic may completely stall system avoid problems operating system must schedule network interrupt handling carefully schedules process execution multi-core processors additional performance improvements interrupt handling achieved receive-side scaling rss multiqueue nics used nics provide multiple receive queues associated separate interrupts routing interrupts different cores processing interrupt requests triggered network traffic received single nic distributed among multiple cores distribution interrupts among cores performed automatically operating system routing interrupts usually referred irq affinity manually configured purely software-based implementation receiving traffic distribution known receive packet steering rps distributes received traffic among cores later data path part interrupt handler functionality advantages rps rss include requirements specific hardware advanced traffic distribution filters reduced rate interrupts produced nic downside rps increases rate inter-processor interrupts ipis receive flow steering rfs takes software-based approach accounting application locality performance improvements achieved processing interrupt requests cores particular network packets consumed targeted application typical uses interrupts include following system timers disk i/o power-off signals traps interrupts exist transfer data bytes using uarts ethernet sense key-presses control motors anything else equipment must another typical use generate periodic interrupts dividing output crystal oscillator interrupt handler count interrupts order processor keep time periodic interrupts often used os task scheduler reschedule priorities running processes older computers generated periodic interrupts power line frequency controlled utilities eliminate long-term drift electric clocks example disk interrupt signals completion data transfer disk peripheral process waiting read write file starts another example power-off interrupt predicts requests loss power allowing computer equipment perform orderly shut-down also interrupts used typeahead features buffering events like keystrokes interrupts used allow emulation instructions unimplemented certain models computer line example floating point instructions may implemented hardware systems emulated lower-cost systems execution unimplemented instruction cause interrupt operating system interrupt handler recognize occurrence unimplemented instruction interpret instruction software routine return interrupting program instruction executed provides application software portability across entire line | [
2560,
518,
3594,
6155,
9739,
2574,
6675,
7187,
10776,
25,
10267,
8732,
4637,
1058,
4643,
6180,
9762,
5158,
6187,
3630,
7217,
10803,
9784,
8761,
10809,
7739,
8767,
576,
2625,
9791,
7235,
3148,
6221,
3157,
4695,
3160,
602,
2653,
10333,
97,
... | None |
5,458 | 3 | World_Cup_Soccer:_Italia_'90:world cup soccer italia '90 world cup soccer italia '90 football video game released various home computers 1990 virgin mastertronic officially licensed game tournament known simply italia '90 tronix budget reissues different games also released virgin mastertronic sega consoles world cup italia '90 second licensed game based fifa world cup featuring official logo mascot first ill-fated world cup carnival 1986 fifa world cup game based 1989 game world trophy soccer originally arcade game mastertronic amiga-based arcadia machines virgin games bought mastertronic 1988 game released amiga atari st commodore 64 published virgin mastertronic virgin mastertronic obtained official licence world cup sponsor olivetti adapted world trophy soccer game renaming world cup soccer italia '90 also porting amstrad cpc dos zx spectrum attempts made change set tournament teams available match actual 1990 world cup game presented bird's-eye view player gets near goal switches 3d view penalty area player must try score defender arrives screen player choose play england belgium italy spain teams correct coloured strips tournament actual world cup game received mixed reviews amiga action gave overall score 62 reviewers split reviewer alex said graphics well implemented impressed use first-person perspective shooting saving goal reviewer doug concluded 've played fair share soccer games world cup tie-in certainly best game quite hard get hang even get used controls game still n't play well zzap gave scores 44 amiga version 42 commodore 64 praise given graphics review overwhelmingly negative complaints focusing 3d goalmouth section said n't really work unfair anyway mostly despite officially licensed game accurately reflect tournament someone tell world cup may official licence lacks official fixtures teams game became best seller number one selling spectrum game august september 1990 also unofficial italia '90 games including italy 1990 published u.s. gold released official games 1986 1994 tournaments italy '90 soccer released italy 1988 italia 1990 budget publisher codemasters | [
9006
] | Validation |
5,459 | 5 | John_Romkey:john romkey john romkey donald w. gillies developed first industry tcp/ip stack ibm pc 1983 founding ftp software commercial tcp/ip stack provider 1986 romkey authored first network analyzer netwatch predating network general sniffer served iab simon hackett connected first appliance toaster internet romkey currently owner blue forest research consulting company mit john romkey authored first tcp/ip stack ms-dos founder ftp software company provided commercial package ms-dos ms windows advent microsoft tcp/ip stacks starting windows 95 ftp software well commercial tcp/ip stacks providers driven business | [
9166
] | Test |
5,460 | 9 | Service_Data_Objects:service data objects service data objects technology allows heterogeneous data accessed uniform way sdo specification originally developed 2004 joint collaboration oracle bea ibm approved java community process jsr 235 version 2.0 specification introduced november 2005 key part service component architecture originally technology known web data objects wdo shipped ibm websphere application server 5.1 ibm websphere studio application developer 5.1.2 similar technologies jdo emf jaxb ado.net service data objects denote use language-agnostic data structures facilitate communication structural tiers various service-providing entities require use tree structure root node provide traversal mechanisms breadth/depth-first allow client programs navigate elements objects static fixed number fields dynamic map-like structure allowing unlimited fields specification defines meta-data fields object graph also provided change summaries allow receiving programs act efficiently specification developed ibm rogue wave oracle sap siebel sybase xcalia software ag within oasis member section open csa since april 2007 collaborative work materials remain collaboration platform open soa informal group actors industry following sdo products available open source implementations sdo specification versions history found | [
4960,
3710,
11339,
6860,
3853,
9263,
9467,
10193,
4979,
5210,
3323,
3966
] | Test |
5,461 | 8 | Klout:klout klout website mobile app used social media analytics rate users according online social influence via klout score numerical value 1 100 determining user score klout measured size user social media network correlated content created measure users interact content klout launched 2008 lithium technologies acquired site march 2014 closed service may 25 2018 klout used bing facebook foursquare google+ instagram linkedin twitter youtube wikipedia data create klout user profiles assigned unique klout score klout scores ranged 1 100 higher scores corresponding higher ranking breadth strength one online social influence twitter users assigned score users registered klout could link multiple social networks network data aggregated influence user klout score klout measured influence using data points twitter following count follower count retweets list memberships many spam/dead accounts following influential people retweet unique mentions information combined data number social network followings interactions come klout score social networks influenced user klout score twitter facebook google+ linkedin individuals pages corporate/business youtube instagram klout well wikipedia accounts flickr blogger tumblr last.fm wordpress bing also linked users however weigh klout score microsoft announced strategic investment klout september 2012 whereby bing would access klout influence technology klout would access bing search data scoring algorithm klout scores supplemented three nominally specific measures klout calls true reach amplification network impact true reach based size user engaged audience actively engage user messages amplification score relates likelihood one messages generate actions retweets mentions likes comments network impact reflects computed influence value person engaged audience primary business model klout involved companies paying klout perks campaigns company offers free services products klout users match pre-defined set criteria including scores topics geographic locations klout users receive perks obligation write hope effectively advertise products social media klout offered perks program since 2010 according klout ceo joe fernandez 50 partnerships established november 2011 may 2013 klout announced users claimed 1 million perks across 400 campaigns march 2013 klout announced intention begin displaying business analytics aimed helping business brand users learn online audiences september 2012 klout announced information-sharing partnership bing search engine showing klout scores bing searches allowing klout users post items selected bing social media several objections klout methodology raised regarding process scores generated overall societal effect critics pointed klout scores representative influence person really highlighted barack obama president united states lower influence score number bloggers social critics argued klout score devalued authentic online communication promoted social ranking stratification trying quantify human interaction klout attempted address criticisms updated algorithms barack obama importance better reflected site criticized violating privacy minors exploiting users profit john scalzi described principle behind klout operation socially evil exploitation users status anxiety charles stross described service internet equivalent herpes blogging analysis klout terms conditions revealed company business model illegal united kingdom conflicted data protection act 1998 stross advised readers delete klout accounts opt klout services ben rothke concluded klout work cut seems like need beta longer klout applauded trying measure monstrosity called social influence results influence truth carry little influence klout criticised opacity methodology claimed advanced machine learning techniques used leveraging network theory sean golliher analysed klout scores twitter users found simple logarithm number followers sufficient explain 95 variance november 2015 klout released academic paper discussing methodology ieee bigdata 2015 conference spite controversy employers made hiring decisions based klout scores reported article wired man recruited vp position fifteen years experience consulting companies including america online ford kraft eliminated candidate specifically klout score time 34 favour candidate score 67 | [
10629,
9901,
5133,
3510,
735
] | Test |
5,462 | 7 | Death_Star_(ILM):death star ilm death star name render farm owned industrial light magic ilm cluster computer originally built sgi since converted linux system built racksaver verari systems amd processors system originally 1,500 processors 750 nodes figure doubled ilm tends quiet supercomputer current configuration known | [
10051,
823
] | Test |
5,463 | 2 | XEDIT:xedit xedit visual editor vm/cms using block mode ibm 3270 terminals line-mode terminals also supported xedit much line-oriented modern pc unix editors example xedit supports automatic line numbers many commands operate blocks lines pair features allows selective line column editing command example hides lines matching described pattern col column command allows hiding columns specified hence changing example word appears columns 24 thru 28 yes lines word flexible doable another feature command line allows user type arbitrary editor commands ibm 3270 terminals transmit data computer certain special keys pressed program function key pfk program access key pak xedit less interactive many pc unix editors example continuous spell-checking user types problematic notable features screen layout xedit macros scripts written rexx exec 2 exec xedit exposes majority internal state macro environment allowing macros easily read set internal variables control operation kedit 5 dos os/2 supports external rexx interpreter native os/2 rexx quercus rexx dos quercus rexx replacing older mansfield rexx rather limited kexx subset keditw 1.6.1 windows supports internal kexx 5.62 version rexx language macros arranged codice_1 file format xedit written ibm employee xavier de lamberterie first released 1980 predecessor edit sp sp initialism system product used ibm key influences edit older editor cms edgar ibm program product editor cms xedit supported many edgar commands sos screen output simulation major one xedit also supported exec 2 predecessor rexx pcs unix computers began supplant ibm 3270 terminals users wanted text editors resembled xedit accustomed fill need several developers provided similar programs kedit mansfield software group inc. first xedit clone although originally released 1983 first major release version 3.53 dos released 1985 1990 kedit 4.0 version supporting os/2 included command last version dos os/2 kedit 5.0p4 keditw windows version 1.6.1 dated december 2012 earlier windows versions kedit 1.6 supports syntax highlighting various languages including c cobol fortran html java pascal xbase defined codice_2 file format kedit supports built-in rexx-subset called kexx mansfield software created first non-ibm implementation rexx personal rexx 1985 december 2012 mansfield software released 1.6.1 provide compatibility windows 8 extended support least june 32bit versions work also 64bit versions windows 7 vista directly support unicode may 2018 kedit supports windows 10 mansfield promised website support least end 2018 email support least june 2019 sedit first released 1989 another implementation windows unix supports variant rexx language called s/rexx announced 1994 hessling editor written compatibility kedit xedit mind uses regina open source version rexx begun 1990 first released august 1992 also built several implementations rexx including uni-rexx | [
3430,
8524,
909,
5677,
7217,
6706,
4979,
5492,
7188,
3960,
3323,
8509,
3358
] | None |
5,464 | 9 | Monica_S._Lam:monica s. lam monica sin-ling lam professor computer science department stanford founder moka5 omlet monica lam received b.sc university british columbia 1980 ph.d. computer science carnegie mellon university 1987 lam joined faculty computer science stanford university 1988 contributed research wide range computer systems topics including compilers program analysis operating systems security computer architecture high-performance computing currently directs mobisocial laboratory stanford lam cofounder ceo omlet first mobisocial product launched 2014 omlet open decentralized social networking tool based extensible chat platform collective project research group developed concept livepc subscribers livepc automatically run latest published pc virtual images reboot approach allows computers managed scalably securely 2005 group started company called mokafive transfer technology industry another research project program analysis group developed collection tools improving software security reliability developed first scalable context-sensitive inclusion-based pointer analysis freely available tool called bddbddb allows programmers express context-sensitive analyses simply writing datalog queries tools developed include griffin static dynamic analysis finding security vulnerabilities web applications sql injection static dynamic program query language called pql static memory leak detector called clouseau dynamic buffer overrun detector called cred dynamic error diagnosis tool called diduce previously lam led suif stanford university intermediate format compiler project produced widely used compiler infrastructure known locality optimizations interprocedural parallelization many compiler techniques developed adopted industry research projects included architecture compiler cmu warp machine systolic array vliw processors stanford dash distributed shared memory machine 1998 took sabbatical leave stanford help start tensilica inc. company specializes configurable processor cores lam chaired acm sigplan programming languages design implementation conference 2000 served editorial board acm transactions computer systems numerous program committees conferences languages compilers pldi popl operating systems sosp computer architecture asplos isca lam received following awards honors | [
1952,
899,
7428,
7942,
5418,
9002,
2316,
3468,
9932,
4435,
1783,
2264,
9368,
2558
] | Test |
5,465 | 2 | User_Interface_Privilege_Isolation:user interface privilege isolation user interface privilege isolation uipi technology introduced windows vista windows server 2008 combat shatter attack exploits making use mandatory integrity control prevents processes lower integrity level il sending messages higher il processes except specific set ui messages window messages designed communicate user action processes however used run arbitrary code receiving process context used malicious low il process run arbitrary code context higher il process constitutes unauthorized privilege escalation restricting access vectors code execution data injection uipi mitigate kinds attacks uipi mandatory integrity control generally security feature security boundary ui accessibility applications allowed bypass uipi setting uiaccess value true part manifest file however flag honored windows uipi application must installed program files windows directory application must signed valid code signing authority install application either locations requires least user local administrator privilege running elevated process high integrity level thus malware trying move position bypass uipi must microsoft office 2010 uses uipi protected view sandbox prohibit potentially unsafe documents modifying components files resources system | [
517,
11270,
5643,
4624,
537,
540,
3102,
9762,
8227,
8740,
1577,
10281,
5682,
2101,
10812,
3648,
10310,
1098,
7754,
10828,
4173,
4174,
9808,
4178,
10839,
1113,
603,
9819,
3170,
5225,
622,
9839,
4210,
7796,
1656,
6265,
7290,
4731,
10879,
88... | None |
5,466 | 9 | Manifest_expression:manifest expression manifest expression programming language construct compiler analyse deduce values take without execute program information enable compiler optimizations particular loop nest optimization parallelization data dependency analysis expression called manifest computed outer loop counters constants formal definition given control flow loop condition regulated manifest expressions called manifest loop resp condition practical applications manifest expressions also require expression integral affine stepwise affine variables manifest expression compile time computable function depends manifest variable reference defined variable reference single unambiguous definition particularly relevant procedural languages pointer analysis and/or data flow analysis required find expression defines variable value several defining expressions possible e.g variable assigned condition variable reference manifest | [
1952,
6160,
10013,
8262
] | Test |
5,467 | 2 | Huawei_EMUI:huawei emui huawei emui formerly known emotion ui custom mobile operating system based android huawei uses huawei honor-branded smartphone devices 30 december 2012 huawei introduced emotion ui 1.0 based android 4.0 features voice assistant app chinese customizable homescreens theme-switching company rolled installation files ascend p1 website company claims “ probably world ’ emotional system ” 4 september 2014 company announced emui 3.0 along ascend mate 7 pre-ifa event berlin user interface ever since called emui instead emotion ui features new app store china markets late 2015 huawei launched emui 4.0 redesigned interface based android 6.0 along huawei mate 8 2016 emui 5.0 introduced huawei mate 9 2017 rom images removed official website huawei says provide convenient satisfactory update service since users must rely over-the-air ota updates late 2017 emui 8.0 launched skipping emui 6.0 7.0 combine android versions along huawei mate 10 release emphasises different ai-capabilities huawei unveiled emui 9.0 german consumer electronics exhibition ifa 2018 version emui based android pie new features improvements include new gesture navigation system moving many features bottom screen easier one-handed use reorganized settings page digital balance dashboard gpu turbo 2.0 performance improvements etc update version named emui 9.1 released june 2019 new features improvements include gpu turbo 3.0 new file system called extendable read-only file system erofs file sharing feature onehop huawei vlog improvements new ar features etc emui 10 based android q announced 9 august 2019 huawei developer conference 2019 beta version emui 10 set released 8 september 2019 first coming huawei p30 p30 pro flagship smartphones new features improvements include system-wide dark mode redesigned camera app new emui logo new system font permission control changes introduced android q tweaks animations etc | [
5637,
8719,
3600,
11282,
7700,
9244,
11294,
1578,
5677,
1083,
10303,
7234,
6212,
69,
8262,
4685,
3664,
8280,
8285,
97,
2658,
11391,
1670,
5262,
10393,
7835,
673,
8870,
1191,
196,
8907,
2259,
8413,
9949,
1255,
8940,
5363,
5892,
7428,
2828,... | None |
5,468 | 5 | Ucspi-tcp:ucspi-tcp ucspi-tcp public domain unix tcp command-line tool building tcp client-server applications consists super-server tcpserver tcpclient application life qmail dave sill 2 january 2006 appendix b.3 ucspi-tcp acronym unix client-server program interface tcp pronounced ooks-pie tee see pee tcpserver features built-in tcp wrapper-like access control | [
10436,
1988,
10924,
4369,
5492,
4349
] | Test |
5,469 | 5 | IPv4:ipv4 internet protocol version 4 ipv4 fourth version internet protocol ip one core protocols standards-based internetworking methods internet packet-switched networks ipv4 first version deployed production arpanet 1983 still routes internet traffic today despite ongoing deployment successor protocol ipv6 ipv4 described ietf publication rfc 791 september 1981 replacing earlier definition rfc 760 january 1980 ipv4 uses 32-bit address space limits number unique hosts 4,294,967,296 2 large blocks reserved special networking methods internet protocol protocol defines enables internetworking internet layer internet protocol suite essence forms internet uses logical addressing system performs routing forwarding packets source host next router one hop closer intended destination host another network ipv4 connectionless protocol operates best effort delivery model guarantee delivery assure proper sequencing avoidance duplicate delivery aspects including data integrity addressed upper layer transport protocol transmission control protocol tcp ipv4 uses 32-bit addresses limits address space 2 addresses ipv4 reserves special address blocks private networks ~18 million addresses multicast addresses ~270 million addresses ipv4 addresses may represented notation expressing 32-bit integer value often written dot-decimal notation consists four octets address expressed individually decimal numbers separated periods example quad-dotted ip address 192.0.2.235 represents 32-bit decimal number 3221226219 hexadecimal format 0xc00002eb may also expressed dotted hex format 0xc0.0x00.0x02.0xeb octal byte values 0300.0000.0002.0353 cidr notation combines address routing prefix compact format address followed slash character count consecutive 1 bits routing prefix subnet mask address format common use classful networking practiced example loopback address host 127.0.0.1 commonly written 127.1 given belonged class-a network eight bits network mask 24 bits host number original design ipv4 ip address divided two parts network identifier significant octet address host identifier rest address latter also called rest field structure permitted maximum 256 network identifiers quickly found inadequate overcome limit most-significant address octet redefined 1981 create network classes system later became known classful networking revised system defined five classes classes b c different bit lengths network identification rest address used previously identify host within network different sizes fields different classes network class different capacity addressing hosts addition three classes addressing hosts class defined multicast addressing class e reserved future applications dividing existing classful networks subnets began 1985 publication division made flexible introduction variable-length subnet masks vlsm 1987 1993 based work introduced classless inter-domain routing cidr expressed number bits significant instance /24 class-based scheme dubbed classful contrast cidr designed permit repartitioning address space smaller larger blocks addresses could allocated users hierarchical structure created cidr managed internet assigned numbers authority iana regional internet registries rirs rir maintains publicly searchable whois database provides information ip address assignments internet engineering task force ietf internet assigned numbers authority iana restricted general use various reserved ip addresses special purposes notably addresses used multicast traffic provide addressing space unrestricted uses private networks section begin=ipv4-special-address-blocks/ approximately four billion addresses defined ipv4 18 million addresses three ranges reserved use private networks packets addresses ranges routable public internet ignored public routers therefore private hosts directly communicate public networks require network address translation routing gateway purpose section begin=ipv4-private-networks/ since two private networks e.g. two branch offices directly interoperate via public internet two networks must bridged across internet via virtual private network vpn ip tunnel encapsulates packets including headers containing private addresses protocol layer transmission across public network additionally encapsulated packets may encrypted transmission across public networks secure data rfc 3927 defines special address block 169.254.0.0/16 link-local addressing addresses valid link local network segment point-to-point connection directly connected host uses addresses routable like private addresses addresses source destination packets traversing internet addresses primarily used address autoconfiguration zeroconf host obtain ip address dhcp server internal configuration methods address block reserved standards existed address autoconfiguration microsoft created implementation called automatic private ip addressing apipa deployed millions machines became de facto standard many years later may 2005 ietf defined formal standard rfc 3927 entitled dynamic configuration ipv4 link-local addresses class network 127.0.0.0 classless network 127.0.0.0/8 reserved loopback ip packets whose source addresses belong network never appear outside host modus operandi network expands upon loopback interface networks subnet masks least 24 bits i.e class c networks classful networking networks cidr suffixes /24 /30 255.255.255.0–255.255.255.252 may address ending 0 255 classful addressing prescribed three possible subnet masks class 255.0.0.0 /8 class b 255.255.0.0 /16 class c 255.255.255.0 /24 example subnet 192.168.5.0/255.255.255.0 192.168.5.0/24 identifier 192.168.5.0 commonly used refer entire subnet avoid ambiguity representation address ending octet 0 reserved broadcast address address allows information sent interfaces given subnet rather specific machine generally broadcast address found obtaining bit complement subnet mask performing bitwise operation network identifier words broadcast address last address address range subnet example broadcast address network 192.168.5.0 192.168.5.255 networks size /24 larger broadcast address always ends 255 however mean every address ending 0 255 used host address example /16 subnet 192.168.0.0/255.255.0.0 equivalent address range 192.168.0.0–192.168.255.255 broadcast address 192.168.255.255 one use following addresses hosts even though end 255 192.168.1.255 192.168.2.255 etc also 192.168.0.0 network identifier must assigned interface addresses 192.168.1.0 192.168.2.0 etc. may assigned despite ending 0 past conflict network addresses broadcast addresses arose software used non-standard broadcast addresses zeros instead ones networks smaller /24 broadcast addresses necessarily end 255 example cidr subnet 203.0.113.16/28 broadcast address 203.0.113.31 hosts internet usually known names e.g. www.example.com primarily ip address used routing network interface identification use domain names requires translating called resolving addresses vice versa analogous looking phone number phone book using recipient name translation addresses domain names performed domain name system dns hierarchical distributed naming system allows subdelegation name spaces dns servers since 1980s apparent pool available ipv4 addresses depleted rate initially anticipated original design network address system main market forces accelerated ipv4 address depletion included threat exhaustion motivated introduction number remedial technologies classful networks classless inter-domain routing cidr methods network address translation nat strict usage-based allocation policies provide long-term solution pending address exhaustion ipv6 created 1990s made many addresses available increasing address size 128 bits ipv6 commercial deployment since 2006 primary address pool internet maintained iana exhausted 3 february 2011 last 5 blocks allocated 5 rirs apnic first rir exhaust regional pool 15 april 2011 except small amount address space reserved transition ipv6 allocated much restricted policy accepted standard long term solution use ipv6 increased address size 128 bits providing vastly increased address space also allows improved route aggregation across internet offers large subnetwork allocations minimum 2 host addresses end-users however ipv4-only hosts directly communicate ipv6-only hosts ipv6 alone provide immediate solution ipv4 exhaustion problem migration ipv6 progress completion expected take considerable time ip packet consists header section data section ip packet data checksum footer data section typically link layer encapsulates ip packets frames crc footer detects errors typically end-to-end tcp layer checksum detects errors ipv4 packet header consists 14 fields 13 required 14th field optional aptly named options fields header packed significant byte first big endian diagram discussion significant bits considered come first msb 0 bit numbering significant bit numbered 0 version field actually found four significant bits first byte example internet header length ihl field 4 bits number 32-bit words since ipv4 header may contain variable number options field specifies size header also coincides offset data minimum value field 5 indicates length 5 × 32 bits 160 bits 20 bytes 4-bit field maximum value 15 words 15 × 32 bits 480 bits 60 bytes fragment offset field measured units eight-byte blocks 13 bits long specifies offset particular fragment relative beginning original unfragmented ip datagram first fragment offset zero allows maximum offset 2 – 1 × 8 65,528 bytes would exceed maximum ip packet length 65,535 bytes header length included 65,528 20 65,548 bytes options field often used note value ihl field must include enough extra 32-bit words hold options plus padding needed ensure header contains integer number 32-bit words list options may terminated eol end options list 0x00 option necessary end options would otherwise coincide end header possible options put header follows packets containing options may considered dangerous routers blocked packet payload included checksum contents interpreted based value protocol header field common payload protocols see list ip protocol numbers complete list internet protocol enables traffic networks design accommodates networks diverse physical nature independent underlying transmission technology used link layer networks different hardware usually vary transmission speed also maximum transmission unit mtu one network wants transmit datagrams network smaller mtu may fragment datagrams ipv4 function placed internet layer performed ipv4 routers thus require implementation higher layers function routing ip packets contrast ipv6 next generation internet protocol allow routers perform fragmentation hosts must determine path mtu sending datagrams router receives packet examines destination address determines outgoing interface use interface mtu packet size bigger mtu fragment df bit packet header set 0 router may fragment packet router divides packet fragments max size fragment mtu minus ip header size 20 bytes minimum 60 bytes maximum router puts fragment packet fragment packet following changes example mtu 1,500 bytes header size 20 bytes fragment offsets would multiples formula_1 multiples 0 185 370 555 740 ... possible packet fragmented one router fragments fragmented another router example packet 4,520 bytes including 20 bytes ip header without options fragmented two packets link mtu 2,500 bytes total data size preserved 2480 bytes 2020 bytes 4500 bytes offsets formula_2 formula_3 link mtu 1,500 bytes fragment results two fragments data size preserved 1480 1000 2480 1480 540 2020 also case fragments bit remains 1 fragments came 1 last fragment arrives works usual mf bit set 0 last one course identification field continues value re-fragmented fragments way even fragments re-fragmented receiver knows initially started packet last offset last data size used calculate total data size formula_4 receiver knows packet fragment least one following conditions true receiver identifies matching fragments using foreign local address protocol id identification field receiver reassembles data fragments id using fragment offset fragments flag receiver receives last fragment fragments flag set 0 calculate size original data payload multiplying last fragment offset eight adding last fragment data size given example calculation 495*8 540 4500 bytes receiver fragments reassembled correct sequence according offsets form original datagram ip addresses tied permanent manner hardware identifications indeed network interface multiple ip addresses modern operating systems hosts routers need additional mechanisms identify relationship device interfaces ip addresses order properly deliver ip packet destination host link address resolution protocol arp performs ip-address-to-hardware-address translation ipv4 hardware address also called mac address addition reverse correlation often necessary example ip host booted connected network needs determine ip address unless address preconfigured administrator protocols inverse correlations exist internet protocol suite currently used methods dynamic host configuration protocol dhcp bootstrap protocol bootp infrequently reverse arp | [
4609,
10242,
5636,
1541,
1030,
3592,
8204,
8211,
6681,
6682,
6172,
4638,
10271,
6689,
9251,
2085,
7208,
7214,
8238,
6704,
562,
1586,
9269,
11319,
1081,
11321,
3133,
4158,
5181,
6723,
11332,
8265,
8266,
4687,
6735,
4691,
10341,
10344,
3695,
... | Test |
5,470 | 5 | IPv6:ipv6 internet protocol version 6 ipv6 recent version internet protocol ip communications protocol provides identification location system computers networks routes traffic across internet ipv6 developed internet engineering task force ietf deal long-anticipated problem ipv4 address exhaustion ipv6 intended replace ipv4 december 1998 ipv6 became draft standard ietf subsequently ratified internet standard 14 july 2017 devices internet assigned unique ip address identification location definition rapid growth internet commercialization 1990s became evident far addresses would needed connect devices ipv4 address space available 1998 internet engineering task force ietf formalized successor protocol ipv6 uses 128-bit address theoretically allowing 2 approximately addresses actual number slightly smaller multiple ranges reserved special use completely excluded use total number possible ipv6 addresses times many ipv4 uses 32-bit addresses provides approximately 4.3 billion addresses two protocols designed interoperable complicating transition ipv6 however several ipv6 transition mechanisms devised permit communication ipv4 ipv6 hosts ipv6 provides technical benefits addition larger addressing space particular permits hierarchical address allocation methods facilitate route aggregation across internet thus limit expansion routing tables use multicast addressing expanded simplified provides additional optimization delivery services device mobility security configuration aspects considered design protocol ipv6 addresses represented eight groups separated colons four hexadecimal digits full representation may simplified several methods notation example 2001:0db8:0000:0000:0000:8a2e:0370:7334 becomes 2001 db8 :8a2e:370:7334 ipv6 internet layer protocol packet-switched internetworking provides end-to-end datagram transmission across multiple ip networks closely adhering design principles developed previous version protocol internet protocol version 4 ipv4 addition offering addresses ipv6 also implements features present ipv4 simplifies aspects address configuration network renumbering router announcements changing network connectivity providers simplifies processing packets routers placing responsibility packet fragmentation end points ipv6 subnet size standardized fixing size host identifier portion address 64 bits network security design requirement ipv6 architecture included original specification ipsec addressing architecture ipv6 defined allows three different types transmission unicast anycast multicast internet protocol version 4 ipv4 first publicly used version internet protocol ipv4 developed research project defense advanced research projects agency darpa united states department defense agency becoming foundation internet world wide web ipv4 includes addressing system uses numerical identifiers consisting 32 bits addresses typically displayed quad-dotted notation decimal values four octets range 0 255 8 bits per number thus ipv4 provides addressing capability 2 approximately 4.3 billion addresses address exhaustion initially concern ipv4 version originally presumed test darpa networking concepts first decade operation internet became apparent methods developed conserve address space early 1990s even redesign addressing system using classless network model became clear would suffice prevent ipv4 address exhaustion changes internet infrastructure needed last unassigned top-level address blocks 16 million ipv4 addresses allocated february 2011 internet assigned numbers authority iana five regional internet registries rirs however rir still available address pools expected continue standard address allocation policies one /8 classless inter-domain routing cidr block remains blocks 1024 addresses /22 provided rirs local internet registry lir september 2015 asia-pacific network information centre apnic réseaux ip européens network coordination centre ripe_ncc latin america caribbean network information centre lacnic american registry internet numbers arin reached stage leaves african network information center afrinic sole regional internet registry still using normal protocol distributing ipv4 addresses november 2018 afrinic minimum allocation /22 1024 ipv4 addresses lir may receive additional allocation 80 address space utilized widely expected internet use ipv4 alongside ipv6 foreseeable future direct communication ipv4 ipv6 network protocols possible internet data transmitted form network packets ipv6 specifies new packet format designed minimize packet header processing routers headers ipv4 packets ipv6 packets significantly different two protocols interoperable however transport application-layer protocols need little change operate ipv6 exceptions application protocols embed internet-layer addresses file transfer protocol ftp network time protocol ntp new address format may cause conflicts existing protocol syntax main advantage ipv6 ipv4 larger address space length ipv6 address 128 bits compared 32 bits ipv4 address space therefore 2 approximately addresses 340,282,366,920,938,463,463,374,607,431,768,211,456 approximately 340 undecillion 340 billion billion billion billion addresses ipv4 addresses reserved special uses addition ipv4 address space poorly allocated 2011 approximately 14 available addresses utilized numbers large intent designers ipv6 address space assure geographical saturation usable addresses rather longer addresses simplify allocation addresses enable efficient route aggregation allow implementation special addressing features ipv4 complex classless inter-domain routing cidr methods developed make best use small address space standard size subnet ipv6 2 addresses square size entire ipv4 address space thus actual address space utilization rates small ipv6 network management routing efficiency improved large subnet space hierarchical route aggregation multicasting transmission packet multiple destinations single send operation part base specification ipv6 ipv4 optional although commonly implemented feature ipv6 multicast addressing features protocols common ipv4 multicast also provides changes improvements eliminating need certain protocols ipv6 implement traditional ip broadcast i.e transmission packet hosts attached link using special broadcast address therefore define broadcast addresses ipv6 result achieved sending packet link-local nodes multicast group address ff02 :1 analogous ipv4 multicasting address 224.0.0.1 ipv6 also provides new multicast implementations including embedding rendezvous point addresses ipv6 multicast group address simplifies deployment inter-domain solutions ipv4 difficult organization get even one globally routable multicast group assignment implementation inter-domain solutions arcane unicast address assignments local internet registry ipv6 least 64-bit routing prefix yielding smallest subnet size available ipv6 also 64 bits assignment possible embed unicast address prefix ipv6 multicast address format still providing 32-bit block least significant bits address approximately 4.2 billion multicast group identifiers thus user ipv6 subnet automatically available set globally routable source-specific multicast groups multicast applications ipv6 hosts configure automatically connected ipv6 network using neighbor discovery protocol via internet control message protocol version 6 icmpv6 router discovery messages first connected network host sends link-local router solicitation multicast request configuration parameters routers respond request router advertisement packet contains internet layer configuration parameters routers present special case requirements address configuration often sources autoconfiguration information router prefix advertisements stateless configuration routers achieved special router renumbering protocol renumbering existing network new connectivity provider different routing prefixes major effort ipv4 ipv6 however changing prefix announced routers principle renumber entire network since host identifiers least-significant 64 bits address independently self-configured host ipv6 stateless address auto-configuration unsuitable ipv6 like ipv4 allows stateful configuration dynamic host configuration protocol version 6 dhcpv6 manual static configuration hosts like ipv4 ipv6 supports globally unique ip addresses design ipv6 intended re-emphasize end-to-end principle network design originally conceived establishment early internet approach device network unique address globally reachable directly location internet unique ip address potentially used track network activity device moreover using ipv6 address auto-configuration interface identifier mac address network card used make public ipv6 interface identifier unique exposing type hardware used providing unique handle user online activity autoconfiguration basis network card mac address therefore particular privacy concern mobile devices laptops access internet different local area networks mac based interface identifier would always stay thus mac address based interface identifier used track movement usage particular mobile device ipv6 developed mid-90s internet accessed large number mobile devices privacy priority become today address privacy concerns slaac protocol updated mechanisms termed “ privacy extensions stateless address autoconfiguration ipv6 ” codified rfc 4941 rfc 7217 rfc 8064 prevents ipv6 address leaking mac address device first method generate interface identifier randomly interface identifier generated two devices local area network duplicate address detection dad function ipv6 neighbor discovery protocol ndp resolve situation slaac privacy extension also implements time configurable ipv6 interface addresses discarded new interface identifier generated typically time configured 24 hours ipv6 autoconfiguration generate set new ipv6 host address every day stable address needed another method generate interface identifier secret key network prefix since 2017 method codified rfc 7217 preferred stable private address according ietf late 2014 slaac privacy extensions functionality implemented following operating systems microsoft windows windows xp versions mac os x 10.7 onward versions ios since 4.3 versions android since 4.0 ice cream sandwich privacy extension enabled default windows since xp sp1 os x since 10.7 ios since version 4.3 linux distributions enabled privacy extensions well internet protocol security ipsec originally developed ipv6 found widespread deployment first ipv4 re-engineered ipsec mandatory part ipv6 protocol implementations internet key exchange ike recommended rfc 6434 inclusion ipsec ipv6 implementations downgraded recommendation considered impractical require full ipsec implementation types devices may use ipv6 however rfc 4301 ipv6 protocol implementations implement ipsec need implement ikev2 need support minimum set cryptographic algorithms requirement help make ipsec implementations interoperable devices different vendors ipsec authentication header ah encapsulating security payload header esp implemented ipv6 extension headers packet header ipv6 simpler ipv4 header many rarely used fields moved optional header extensions simplified ipv6 packet header process packet forwarding routers simplified although ipv6 packet headers least twice size ipv4 packet headers packet processing routers generally efficient less processing required routers due headers aligned match common word sizes moreover ipv6 header include checksum ipv4 header checksum calculated ipv4 header recalculated routers every time time live called hop limit ipv6 protocol reduced one absence checksum ipv6 header furthers end-to-end principle internet design envisioned processing network occurs leaf nodes integrity protection data encapsulated ipv6 packet assumed assured link layer error detection higher-layer protocols namely transmission control protocol tcp user datagram protocol udp transport layer thus ipv4 allowed udp datagram headers checksum indicated 0 header field ipv6 requires checksum udp headers ipv6 routers perform ip fragmentation ipv6 hosts required either perform path mtu discovery perform end-to-end fragmentation send packets larger default maximum transmission unit mtu 1280 octets unlike mobile ipv4 mobile ipv6 avoids triangular routing therefore efficient native ipv6 ipv6 routers may also allow entire subnets move new router connection point without renumbering ipv6 packet header minimum size 40 octets 320 bits options implemented extensions provides opportunity extend protocol future without affecting core packet structure however study 2015 indicated network operators dropped ipv6 packets extension headers traversed transit autonomous systems ipv4 limits packets 65,535 2−1 octets payload ipv6 node optionally handle packets limit referred jumbograms large 4,294,967,295 2−1 octets use jumbograms may improve performance high-mtu links use jumbograms indicated jumbo payload option extension header ipv6 packet two parts header payload header consists fixed portion minimal functionality required packets may followed optional extensions implement special features fixed header occupies first 40 octets 320 bits ipv6 packet contains source destination addresses traffic classification options hop counter type optional extension payload follows header next header field tells receiver interpret data follows header packet contains options field contains option type next option next header field last option points upper-layer protocol carried packet payload extension headers carry options used special treatment packet network e.g. routing fragmentation security using ipsec framework without special options payload must less jumbo payload option hop-by-hop options extension header payload must less 4 gb unlike ipv4 routers never fragment packet hosts expected use path mtu discovery make packets small enough reach destination without needing fragmented see ipv6 packet fragmentation ipv6 addresses 128 bits design ipv6 address space implements different design philosophy ipv4 subnetting used improve efficiency utilization small address space ipv6 address space deemed large enough foreseeable future local area subnet always uses 64 bits host portion address designated interface identifier most-significant 64 bits used routing prefix identifier unique within subnet host connected ipv6 mechanism automatic address detection address autoconfiguration always produces unique assignments 128 bits ipv6 address represented 8 groups 16 bits group written four hexadecimal digits sometimes called hextets formally hexadectets informally quibble quad-nibble groups separated colons example representation convenience ipv6 address may abbreviated shorter notations application following rules example application rules loopback address defined may abbreviated using rules ipv6 address may one representation ietf issued proposed standard representing text interfaces ipv6 hosts require link-local address ipv6 link-local address derived mac address interface prefix process involves filling address space prefix bits left-justified most-significant bit filling mac address eui-64 format least-significant bits bits remain filled two parts set zero ipv6 implement broadcast functionality address resolution protocol arp based neighbor discovery protocol ndp nd used link layer map layer 3 ipv6 addresses layer 2 addresses mac address ethernet network cards ndp relies icmpv6 multicast transmission ipv6 hosts verify uniqueness ipv6 addresses local area network lan sending neighbor solicitation message asking link layer address ipv6 address host lan using address responds lan mac addresses designed unique network card minimizes chances duplication generated link-local address ipv6 host determines lan connected router network card ipv6 implementation sending icmpv6 router solicitation message all-routers multicast group link-local address source answer predetermined number attempts host concludes routers connected get response router network information inside needed create globally unique address also two flag bits tell host whether use dhcp get information addresses assignment procedure global addresses similar local address construction prefix supplied router advertisements network multiple prefix announcements cause multiple addresses configured stateless address autoconfiguration slaac requires address block defined local internet registries assigned least blocks divide among subordinate networks initial recommendation stated assignment subnet end-consumer sites replaced recommends giving home sites significantly single recommend every home site given either specifically considered remains seen isps honor recommendation example initial trials comcast customers given single network domain name system dns hostnames mapped ipv6 addresses aaaa quad-a resource records reverse resolution ietf reserved domain ip6.arpa name space hierarchically divided 1-digit hexadecimal representation nibble units 4 bits ipv6 address scheme defined dual-stack host queries dns server resolve fully qualified domain name fqdn dns client host sends two dns requests one querying records querying aaaa records host operating system may configured preference address selection rules alternate record type used early dns implementations ipv6 designed facilitate network renumbering a6 records forward lookup number innovations bit-string labels dname records defined references discussion pros cons schemes deprecated experimental status ipv6 foreseen supplant ipv4 instantaneously protocols continue operate simultaneously time therefore ipv6 transition mechanisms needed enable ipv6 hosts reach ipv4 services allow isolated ipv6 hosts networks reach ipv4 infrastructure according silvia hagen dual-stack implementation ipv4 ipv6 devices easiest way migrate ipv6 many transition mechanisms use tunneling encapsulate ipv6 traffic within ipv4 networks vice versa imperfect solution reduces maximum transmission unit mtu link therefore complicates path mtu discovery may increase latency dual-stack ip implementations provide complete ipv4 ipv6 protocol stacks operating system computer network device top common physical layer implementation ethernet permits dual-stack hosts participate ipv6 ipv4 networks simultaneously method defined device dual-stack implementation operating system ipv4 ipv6 address communicate nodes lan internet using either ipv4 ipv6 domain name system dns protocol used ip protocols resolve fully qualified domain names fqdn ip addresses dual stack requires resolving dns server resolve types addresses dual stack dns server would hold ipv4 addresses records ipv6 addresses aaaa records depending destination resolved dns name server may return ipv4 ipv6 ip address default address selection mechanism preferred protocol needs configured either hosts dns server ietf published happy eyeballs assist dual stack applications connect using ipv4 ipv6 prefer ipv6 connection available however dual-stack also needs implemented routers host service dns server returned ipv6 address dual-stack clients configured prefer ipv6 network able forward ipv6 packets using ipv6 versions routing protocols dual stack networks protocols place application layer migrated ipv6 dual-stack supported major operating system network device vendors legacy networking hardware servers n't support ipv6 internet service providers isps increasingly providing business private customers public-facing ipv6 global unicast addresses however local area network lan ipv4 still used isp provide public facing ipv6 ipv4 lan addresses translated public facing ipv6 address using nat64 network address translation nat mechanism isps provide customers public-facing ipv4 ipv6 addresses thus supporting dual stack networking isps exhausted globally routable ipv4 address pool meanwhile isp customers still trying reach ipv4 web servers destinations significant percentage isps regional internet registry rir zones obtained ipv6 address space includes many world ’ major isps mobile network operators verizon wireless starhub cable chubu telecommunications kabel deutschland swisscom t-mobile internode telefonica isps still allocate customers ipv4 addresses many isps allocate customers ipv6 dual stack ipv4 ipv6 isps report share ipv6 traffic customers network anything 20 40 mid-2017 ipv6 traffic still accounted fraction total traffic several large internet exchange points ixps ams-ix reported 2 seattleix reported 7 2017 survey found many dsl customers served dual stack isp request dns servers resolve fully qualified domain names ipv6 addresses survey also found majority traffic ipv6-ready webserver resources still requested served ipv4 mostly due isp customers use dual stack facility provided isp lesser extent due customers ipv4-only isps technical basis tunneling encapsulating ipv6 packets ipv4 packets outlined rfc 4213 internet backbone ipv4-only one frequently used tunneling protocols 6to4 teredo tunneling also frequently used integrating ipv6 lans ipv4 internet backbone teredo outlined rfc 4380 allows ipv6 local area networks tunnel ipv4 networks encapsulating ipv6 packets within udp teredo relay ipv6 router mediates teredo server native ipv6 network expected 6to4 teredo would widely deployed isp networks would switch native ipv6 2014 google statistics showed use mechanisms dropped almost 0 hybrid dual-stack ipv6/ipv4 implementations recognize special class addresses ipv4-mapped ipv6 addresses addresses typically written 96-bit prefix standard ipv6 format remaining 32 bits written customary dot-decimal notation ipv4 addresses group consist 80-bit prefix zeros next 16 bits ones remaining least-significant 32 bits contain ipv4 address example :ffff:192.0.2.128 represents ipv4 address 192.0.2.128 another deprecated format ipv4-compatible ipv6 addresses :192.0.2.128 significant internal differences ipv4 ipv6 protocol stacks lower-level functionality available programmers ipv6 stack work used ipv4-mapped addresses common ipv6 stacks implement ipv4-mapped address feature either ipv6 ipv4 stacks separate implementations e.g. microsoft windows 2000 xp server 2003 security concerns openbsd operating systems program must open separate socket ip protocol uses systems e.g. linux kernel netbsd freebsd feature controlled socket option ipv6_v6only specified compatibility ipv6 networking mainly software firmware issue however much older hardware could principle upgraded likely replaced instead 2010 american registry internet numbers arin suggested internet servers prepared serve ipv6-only clients january 2012 host software may ipv4 ipv6 networking software may support dual-stack hybrid dual-stack operation many popular applications networking capabilities compliant software transitioning mechanisms outlined ipv6 implemented major operating systems use commercial business home consumer environments personal computers smartphones running recent major operating system versions support ipv6 cablelabs consortium published 160 mbit/s docsis 3.0 ipv6-ready specification cable modems august 2006 docsis 2.0 updated docsis 2.0 ipv6 provide ipv6 support may available firmware upgrade addition nodes ipv6 enabled default software manufacturer may result inadvertent creation shadow networks causing ipv6 traffic flowing networks ipv4 security management place may also occur operating system upgrades newer operating system enables ipv6 default older one failing update security infrastructure accommodate ipv6 lead ipv6 traffic bypassing shadow networks occurred business networks enterprises replacing windows xp systems ipv6 stack enabled default windows 7 systems ipv6 stack implementors therefore recommended disabling ipv4 mapped addresses instead using dual-stack network supporting ipv4 ipv6 necessary research shown use fragmentation leveraged evade network security controls similar ipv4 result requires first fragment ipv6 packet contains entire ipv6 header chain pathological fragmentation cases forbidden additionally result research evasion ra-guard deprecated use fragmentation neighbor discovery discouraged use fragmentation secure neighbor discovery send due anticipated global growth internet internet engineering task force ietf early 1990s started effort develop next generation ip protocol beginning 1992 several proposals appeared expanded internet addressing system end 1992 ietf announced call white papers september 1993 ietf created temporary ad-hoc ip next generation ipng area deal specifically issues new area led allison mankin scott bradner directorate 15 engineers diverse backgrounds direction-setting preliminary document review working-group members j. allard microsoft steve bellovin jim bound digital equipment corporation ross callon wellfleet brian carpenter cern dave clark mit john curran nearnet steve deering xerox dino farinacci cisco paul francis ntt eric fleischmann boeing mark knopper ameritech greg minshall novell rob ullmann lotus lixia zhang xerox internet engineering task force adopted ipng model 25 july 1994 formation several ipng working groups 1996 series rfcs released defining internet protocol version 6 ipv6 starting version 5 used experimental internet stream protocol first rfc standardize ipv6 1995 became obsoleted 1998 july 2017 rfc replaced 1993 introduction classless inter-domain routing cidr routing ip address allocation internet extensive use network address translation nat delayed ipv4 address exhaustion final phase exhaustion started 3 february 2011 universities among early adopters ipv6 virginia tech deployed ipv6 trial location 2004 since expanded ipv6 deployment across campus network 2016 82 traffic network used ipv6 imperial college london experimenting ipv6 deployment since 2003 2016 ipv6 traffic networks averaged 20 40 significant portion ipv6 traffic generated high energy physics collaboration cern depends entirely ipv6 since 2008 domain name system dns supports ipv6 year ipv6 first used major world event 2008 summer olympic games beijing 4 domain names 16.2 networks internet ipv6 protocol support 2014 ipv4 still carried 99 worldwide internet traffic deployment ipv6 internet backbone progress 2018 25.3 54,000 autonomous systems advertised ipv4 ipv6 prefixes global border gateway protocol bgp routing database 243 networks advertised ipv6 prefix internet backbone transit networks offering ipv6 support exist every country globally except parts africa middle east china mid-2018 major european broadband isps deployed ipv6 majority customers british sky broadcasting provided 86 customers ipv6 deutsche telekom 56 deployment ipv6 xs4all netherlands 73 deployment belgium broadband isps voo telenet 73 63 ipv6 deployment respectively united states broadband isp comcast ipv6 deployment 66 2018 comcast reported estimated 36.1 million ipv6 users reported 22.3 million ipv6 users internet exchanges amsterdam seattle large exchanges publicly show ipv6 traffic statistics october 2018 tracking 2.9 7.7 growing 1.9 -2.6 per year respectively percentage users reaching google services ipv6 29 26 alexa top 1000 web servers support ipv6 according internet society report state ipv6 deployment 2018 major mobile network providers drove ipv6 adoption japan mobile network providers nippon telegraph telephone ntt kddi softbank pushed forward ipv6 deployment india ipv6 adoption advanced jio lte network covers india ’ 29 states reaches 80 country ’ population 2018 jio estimated 237.6 million ipv6 users united states ipv6 adoption pioneered verizon wireless 2009 verizon mandated ipv6 operation reduced ipv4 optional capability lte cellular hardware verizon productively deployed ipv6 across existing ipv4 network avoid network complexity arose networks using private network ipv4 address space 2018 80 traffic verizon wireless major content providers using ipv6 united states data centers transitioned ipv6 networking since 2018 facebook eliminating ipv4 data centers network-facing load balancers accept ipv4 ipv6 traffic linkedin microsoft stated intentions move networks ipv6 google linkedin akamai 2018 deploying ipv6 data center networks connecting natively ipv6 end users governments including united states china issued guidelines requirements ipv6 capability | [
4609,
10242,
5636,
1030,
3592,
8211,
6681,
6682,
6172,
9245,
4638,
10271,
6689,
9251,
2085,
7208,
6189,
7214,
8238,
6704,
562,
1586,
2101,
9269,
11319,
1081,
11321,
3133,
4158,
5181,
6723,
6724,
11332,
6214,
8265,
1098,
8266,
5196,
4687,
... | None |
5,471 | 5 | Open_Network_Computing_Remote_Procedure_Call:open network computing remote procedure call open network computing onc remote procedure call rpc remote procedure call system onc originally developed sun microsystems 1980s part network file system project sometimes referred sun rpc onc based calling conventions used unix c programming language serializes data using external data representation xdr also found use encode decode data files accessed one platform onc delivers xdr payload using either udp tcp access rpc services machine provided via port mapper listens queries well-known port number 111 udp tcp onc rpc described rfc 1831 published 1995 rfc 5531 published 2009 current version authentication mechanisms used onc rpc described rfc 2695 rfc 2203 rfc 2623 implementations onc rpc exist unix-like systems microsoft supplies implementation windows microsoft windows services unix product addition number third-party implementation onc rpc windows exist including versions c/c++ java .net see external links 2009 sun relicensed onc rpc code standard 3-clause bsd license reconfirmed oracle corporation 2010 following confusion scope relicensing onc considered lean mean limited appeal generalized rpc system wans heterogeneous environments systems dce corba soap generally used wider role | [
9218,
9731,
10242,
1030,
8211,
6681,
6682,
11292,
10271,
6689,
9251,
2085,
6694,
10789,
7208,
5677,
7214,
8238,
562,
1586,
9269,
11321,
3133,
5181,
6723,
11332,
8265,
4687,
597,
5206,
9813,
11363,
10341,
10344,
3695,
4723,
9333,
2679,
4729,... | Test |
5,472 | 5 | Internet_Protocol:internet protocol internet protocol ip principal communications protocol internet protocol suite relaying datagrams across network boundaries routing function enables internetworking essentially establishes internet ip task delivering packets source host destination host solely based ip addresses packet headers purpose ip defines packet structures encapsulate data delivered also defines addressing methods used label datagram source destination information historically ip connectionless datagram service original transmission control program introduced vint cerf bob kahn 1974 complemented connection-oriented service became basis transmission control protocol tcp internet protocol suite therefore often referred tcp/ip first major version ip internet protocol version 4 ipv4 dominant protocol internet successor internet protocol version 6 ipv6 growing adoption reaching almost 25 internet traffic october 2018 internet protocol responsible addressing host interfaces encapsulating data datagrams including fragmentation reassembly routing datagrams source host interface destination host interface across one ip networks purposes internet protocol defines format packets provides addressing system datagram two components header payload ip header includes source ip address destination ip address metadata needed route deliver datagram payload data transported method nesting data payload packet header called encapsulation ip addressing entails assignment ip addresses associated parameters host interfaces address space divided subnetworks involving designation network prefixes ip routing performed hosts well routers whose main function transport packets across network boundaries routers communicate one another via specially designed routing protocols either interior gateway protocols exterior gateway protocols needed topology network may 1974 institute electrical electronics engineers ieee published paper entitled protocol packet network intercommunication paper authors vint cerf bob kahn described internetworking protocol sharing resources using packet switching among network nodes central control component model transmission control program incorporated connection-oriented links datagram services hosts monolithic transmission control program later divided modular architecture consisting transmission control protocol user datagram protocol transport layer internet protocol internet layer model became known department defense dod internet model internet protocol suite informally tcp/ip ip versions 0 3 experimental versions used 1977 1979 following internet experiment note ien documents describe versions internet protocol prior modern version ipv4 dominant internetworking protocol internet layer use today ipv4 number 4 protocol version number carried every ip datagram ipv4 described 1981 version number 5 used internet stream protocol experimental streaming protocol successor ipv4 ipv6 ipv6 result several years experimentation dialog various protocol models proposed tp/ix pip tuba tcp udp bigger addresses prominent difference version 4 size addresses ipv4 uses 32 bits addressing yielding c. 4.3 billion addresses ipv6 uses 128-bit addresses providing ca 340 undecillion addresses although adoption ipv6 slow united states government systems demonstrated basic infrastructure support ipv6 assignment new protocol ipv6 uncertain due diligence revealed ipv6 yet used previously internet protocols assigned numbers according iana ipv7 ipv8 ipv9 ipv9 aka tcp udp big addresses resurfaced mid-2004 purportedly researched adopted china china disowns april 1 1994 ietf published april fools day joke ipv9 design internet protocol suite adheres end-to-end principle concept adapted cyclades project end-to-end principle network infrastructure considered inherently unreliable single network element transmission medium dynamic terms availability links nodes central monitoring performance measurement facility exists tracks maintains state network benefit reducing network complexity intelligence network purposely located end nodes consequence design internet protocol provides best-effort delivery service characterized unreliable network architectural language connectionless protocol contrast connection-oriented communication various error conditions may occur data corruption packet loss duplication routing dynamic meaning every packet treated independently network maintains state based path prior packets different packets may routed destination via different paths resulting out-of-order delivery receiver error conditions network must detected compensated participating end nodes upper layer protocols internet protocol suite responsible resolving reliability issues example host may buffer network data ensure correct ordering data delivered application ipv4 provides safeguards ensure header ip packet error-free routing node discards packets fail header checksum test although internet control message protocol icmp provides notification errors routing node required notify either end node errors ipv6 contrast operates without header checksums since current link layer technology assumed provide sufficient error detection dynamic nature internet diversity components provide guarantee particular path actually capable suitable performing data transmission requested one technical constraints size data packets allowed given link facilities exist examine maximum transmission unit mtu size local link path mtu discovery used entire intended path destination ipv4 internetworking layer ability automatically fragment original datagram smaller units transmission case ip provides re-ordering fragments delivered order ipv6 network perform fragmentation reassembly per end-to-end principle requires end stations higher-layer protocols avoid exceeding network mtu transmission control protocol tcp example protocol adjusts segment size smaller mtu user datagram protocol udp icmp disregard mtu size thereby forcing ip fragment oversized datagrams design phase arpanet early internet security aspects needs public international network could adequately anticipated consequently many internet protocols exhibited vulnerabilities highlighted network attacks later security assessments 2008 thorough security assessment proposed mitigation problems published ietf pursuing studies | [
4609,
7681,
10242,
11267,
1541,
1030,
11269,
521,
9233,
8211,
5652,
9238,
3609,
6681,
6682,
4638,
10270,
10271,
6689,
9251,
2085,
7208,
1580,
7214,
2607,
8238,
562,
1586,
9779,
9269,
1081,
10809,
5179,
11321,
3133,
4158,
5181,
10302,
6723,
... | Test |
5,473 | 4 | Jim_Christy:jim christy jim christy born 1951 retired government 2013 director futures exploration fx department defense cyber crime center dc3 fx charge establishing strategic relationships us government private agencies academia christy director defense cyber crime institute 2003–2006 director operations defense computer forensics laboratory 2001-2003 christy chief air force office special investigations afosi computer crime investigations unit 1989-1996 founder world largest digital forensics shop notable involvement high priority government computer security christy joined air force 19 later became computer operator pentagon got job computer crime investigator afosi 1986 1986 christy investigated notorious hanover hackers band west german digital delinquents stole information united states defense department computers sold soviet kgb first hacker case afosi agent 1991 christy founded pentagon first digital forensics lab air force 1998 air force lab became department defense computer forensics laboratory supporting investigative agencies department defense 2016 jim christy asked tom colbert join db cooper cold case team christy put together team go undercover online help colbert team prove real identity db cooper identified history channel documentary aired july 2016 | [
10290,
2558
] | Test |
5,474 | 6 | InterMezzo_(file_system):intermezzo file system intermezzo distributed file system written linux kernel distributed gnu general public license included standard linux kernel version 2.4.15 dropped version 2.6 intermezzo designed work top existing journaling file system ext3 jfs reiserfs xfs developed around 1999 intermezzo system consists server holds master copy file system one clients cache file system works either replication mode client maintains duplicate entire file system on-demand mode client requests files needs capturing writes server file system journal streaming client systems replayed intermezzo described high availability file system since client continue operate even connection server lost period disconnection updates logged propagated connection restored conflicts detected handled according conflict resolution policy although best policy likely avoid conflicts typical applications replication mode typical applications on-demand mode distributed file serving file transfer protocol ftp www desktop workstations intermezzo started part coda file system project carnegie mellon university took many design decisions coda share code coda turn branch openafs project designed enhanced scalability performance modularity easy integration existing file systems paper presented open source convention august 1999 peter j. braam michael callahan phil schwan company called stelias computing created web site late 1999 announced beta test version january 2000 although supported standard linux kernel version 2.4 intermezzo removed 2.6 series developers moved new project named lustre company called cluster file systems around 2001 development continued 2003 web site maintained 2008 | [
3328,
2339,
7364,
4490,
5482,
9836,
7789,
7983,
2194,
2199,
2395,
9335,
2974
] | None |
5,475 | 4 | Mobile_device_forensics:mobile device forensics mobile device forensics branch digital forensics relating recovery digital evidence data mobile device forensically sound conditions phrase mobile device usually refers mobile phones however also relate digital device internal memory communication ability including pda devices gps devices tablet computers use mobile phones/devices crime widely recognised years forensic study mobile devices relatively new field dating early 2000s late 1990s proliferation phones particularly smartphones digital devices consumer market caused demand forensic examination devices could met existing computer forensics techniques mobile devices used save several types personal information contacts photos calendars notes sms mms messages smartphones may additionally contain video email web browsing information location information social networking messages contacts growing need mobile forensics due several reasons prominent reasons mobile device forensics particularly challenging number levels evidential technical challenges exist example cell site analysis following use mobile phone usage coverage exact science consequently whilst possible determine roughly cell site zone call made received yet possible say degree certainty mobile phone call emanated specific location e.g residential address result challenges wide variety tools exist extract evidence mobile devices one tool method acquire evidence devices therefore recommended forensic examiners especially wishing qualify expert witnesses court undergo extensive training order understand tool method acquires evidence maintains standards forensic soundness meets legal requirements daubert standard frye standard field study forensic examination mobile devices dates late 1990s early 2000s role mobile phones crime long recognized law enforcement increased availability devices consumer market wider array communication platforms support e.g email web browsing demand forensic examination grew early efforts examine mobile devices used similar techniques first computer forensics investigations analysing phone contents directly via screen photographing important content however proved time-consuming process number mobile devices began increase investigators called efficient means extracting data enterprising mobile forensic examiners sometimes used cell phone pda synchronization software back device data forensic computer imaging sometimes simply performed computer forensics hard drive suspect computer data synchronized however type software could write phone well reading could retrieve deleted data forensic examiners found could retrieve even deleted data using flasher twister boxes tools developed oems flash phone memory debugging updating however flasher boxes invasive change data complicated use developed forensic tools perform neither hash verifications cases audit trails physical forensic examinations therefore better alternatives remained necessary meet demands commercial tools appeared allowed examiners recover phone memory minimal disruption analyse separately time commercial techniques developed recovery deleted data proprietary mobile devices become possible specialist tools moreover commercial tools even automated much extraction process rendering possible even minimally trained first responders—who currently much likely encounter suspects mobile devices possession compared computers—to perform basic extractions triage data preview purposes mobile device forensics best known application law enforcement investigations also useful military intelligence corporate investigations private investigations criminal civil defense electronic discovery mobile device technology advances amount types data found mobile device constantly increasing evidence potentially recovered mobile phone may come several different sources including handset memory sim card attached memory cards sd cards traditionally mobile phone forensics associated recovering sms mms messaging well call logs contact lists phone imei/esn information however newer generations smartphones also include wider varieties information web browsing wireless network settings geolocation information including geotags contained within image metadata e-mail forms rich internet media including important data—such social networking service posts contacts—now retained smartphone 'apps nowadays mostly flash memory consisting nand types used mobile devices external memory devices sim cards sd cards commonly found within gps devices well mobile phones mmc cards cf cards memory stick although technically part mobile device forensics call detail records occasionally text messages wireless carriers often serve back evidence obtained mobile phone seized useful call history and/or text messages deleted phone location-based services turned call detail records cell site tower dumps show phone owner location whether stationary moving i.e. whether phone signal bounced side single tower different sides multiple towers along particular path travel carrier data device data together used corroborate information sources instance video surveillance footage eyewitness accounts determine general location non-geotagged image video taken european union requires member countries retain certain telecommunications data use investigations includes data calls made retrieved location mobile phone determined geographical data must also retained united states however requirement exists standards govern long carriers retain data even must retain example text messages may retained week two call logs may retained anywhere weeks several months reduce risk evidence lost law enforcement agents must submit preservation letter carrier must back search warrant forensics process mobile devices broadly matches branches digital forensics however particular concerns apply generally process broken three main categories seizure acquisition examination/analysis aspects computer forensic process intake validation documentation/reporting archiving still apply seizing mobile devices covered legal considerations digital media mobiles often recovered switched aim seizure preserve evidence device often transported state avoid shutdown would change files addition investigator first responder would risk user lock activation however leaving phone carries another risk device still make network/cellular connection may bring new data overwriting evidence prevent connection mobile devices often transported examined within faraday cage bag even two disadvantages method first renders device unusable touch screen keypad used second device search network connection drain battery quickly devices batteries often recharged investigator risks phone user lock activated therefore network isolation advisable either placing device airplane mode cloning sim card technique also useful device missing sim card entirely second step forensic process acquisition case usually referring retrieval material device compared bit-copy imaging used computer forensics due proprietary nature mobiles often possible acquire data powered mobile device acquisition performed live advanced smartphones using advanced memory management connecting recharger putting faraday cage may good practice mobile device would recognize network disconnection therefore would change status information trigger memory manager write data acquisition tools mobile devices commercial nature consist hardware software component often automated increasing number mobile devices use high-level file systems similar file systems computers methods tools taken hard disk forensics need slight changes fat file system generally used nand memory difference block size used larger 512 bytes hard disks depends used memory type e.g. type 64 128 256 nand memory 16 128 256 512 kilobyte different software tools extract data memory image one could use specialized automated forensic software products generic file viewers hex editor search characteristics file headers advantage hex editor deeper insight memory management working hex editor means lot handwork file system well file header knowledge contrast specialized forensic software simplifies search extracts data may find everything accessdata sleuthkit encase mention forensic software products analyze memory images since tool extracts possible information advisable use two tools examination currently february 2010 software solution get evidences flash memories mobile device data extraction classified according continuum along methods become technical “ forensically sound ” tools become expensive analysis takes longer examiners need training methods even become invasive examiner utilizes user interface investigate content phone memory therefore device used normal examiner taking pictures screen contents method advantage operating system makes unnecessary use specialized tools equipment transform raw data human interpretable information practice method applied cell phones pdas navigation systems disadvantages data visible operating system recovered data available form pictures process time-consuming logical acquisition implies bit-by-bit copy logical storage objects e.g. directories files reside logical storage e.g. file system partition logical acquisition advantage system data structures easier tool extract organize logical extraction acquires information device using original equipment manufacturer application programming interface synchronizing phone contents personal computer logical extraction generally easier work produce large binary blob however skilled forensic examiner able extract far information physical extraction logical extraction usually produce deleted information due normally removed phone file system however cases—particularly platforms built sqlite ios android—the phone may keep database file information overwrite information simply marks deleted available later overwriting cases device allows file system access synchronization interface possible recover deleted information file system extraction useful understanding file structure web browsing history app usage well providing examiner ability perform analysis traditional computer forensic tools physical acquisition implies bit-for-bit copy entire physical store e.g flash memory therefore method similar examination personal computer physical acquisition advantage allowing deleted files data remnants examined physical extraction acquires information device direct access flash memories generally harder achieve device original equipment manufacturer needs secure arbitrary reading memory therefore device may locked certain operator get around security mobile forensics tool vendors often develop boot loaders enabling forensic tool access memory often also bypass user passcodes pattern locks generally physical extraction split two steps dumping phase decoding phase brute force acquisition performed 3rd party passcode brute force tools send series passcodes passwords mobile device time consuming method effective nonetheless technique uses trial error attempt create correct combination password pin authenticate access mobile device despite process taking extensive amount time still one best methods employ forensic professional unable obtain passcode current available software hardware become quite easy break encryption mobile devices password file obtain passcode two manufacturers become public since release iphone5 cellebrite grayshift manufacturers intended law enforcement agencies police departments cellbrite ufed ultimate unit costs 40,000 us dollars grashifts system costs 15,000 brute forcing tools connected device physically send codes ios devices starting 0000 9999 sequence correct code successfully entered code entry successful full access device given data extraction commence early investigations consisted live manual analysis mobile devices examiners photographing writing useful material use evidence without forensic photography equipment fernico zrt edec eclipse project-a-phone disadvantage risking modification device content well leaving many parts proprietary operating system inaccessible recent years number hardware/software tools emerged recover logical physical evidence mobile devices tools consist hardware software portions hardware includes number cables connect mobile device acquisition machine software exists extract evidence occasionally even analyse recently mobile device forensic tools developed field response military units demand fast accurate anti-terrorism intelligence law enforcement demand forensic previewing capabilities crime scene search warrant execution exigent circumstances mobile forensic tools often ruggedized harsh environments e.g battlefield rough treatment e.g dropped submerged water generally impossible one tool capture evidence mobile devices mobile forensic professionals recommend examiners establish entire toolkits consisting mix commercial open source broad support narrow support forensic tools together accessories battery chargers faraday bags signal disruption equipment forth current tools include cellebrite ufed oxygen forensic detective susteen secure view micro systemation xry tools additionally developed address increasing criminal usage phones manufactured chinese chipsets include mediatek mtk spreadtrum mstar tools include cellebrite chinex xry pinpoint open source mobile forensics tools platform-specific geared toward smartphone analysis though originally designed forensics tool bitpim widely used cdma phones well lg vx4400/vx6000 many sanyo sprint cell phones commonly referred chip-off technique within industry last intrusive method get memory image desolder non-volatile memory chip connect memory chip reader method contains potential danger total data destruction possible destroy chip content heat required desoldering invention bga technology possible attach probes pins memory chip recover memory probes bga technique bonds chips directly onto pcb molten solder balls longer possible attach probes desoldering chips done carefully slowly heat destroy chip data chip desoldered pcb baked oven eliminate remaining water prevents so-called popcorn effect remaining water would blow chip package desoldering mainly three methods melt solder hot air infrared light steam-phasing infrared light technology works focused infrared light beam onto specific integrated circuit used small chips hot air steam methods focus much infrared technique desoldering chip re-balling process cleans chip adds new tin balls chip re-balling done two different ways third method makes entire re-balling process unnecessary chip connected adapter y-shaped springs spring-loaded pogo pins y-shaped springs need ball onto pin establish electric connection pogo pins used directly pads chip without balls advantage forensic desoldering device need functional copy without changes original data made disadvantage re-balling devices expensive process costly risks total data loss hence forensic desoldering done experienced laboratories existing standardized interfaces reading data built several mobile devices e.g. get position data gps equipment nmea get deceleration information airbag units mobile devices provide standardized interface exist standard interface mobile devices manufacturers one problem common miniaturizing device parts opens question automatically test functionality quality soldered integrated components problem industry group joint test action group jtag developed test technology called boundary scan despite standardization four tasks jtag device interface used recover memory find correct bits boundary scan register one must know processor memory circuits used connected system bus accessible outside one must find test points jtag interface printed circuit board determine test point used signal jtag port always soldered connectors sometimes necessary open device re-solder access port protocol reading memory must known finally correct voltage must determined prevent damage circuit boundary scan produces complete forensic image volatile non-volatile memory risk data change minimized memory chip n't desoldered generating image slow mobile devices jtag enabled also difficult find test access port mobile devices provide possibility run boot cd connecting network share another device clean tools therefore system commands could way save volatile memory mobile device risk modified system commands must estimated volatile memory really important similar problem arises network connection available secondary memory connected mobile device volatile memory image must saved internal non-volatile memory user data stored likely deleted important data lost system commands cheapest method imply risks data loss every command usage options output must documented commands old modem commands e.g. hayes command set motorola phone commands therefore used device modem support using commands one obtain information operating system deleted data extracted external memory usb flash drive appropriate software e.g. unix command dd needed make bit-level copy furthermore usb flash drives memory protection need special hardware connected computer many usb drives memory cards write-lock switch used prevent data changes making copy usb drive protection switch blocker used mount drive read-only mode exceptional case memory chip desoldered sim memory cards need card reader make copy sim card soundly analyzed possible recover deleted data like contacts text messages android operating system includes dd command blog post android forensic techniques method live image android device using dd command demonstrated flasher tool programming hardware and/or software used program flash device memory e.g. eeprom flash memory tools mainly originate manufacturer service centers debugging repair upgrade services overwrite non-volatile memory depending manufacturer device also read memory make copy originally intended backup memory protected reading e.g. software command destruction fuses read circuit note would prevent writing using memory internally cpu flasher tools easy connect use change data dangerous options make complete copy general exists standard constitutes supported device specific product led situation different vendors define supported device differently situation makes much harder compare products based vendor provided lists supported devices instance device logical extraction using one product produces list calls made device may listed supported vendor another vendor produce much information furthermore different products extract different amounts information different devices leads complex landscape trying overview products general leads situation testing product extensively purchase strongly recommended quite common use least two products complement mobile phone technology evolving rapid pace digital forensics relating mobile devices seems stand still evolving slowly mobile phone forensics catch release cycles mobile phones comprehensive depth framework evaluating mobile forensic toolkits developed data appropriate tools techniques type phone made available timely manner anti-computer forensics difficult small size devices user restricted data accessibility nevertheless developments secure memory hardware security circuits cpu memory chip memory chip read even desoldering | [
2437,
7560,
5010,
9235,
4500,
8469,
3099,
7968,
6177,
9762,
5284,
5546,
8237,
11182,
7983,
10290,
4789,
1083,
8635,
2494,
830,
4041,
7369,
6475,
10189,
4049,
2901,
1121,
4834,
7525,
9319,
1776,
7160,
11642
] | Test |
5,476 | 7 | Federated_content:federated content federated content digital media content designed self-managing support reporting rights management peer-to-peer p2p network ex audio stored digital rights management drm file format | [
8640
] | Test |
5,477 | 9 | Robot_Battle:robot battle robot battle programming game microsoft windows players design code adaptable battling robots robot battle takes strategy rather reflexes accuracy timing succeed differentiates one robot next programming player responsible game inspired similar game robotwar robot battle created brad schick 1994 released public free year reached version 1.2 went many versions seeming peak 1.3 1995 1997 david finch released 1.33 community time held together robot battle mailing list rbml closed february 2004 robot battle registry internet forum opened tournaments held new players could helped complicated coding questions could posed answered early 2001 brad began work robot battle 1.4 promised massive upgrade rbml alive ideas suggestions offers help resulted robot battle new players know including new features mid-2001 small company called garagegames showed interest robot battle brad agreed sell game soon first official 1.4 release december 2002 work began robot battle registry forum way storing robots people download well way organise advertise tournaments registry opened may 2003 robot battle steadily growing user base communications registry forums irc first registry available people purchased game since opened anybody robot battle distributed mpl open-source license allowing anybody read code help design robots programs interact game somehow robot battle full version published free november 23 2004 robots robot battle three separate parts body contains tracks square size 33x33 rotates speed 5 degrees per turn gun ability shoot energy missiles damage robots destroy missiles mines cookies collision rotate 10 degrees per turn radar ability scan cookies mines robots walls rotate 15 degrees per turn robots programmed robot scripting language rsl created text editors notepad robots usually worked distributed .prg format coders choose scramble robots distribute .dst files scrambling software created brad robot battle 1.3 later edited joseph fowler aka sorcerer mark duller give two separate programs compatible robot battle 1.4 rsl said resemble many programming languages including basic c javascript robot one many sections separated section names curly brackets init required section sections defined event priority core section need priority contains details robot n't anything else ascan used usually lowest priority least important takes place whenever robot moving events take place object detected radar collided body parts robot controlled commands easiest way make robot look ones come free game combo smart corner events fire rammer shell side liner target walls ii zag robots demonstrate uses simple commands well advanced tactics use radio differences creating robot turned | [
6797,
5251,
2045,
3462
] | None |
5,478 | 0 | Eckhard_Bick:eckhard bick eckhard bick born 16 july 1958 german-born esperantist studied medicine bonn works researcher computational linguistics active esperanto youth group bonn germana esperanto-junularo nationwide esperanto youth federation since marriage danish woman family live denmark bick obtained degrees english 1983 medicine 1984 pedagogics 1985 bonn university m.a north germanic languages portuguese institute linguistics aarhus university 1994-99 bick dissertation project lexicography described palavras so-called progressive level parser dependency grammar portuguese language based constraint grammar paradigm supported corpus-based research thesis analyzes portuguese lexical morphology morphosyntactics syntax semantics semantic parsing well computer-mediated learning translation book illustrator uta hasekamp co-author tesi la testudo german-language esperanto primer translated books songs plays esperanto published various esperanto games also author extensive esperanto-danish dictionary 35,000 headwords 1990 342 pp. extent comparable classic store esperanto-dansk ordbog great esperanto-danish dictionary lorenz friis peter frey three editions published 1938 1953 1969 31,000 headwords bick dictionary up-to-date today leading dictionary type since 1996 bick led visual interactive syntax learning project institute language communication university southern denmark engaged design programming grammatical tools internet also builds constraint grammars phrase structure grammars visl languages lexical resources annotated corpora known treebanks corpora include grammatical analysis word visl team generated manually revised language data 27 languages cooperation grammarsoft commercializing technology developed rule-based taggers parsers nine languages including english portuguese esperanto scandinavian languages linguist bick researches natural language parsing corpus linguistics though specializes portuguese danish also developed constraint grammars english spanish french language esperanto | [
1890,
4070,
7599,
10610,
5399
] | None |
5,479 | 4 | Xetron:xetron xetron corporation northrop grumman corporation subsidiary government contractor developing software communications systems xetron used produce popular xetron spl-60 low noise audio amplifier tunable comb notch filter 9 july 1992 first iboc transmission sent xetron offices cincinnati since company contracted usadr work project 2000 company awarded 2.1 million contract viasat develop mids-lvt radio system 2011 revealed company worked hbgary palantir attribution deanonymizing internet activists anonymous according documents leaked edward snowden sharing hacking techniques intelligence agencies since least 2010 year developed malicious windows software named orca preventing malware detection antivirus software wikileaks vault 7 disclosures 2017 revealed xetron developed tools allowing unauthorized access cisco routers cia well cinnamon − implant cisco devices according documents also developed software control compromised computers via command servers agency march 2017 company name shows nearly 400 leak documents intercept revealed 2017 employees xetron suddenly subjected polygraph unclear whether due active investigation source leaks simply stepped-up security requirement | [
8320,
2213,
3495,
297,
7893
] | Test |
5,480 | 2 | Communications_Controller_for_Linux:communications controller linux communications controller linux communications controller linux system z ccl ibm software product announced 2005 runs linux system z emulates ibm 37xx communications controller ccl runs unmodified ibm network control program ncp allow consolidation sna network infrastructure ip according ibm sna traffic enters leaves ccl sna network flows osa adapter however wide area network infrastructure need sna consolidate sna traffic use tunneling data link switching dlsw encapsulate sna communication ip network ccl supports ethernet token ring local area network lan connectivity directly connectivity dlsw router x.25 requires ibm npsi software plus third party package ccl support bisync start-stop according ibm figures ccl offers performance average 3745 | [
3323,
863
] | None |
5,481 | 3 | ThinkPad_UltraBay:thinkpad ultrabay ultrabay originally ibm name swappable drive bay thinkpad range laptop computers thinkpad product line sold lenovo concept name stayed furthermore used lenovo ideapad series laptops introduced thinkpad 750 series 1995 technology gone redesigns almost every new generation thinkpad may lead confusion following table gives overview different ultrabay types models occurred drives available note optical drive bay g series r40e series thinkpads ultrabay drives fixed removable however mechanically ultrabay 2000-device without surrounding caddy media side different ultrabays relate form factor drives accept machines accept ultrabay devices 12.5 mm thick whereas others limited devices 9.5 mm thick ideapad y400 y500 laptops ultrabay slot swapped another hard drive another fan another nvidia gt650m gt750m gpu work sli system primary video card increased graphics performance existing orders ultrabay y500 dvd burner built optical drive cancelled early june 2013 starting 2014 lenovo changed design thinkpad bay adapter dropped ultrabay terminology use remained thinkpad w540 product option removable serial ata sata caddy accessory screw driver allowed optical drive replaced second 2.5 inch sata storage device battery expansion caddy bay longer offered earlier hot-swap functionality essentially rendered difficult impossible | [
4259,
5606,
3304,
271,
2165,
3323
] | Train |
5,482 | 4 | Rsync:rsync rsync utility efficiently transferring synchronizing files computer external hard drive across networked computers comparing modification times sizes files commonly found unix-like operating systems rsync algorithm type delta encoding used minimizing network usage zlib may used additional data compression ssh stunnel used security rsync typically used synchronizing files directories two different systems example command codice_1 run rsync use ssh connect codice_2 codice_3 connected invoke remote host rsync two programs determine parts local file need transferred remote file matches local one rsync also operate daemon mode serving receiving files native rsync protocol using rsync // syntax licensed gnu general public license andrew tridgell paul mackerras wrote original rsync first announced 19 june 1996 tridgell discusses design implementation performance rsync chapters 3 5 ph.d. thesis 1999 currently maintained wayne davison flexibility speed scriptability codice_4 become standard linux utility included popular linux distributions ported windows via cygwin grsync sfu freebsd netbsd openbsd macos similar codice_5 codice_6 codice_7 codice_4 requires specification source destination local either may remote generic syntax src file directory list multiple files directories copy dest file directory copy square brackets indicate optional parameters codice_4 synchronize unix clients central unix server using codice_4/codice_11 standard unix accounts used desktop environments example efficiently synchronize files backup copy external hard drive scheduling utility codice_12 carry tasks automated encrypted codice_4-based mirroring multiple hosts central server command line mirror freebsd might look like apache http server supports rsync updating mirrors preferred simplest way mirror putty website current directory use rsync way mimic capabilities time machine macos see also tym make full backup system root directory rsync process operates communicating another rsync process sender receiver startup rsync client connects peer process transfer local file systems mounted host peer created fork setting suitable pipes connection remote host involved rsync starts process handle connection typically secure shell upon connection command issued start rsync process remote host uses connection thus established alternative remote host runs rsync daemon rsync clients connect opening socket tcp port 873 possibly using proxy rsync numerous command line options configuration files specify alternative shells options commands possibly full path port numbers besides using remote shells tunnelling used remote ports appear local server rsync daemon runs possibilities allow adjusting security levels state art naive rsync daemon enough local network default rsync determines files differ sending receiving systems checking modification time size file time size different systems transfers file sending receiving system requires reading file directory information quick miss unusual modifications change neither rsync performs slower comprehensive check invoked codice_14 forces full checksum comparison every file present systems barring rare checksum collisions avoids risk missing changed files cost reading every file present systems rsync utility uses algorithm invented australian computer programmer andrew tridgell efficiently transmitting structure file across communications link receiving computer already similar identical version structure recipient splits copy file chunks computes two checksums chunk md5 hash weaker easier compute 'rolling checksum sends checksums sender sender quickly computes rolling checksum chunk version file differ must sent 're sender uses computationally expensive md5 hash verify chunks sender sends recipient parts file match along information merge blocks recipient version makes copies identical small probability differences chunks sender recipient detected thus remain uncorrected 128 bits md5 plus 32 bits rolling checksum probability order rolling checksum used rsync based mark adler adler-32 checksum used zlib based fletcher checksum sender recipient versions file many sections common utility needs transfer relatively little data synchronize files typical data compression algorithms used files similar uncompressed may different compressed thus entire file need transferred compression programs gzip provide special rsyncable mode allows files efficiently rsynced ensuring local changes uncompressed file yield local changes compressed file rsync supports key features aid significantly data transfers backup include compression decompression data block block using zlib support protocols ssh stunnel utility uses rsync algorithm generate delta files difference file file b like utility diff different delta format delta file applied file turning file b similar patch utility rdiff works well binary files rdiff-backup maintained since 2009 maintains backup mirror file directory either locally remotely network another server rdiff-backup stores incremental rdiff deltas backup possible recreate backup point librsync library used rdiff independent implementation rsync algorithm use rsync network protocol share code rsync application used dropbox rdiff-backup duplicity utilities acrosync library independent cross-platform implementation rsync network protocol unlike librsync wire-compatible rsync protocol version 29 30 released reciprocal public license used commercial rsync software acrosync duplicity variation rdiff-backup allows backups without cooperation storage server simple storage services like amazon s3 works generating hashes block advance encrypting storing server retrieves incremental backup rest data also stored encrypted security purposes macos 10.5 later special codice_15 codice_16 switch allows retaining much hfs file metadata syncing two machines supporting feature achieved transmitting resource fork along data fork zsync rsync-like tool optimized many downloads per file version zsync used linux distributions ubuntu distributing fast changing beta iso image files zsync uses http protocol .zsync files pre-calculated rolling hash minimize server load yet permit diff transfer network optimization rclone open-source tool inspired rsync focuses exclusively cloud storage system providers supports 10 different providers provides rsync-like interface backup local data providers | [
2432,
10242,
4355,
260,
5251,
7685,
10631,
2568,
6280,
9484,
4623,
3218,
5397,
2198,
3350,
1049,
922,
9625,
10269,
5407,
3744,
35,
6565,
3366,
10405,
6319,
7983,
3889,
8114,
6330,
956,
4797,
5566,
5313,
11201,
7364,
2887,
9167,
4561,
3794... | Test |
5,483 | 3 | Caja_project:caja project caja pronounced google project javascript implementation virtual iframes based principles object-capabilities caja takes javascript technically ecmascript 5 strict mode code html css input rewrites safe subset html css plus single javascript function free variables means way function modify object given reference object host page instead giving direct references dom objects host page typically gives references wrappers sanitize html proxy urls prevent redirecting page allows caja prevent certain phishing attacks prevent cross-site scripting attacks prevent downloading malware also since rewritten programs run frame host page allow one program export object reference another program inter-frame communication simply method invocation word caja spanish box safe bank idea caja safely contain javascript programs well capabilities-based javascript caja currently used google google sites google apps script products 2008 myspace yahoo allianz deployed early version caja later abandoned | [
4096,
8719,
3600,
7700,
9244,
8735,
10284,
5677,
3633,
10813,
4171,
4683,
11343,
3664,
10835,
84,
603,
8285,
2658,
5219,
4198,
3700,
8821,
6791,
7816,
5262,
6800,
11408,
8854,
10393,
8858,
6813,
7841,
3761,
1203,
5311,
7359,
7871,
196,
32... | None |
5,484 | 2 | Multiple_Console_Time_Sharing_System:multiple console time sharing system multiple console time sharing system mcts operating system developed general motors research laboratories 1970s control data corporation star-100 supercomputer mcts built support gm computer-aided design cad applications mcts based multics | [
2179,
10499,
10883,
394,
3978,
1804,
6797,
273,
7057,
6675,
7187,
9361,
9366,
11539,
6296,
25,
10776,
11667,
8092,
4637,
7325,
9887,
10016,
9762,
421,
5158,
10235,
2345,
7983,
3248,
7217,
11184,
6837,
823,
9784,
4409,
10809,
6075,
7483,
6... | None |
5,485 | 5 | Mapping_of_Airline_Traffic_over_Internet_Protocol:mapping airline traffic internet protocol matip stands mapping airline traffic means airline reservation ticketing messaging traffic tcp/ip defined rfc 2351 makes use well-known ports 350 351 matip preferred classic airline traffic lines | [
5472,
6993
] | None |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.